Gujarat Technological UniversitySummer 2026 examination

GTU BE03000081 Data Structures Summer 2026 Question Paper & PDF

B.E. · Common Engineering · Semester 3 · Subject code BE03000081
Download official PDFView PDF here
Share with your class
Total
70 marks
To pass
23 marks (33%)
Duration
2.5 Hours 2:30 PM – 5:00 PM
Questions
5 with internal choice
No solutions on this paper yetNeed them for your exam? Ask once. Papers that students ask for are solved first, and we aim to add them within 24 hours.

Q.1

14 Marks
(a)
3 marks
Differentiate between Linear and Non-Linear Data Structures.
(b)
4 marks
Explain storage representation of Primitive and Non Primitive Data Structures .
(c)
7 marks

Convert the following expression to postfix using stack. Show each step clearly ((A-B)+D/((E+F)*G))

Q.2

14 Marks
(a)
3 marks
Differentiate Array and Linked lists.
(b)
4 marks

Explain the memory representation of a one-dimensional and two-dimensional array with examples.

(c)
7 marks
Write an algorithm for the following stack operations.
1)PUSH
2)POP
3)DISPLAY
(c)
7 marks
What is queue? Explain operations on queue in detail.

Q.3

14 Marks
(a)
3 marks
Explain Circular queue in detail.
(b)
4 marks
Write Algorithm to insert new node after given location in singly linked list.
(c)
7 marks
Write an algorithm to delete a node from a binary search tree.
(a)
3 marks
Construct a binary tree from the traversals given below:

Inorder: D, B, A, E, G, C, H, F, I Preorder: A, B, D, C, E, G, F, H, I

(b)
4 marks
What is a graph? Explain various representations of graphs.
(c)
7 marks

What is doubly linked list? Write Algorithm for insertion and deletion in doubly linked list.

Q.4

14 Marks
(a)
3 marks

Define the following: 1. Binary Search Tree 2. Complete Binary Tree 3. Complete Graph

(b)
4 marks
Differentitae: BFS and DFS.
(c)
7 marks
Explain Kruskal’s algorithm with suitable example.
(a)
3 marks

Search the number 50 from the given data using binary search technique. Illustrate the searching process. 10, 14, 20, 39, 41, 45, 49, 50, 60

(b)
4 marks
Explain Conversion of General Trees To Binary Trees with example.
(c)
7 marks
Explain Prim’s algorithm with suitable example.

Q.5

14 Marks
(a)
3 marks
Compare linear search and binary search in terms of their time complexity.
(b)
4 marks
Write an algorithm to sort an array using insertion sort method.
(c)
7 marks
Describe various collision resolution techniques in hashing.
(a)
3 marks
Explain Sequential file organizations and list its advantages and disadvantages.
(b)
4 marks
What is hashing? Explain any two hash functions in detail.
(c)
7 marks
Write an algorithm for merge sort.

More Data Structures papers

Questions repeat across sessions. Working through two or three papers shows you which topics GTU asks most.

Winter 202570 marks · 5 questions

Other Semester 3 subjects

BE Common

2130002
Advance Engineering Mathematics
2130003
Mechanics of Solids
3130005
Complex Variables and Partial Differential Equations
BE03000051
Professional Communication and Ethics

Preparing with friends?

Send this paper to your class group. Every question has its own link.

About this paper

Official Gujarat Technological University (GTU) examination paper for Data Structures (Summer 2026, B.E. · Common Engineering, Sem 3). Features complete 70-mark regular & remedial examination pattern, official marking distribution across all 5 questions, and direct 1-click official PDF download.

Transcribed for student exam preparation from Gujarat Technological University official examination archives. Questions, syllabus guidelines, and curriculum marking schemes remain the intellectual property of Gujarat Technological University.

Download official PDF All Data Structures Papers (2) →Report a typo or correction
ViewDownload PDF