UnFoldPrep
Browse Archive
Gujarat Technological UniversitySummer 2026 Examination

GTU 3130702 Data Structures (DS) Summer 2026 Paper Solution & PDF

B.E. · Computer Engineering · Semester 3 · Subject Code: 3130702
Download Official GTU PDF
Share:
Total Marks70 MarksExternal theory exam
Passing Marks23 Marks33% minimum cutoff
Exam Duration2.5 Hours2:30 PM – 5:00 PM
Paper Structure5 QuestionsWith internal OR choices
Jump toQ1Q2Q3Q4Q5

Question 1

14 MarksMedium
(a)
Define data structure. What are the applications of data structures?
3 Marks
(b)
Explain the concept of amortized time complexity with an example.
4 Marks
(c)

Explain the bubble sort algorithm. How can you optimize bubble sort to reduce the number of swaps?

7 Marks

Question 2

14 MarksMedium
(a)

How does a linked list differ from an array in terms of structure and memory allocation?

3 Marks
(b)
Describe the concept of a double-ended queue and its uses.
4 Marks
(c)

Write an algorithm to convert infix expression into postfix expression using stack.

7 Marks
OR OPTION
(c)

Write an algorithm to insert an element after the given node in the singly linked list.

7 Marks

Question 3

14 MarksMedium
(a)
Describe the basic operations that can be performed on linear data structures.
3 Marks
(b)
Explain the tower of Hanoi problem.
4 Marks
(c)
Write a short note on AVL tree.
7 Marks
OR OPTION
(a)
What is multiple stack? How it is useful?
3 Marks
(b)

Describe how insertion and deletion operations are applied to the priority queue.

4 Marks
(c)
Write a short note on 2-3 tree.
7 Marks

Question 4

14 MarksMedium
(a)
Define: 1. Sibling 2. Height of tree 3. Forest
3 Marks
(b)
Describe a weighted graph and its applications.
4 Marks
(c)
Explain breadth-first search (BFS) algorithm.
7 Marks
OR OPTION
(a)
How new node can be inserted into a binary search tree?
3 Marks
(b)
Describe a cyclic graph and an acyclic graph with examples.
4 Marks
(c)
Discuss Dijkstra's algorithm for finding the shortest path.
7 Marks

Question 5

14 MarksMedium
(a)
Describe the characteristics of a good hash function.
3 Marks
(b)

Apply merge sort on the following array. A=[38, 27, 43, 10]

4 Marks
(c)
Explain indexed sequential file and sequential file structure.
7 Marks
OR OPTION
(a)
Explain random file organization.
3 Marks
(b)
Sort the elements 77, 49, 25, 12, 9, 33, 56, 81 using selection sort.
4 Marks
(c)
Describe any two collision resolution techniques.
7 Marks
College Exam Groups

Studying for Data Structures?

Circulate this solved paper with KaTeX formulas and 1-click AI step solvers to your batchmates on WhatsApp or Telegram.

Related papers

About this Examination Paper & Attribution

Official Gujarat Technological University (GTU) examination paper and step-by-step solutions for Data Structures (DS) (Summer 2026, B.E. · Computer 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 PDF