UnFoldPrep
Browse Archive
Gujarat Technological UniversitySummer 2024 Examination

GTU 3130702 Data Structures (DS) Summer 2024 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 Hours10:30 AM – 1:00 PM
Paper Structure5 QuestionsWith internal OR choices
Jump toQ1Q2Q3Q4Q5

Question 1

14 MarksMedium
(a)
Explain data structure. Enlist and explain the importance of data structure.
3 Marks
(b)
Define time and space complexity. Derive time complexity of merge sort.
4 Marks
(c)
1)Evaluate the postfix expression in tabular forms: 2 5 3 - * 8 / 4 +
2)Evaluate the prefix expression in tabular forms: / 7 * 1 + 4 – 63 Marks
7 Marks

Question 2

14 MarksMedium
(a)
Explain Tower of Hanoi with suitable example.
3 Marks
(b)
Define hash function. Explain it with suitable example.
4 Marks
(c)
Write an algorithm for the following stack operations.
1)PUSH
2)POP
3)DISPLAY
7 Marks
OR OPTION
(c)
Write an algorithm for the following queue operations.
1)INSERT
2)DELETE
3)DISPLAY
7 Marks

Question 3

14 MarksMedium
(a)
Write an algorithm to add a node into a binary search tree.
3 Marks
(b)
Explain Dequeue and Priority queue in detail.
4 Marks
(c)

Construct the minimum spanning tree using prim’s algorithm for the following graph.

7 Marks
OR OPTION
(a)
Write an algorithm to delete an item from the doubly linked list.
3 Marks
(b)
Differentiate: BFS and DFS.
4 Marks
(c)

Construct the minimum spanning tree using krushkal’s algorithm for the following graph.

7 Marks

Question 4

14 MarksMedium
(a)
Define the terms below:
1)Threaded Tree
2)Acyclic graph
3)Sparse matrix
3 Marks
(b)
Explain AVL tree in detail with suitable example.
4 Marks
(c)
Construct a binary tree from the traversals given below:

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

7 Marks
OR OPTION
(a)
Define the terms below:
1)Complete Binary Tree
2)Forest
3)Abstract data type
3 Marks
(b)
Explain 2-3 tree in brief.
4 Marks
(c)
Write an algorithm to insert an item as below:
1)At the start of the linked list
2)At the end of the linked list
7 Marks

Question 5

14 MarksMedium
(a)
Define file. Explain its types.
3 Marks
(b)
Explain bubble sort with suitable example.
4 Marks
(c)

Build a chained hash table of 10 memory locations. Insert the keys 121, 3,4, 31, 61, 24, 7, 87, 8, 9 in hash table using chaining. Use h(k) = k mod m (m=10).

7 Marks
OR OPTION
(a)
Define file organization. Explain different file organizations.
3 Marks
(b)

Sort the following array elements using insertion sort algorithm. 8, -2, 5, 3, 9, 4,

4 Marks
(c)
Explain Dijakstra’s shortest path using suitable example.
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 2024, 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