UnFoldPrep
Browse Archive
Gujarat Technological UniversitySummer 2025 Examination

GTU 3130702 Data Structures (DS) Summer 2025 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)

What is the best-case, average-case, and worst-case time complexity analysis?

3 Marks
(b)

Explain row-major order and column-major order representation of 2-D array.ss

4 Marks
(c)
Construct a Binary Search Tree for the following data.

21, 51, 12, 45, 17, 71, 19, 47, 78. Write Pre-order, In-order, and Post-order traversal of constructed BST.

7 Marks

Question 2

14 MarksMedium
(a)
Define following terms:
1Full Binary Tree 2. Complete Binary Tree 3. Skewed Binary Tree
3 Marks
(b)

Write the importance of asymptotic analysis. Is O(n log2n2) faster than O(n2)? Justify your answer with an example.

4 Marks
(c)
Convert the following infix expression into a postfix expression using stack.

(a+b)^((c*d)/(e-f))

7 Marks
OR OPTION
(c)
Write an algorithm to convert infix expression into postfix expression.
7 Marks

Question 3

14 MarksMedium
(a)
Illustrate how stack is used in the recursion.
3 Marks
(b)
Describe Threaded Binary Tree with example.
4 Marks
(c)
Write a C program for the following operations on a circular queue.
1Insert 2. Delete 3. Display
7 Marks
OR OPTION
(a)
Write a recursive solution for Tower of Hanoi problem.
3 Marks
(b)
Explain the DFS traversal of the graph with an example.
4 Marks
(c)

Write an algorithm to sort existing singly linked list in acceding order according to the information field.

7 Marks

Question 4

14 MarksMedium
(a)
Define the following terms:
1Field 2. Record 3. File
3 Marks
(b)

Sort the following data using merge sort. 50, 20, 70, 05, 30, 80, 55, 25

4 Marks
(c)

Find the minimum spanning tree of the following graph using Kruskal’s algorithm.

7 Marks
OR OPTION
(a)
What is hashing? Write the properties of a good hash function.
3 Marks
(b)

Sort the following data using quick sort. 50, 30,80,40, 35,70, 60, 20,75

4 Marks
(c)
Find the shortest path from A to F using Dijkstra’s Algorithm.
7 Marks

Question 5

14 MarksMedium
(a)
Compare linear search and binary search in terms of their time complexity.
3 Marks
(b)
Write a C program for a bubble sort.
4 Marks
(c)
What is hash collision? Explain collision resolution techniques.
7 Marks
OR OPTION
(a)

Does a pivot selection method affect the time complexity of quick sort? Justify your answer.

3 Marks
(b)
Write a C program for a selection sort.
4 Marks
(c)
List various file organizations and explain one in detail.
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 2025, 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