Question 1
(a)
What is DS? Explain data structure and its types.
3 Marks
(b)
Explain Tower of Hanoi with example.
4 Marks
(c)
Write algorithms to insert, and delete elements in queue
7 Marks
Gujarat Technological UniversitySummer 2023 Examination
GTU 3130702 Data Structures (DS) Summer 2023 Paper Solution & PDF
B.E. · Computer Engineering · Semester 3 · Subject Code: 3130702
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
Question 2
(a)
Construct Binary Tree where the preorder traversal is 1,2,4,5,3,6,8,9,7 & postorder is 4,5,2,8,9,6,7,3,1.
3 Marks
(b)
Construct an AVL Tree by inserting numbers from 1 to 8.
4 Marks
(c)
What is stack? Explain operations on stack in detail.
7 Marks
OR OPTION
(c)
Explain tree traversal in detail with example.
7 Marks
Question 3
(a)
Explain 2-3 Tree in brief.
3 Marks
(b)
Explain any three hashing techniques with example.
4 Marks
(c)
What is problem with simple queue? Explain its solution with example and algorithms.
7 Marks
OR OPTION
(a)
Explain binary search technique.
3 Marks
(b)
Explain fastest sorting technique with example.
4 Marks
(c)
What is collision? Explain collision resolution techniques with example.
7 Marks
Question 4
(a)
List all asymptotic notations and explain any one of it.
3 Marks
(b)
List and explain linked list applications.
4 Marks
(c)
What is doubly linked list? Write Algorithm for insertion and deletion in doubly linked list.
7 Marks
OR OPTION
(a)
What is file? Explain types of files.
3 Marks
(b)
Convert the following infix expressions to their prefix.
(A^B*C-D+E/F/(G+H))
4 Marks
(c)
Explain Prim’s & Kruskal’s algorithm with suitable example
7 Marks
Question 5
(a)
Explain malloc and free functions in ‘C’.
3 Marks
(b)
Define the following: 1. Sibling 2. Forest 3. Complete Binary Tree 4. Complete Graph
4 Marks
(c)
Explain following:
i)Recursion
ii)Nonprimitive data structures
iii)Hashing
iv)Non- linear data structures
v)sparse matrix
vi)Priority queue
vii)Collision
7 Marks
OR OPTION
(a)
What is time complexity? Explain with example.
3 Marks
(b)
Explain Binary Search with example.
4 Marks
(c)
Write and explain algorithm for insertion in Singly Linked List
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.
About this Examination Paper & Attribution
Official Gujarat Technological University (GTU) examination paper and step-by-step solutions for Data Structures (DS) (Summer 2023, 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.