UnFoldPrep
Browse Archive
Gujarat Technological UniversityWinter 2023 Examination

GTU 3130702 Data Structures (DS) Winter 2023 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)
Define data structure. Enlist and explain types of data structure.
3 Marks
(b)
Differentiate static and dynamic memory allocation.
4 Marks
(c)
Convert the following infix expression into postfix expression using stack.

(A-B)/C*D^(E/F)^(G+H)

7 Marks

Question 2

14 MarksMedium
(a)
Compare array and linked list.
3 Marks
(b)
Differentiate primitive and non-primitive data structures.
4 Marks
(c)
Define stack. Write algorithms for PUSH, POP and PEEP operations of stack.
7 Marks
OR OPTION
(c)

Define queue. Write algorithms for INSERT, DELETE and DISPLAY operations of queue.

7 Marks

Question 3

14 MarksMedium
(a)
Enlist and explain any 3 applications of linked list.
3 Marks
(b)
Design an algorithm to insert an element in doubly linked list.
4 Marks
(c)
Do as directed:
i)Evaluate the postfix expression in tabular forms: 8 2 / 6 7 * +
ii)Explain Tower Of Hanoi with example.
7 Marks
OR OPTION
(a)
Enlist and explain any 3 applications of stack in computer science.
3 Marks
(b)
Design an algorithm to delete an element in doubly linked list.
4 Marks
(c)
Do as directed:
i)Evaluate the prefix expression in tabular forms: * / - 8 24 Marks
ii)Explain Sparse matrix with example.3 Marks
4 Marks

Question 4

14 MarksMedium
(a)
Explain binary search tree with suitable example.
3 Marks
(b)
Construct a binary tree from the traversals given below:

In-order : D, B, A, E, G, C, H, F, I Pre-order : A, B, D, C, E, G, F, H, I

4 Marks
(c)
Differentiate DFS and BFS in detail.
7 Marks
OR OPTION
(a)
Explain AVL tree with suitable example.
3 Marks
(b)
Construct a binary tree from the traversals given below:

Pre-order : 1, 2, 4, 8, 9, 5, 3, 6, 7 Post-order : 8, 9, 4, 5, 2, 6, 7, 3,

4 Marks
(c)
Explain prim’s and krushkal’s algorithm with suitable example.
7 Marks

Question 5

14 MarksMedium
(a)
State the reason why hash function is used. Give one example of hash function.
3 Marks
(b)
Write a C program for bubble sort.
4 Marks
(c)
Enlist and explain collision resolution techniques in hashing.
7 Marks
OR OPTION
(a)
Differentiate sequential search and binary search.
3 Marks
(b)
Define file organization. Briefly summarize different file organizations.
4 Marks
(c)
Do as directed below:
i)Sort following elements using quick sort. 10 15 28 09 40 35 29 127 Marks
ii)State time and space complexity of quick sort.5 Marks
2 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) (Winter 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.

Download PDF