Question 1
(a)
Differentiate Primitive and Non Primitive Data Structures
3 Marks
(b)
Derive basic operation of stack and write C function to implement it.
4 Marks
(c)
Explain Row Major and Column Major with Example.
7 Marks
Gujarat Technological UniversityWinter 2024 Examination
GTU 3130702 Data Structures (DS) Winter 2024 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 Hours10:30 AM – 1:00 PM
Paper Structure5 QuestionsWith internal OR choices
Question 2
(a)
What is Sparse Matrix?
3 Marks
(b)
Translate infix expression into its equivalent post fix expression:
A*(B+D)/E-F*(G+H/K)
4 Marks
(c)
Write a program to implement Circular queue and show how it differ from normal queue?
7 Marks
OR OPTION
(c)
Explain the concept of Reverse Polish Notation (RPN) and describe the process for evaluating an RPN expression using a stack. Provide a detailed example of evaluating the following RPN expression: 5 1 2 + 4
- + 3 -
7 Marks
Question 3
(a)
Write an algorithm for Bubble sort.
3 Marks
(b)
Sort 20,35,40,100,3,10,15 using insertion sort. Show all passes.
4 Marks
(c)
Compare and contrast Depth First Search (DFS) and Breadth First Search (BFS) in terms of their algorithms, uses, and performance.
7 Marks
OR OPTION
(a)
Write an algorithm for Merge Sort.
3 Marks
(b)
Sort the given values using Quick Sort? 65, 70, 75, 80, 85, 60, 55, 50, 45. Show all passes.
4 Marks
(c)
Describe the concept of hashing and explain different collision resolution techniques, including separate chaining and open addressing. Illustrate how each technique works with examples.
7 Marks
Question 4
(a)
Define Graph and list any 3 uses of graph.
3 Marks
(b)
How to prove array is sequential and contiguous?
4 Marks
(c)
Explain the concept of a graph and its representations. Compare adjacency matrix and adjacency list representations in terms of space complexity and use cases.
7 Marks
OR OPTION
(a)
List any three uses of linked list.
3 Marks
(b)
Write an algorithm to delete next element from doubly linked list from given position,
4 Marks
(c)
Write an algorithm to implement singly linked list and its operation such as insert element at front, last and at any position.
7 Marks
Question 5
(a)
What is priority queue?
3 Marks
(b)
Write an algorithm to implement queue using Linked List.
4 Marks
(c)
Explain the concept of a binary search tree (BST) and its properties.
Discuss how operations such as insertion, deletion, and searching are performed in a BST.
7 Marks
OR OPTION
(a)
Define
1)Forest
2)Leaf Node
3)Tree
3 Marks
(b)
Construct tree from Following In order Traversal: D, B, E, A, F, C Pre order Traversal: A, B, D, E, C, F
4 Marks
(c)
Discuss the key concepts and techniques of AVL trees and 2-3 trees, focusing on their balance mechanisms and the impact on performance. Provide examples of insertions and deletions to illustrate how these trees maintain balance.
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) (Winter 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.