Gujarat Technological UniversityWinter 2024 examination

GTU 3130702 Data Structures (DS) Winter 2024 Question Paper & PDF

B.E. · Computer Engineering · Semester 3 · Subject code 3130702
Download official PDFView PDF here
Share with your class
Total
70 marks
To pass
23 marks (33%)
Duration
2.5 Hours 10:30 AM – 1:00 PM
Questions
5 with internal choice
No solutions on this paper yetNeed them for your exam? Ask once. Papers that students ask for are solved first, and we aim to add them within 24 hours.

9 of 25 questions on this paper were also asked in other years. 5 more are types of question GTU sets again with new data. Each is marked below with the years it appeared.See all 37 repeated 3130702 questions, most asked first

Q.1

14 Marks
(a)
3 marksAsked in 2 of 7 papers
Differentiate Primitive and Non Primitive Data Structures

Also asked in Winter 2023 Q2b

(b)
4 marksAsked in 4 of 7 papers
Derive basic operation of stack and write C function to implement it.

Also asked in Summer 2024 Q2c, Winter 2023 Q2c, Summer 2023 Q2c

(c)
7 marksAsked in 2 of 7 papers
Explain Row Major and Column Major with Example.

Also asked in Summer 2025 Q1b

Q.2

14 Marks
(a)
3 marks
What is Sparse Matrix?
(b)
4 marksSame type asked in 4 of 7 papers
Translate infix expression into its equivalent post fix expression:

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

Also asked in Winter 2025 Q3b, Summer 2025 Q2c, Winter 2023 Q1c

(c)
7 marksAsked in 3 of 7 papers

Write a program to implement Circular queue and show how it differ from normal queue?

Also asked in Summer 2025 Q3c, Summer 2023 Q3c

(c)
7 marksSame type asked in 2 of 7 papers

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 -

Also asked in Winter 2025 Q2b

Q.3

14 Marks
(a)
3 marksAsked in 4 of 7 papers
Write an algorithm for Bubble sort.

Also asked in Summer 2025 Q5b, Summer 2024 Q5b, Winter 2023 Q5b

(b)
4 marksSame type asked in 2 of 7 papers
Sort 20,35,40,100,3,10,15 using insertion sort. Show all passes.

Also asked in Summer 2024 Q5b OR

(c)
7 marksAsked in 4 of 7 papers

Compare and contrast Depth First Search (DFS) and Breadth First Search (BFS) in terms of their algorithms, uses, and performance.

Also asked in Winter 2025 Q3b OR, Summer 2024 Q3b OR, Winter 2023 Q4c

(a)
3 marks
Write an algorithm for Merge Sort.
(b)
4 marksSame type asked in 4 of 7 papers

Sort the given values using Quick Sort? 65, 70, 75, 80, 85, 60, 55, 50, 45. Show all passes.

Also asked in Winter 2025 Q5a, Summer 2025 Q4b OR, Winter 2023 Q5c OR

(c)
7 marksAsked in 5 of 7 papers

Describe the concept of hashing and explain different collision resolution techniques, including separate chaining and open addressing. Illustrate how each technique works with examples.

Also asked in Summer 2026 Q5c OR, Summer 2025 Q5c, Winter 2023 Q5c, Summer 2023 Q3c OR

Q.4

14 Marks
(a)
3 marks
Define Graph and list any 3 uses of graph.
(b)
4 marks
How to prove array is sequential and contiguous?
(c)
7 marks

Explain the concept of a graph and its representations. Compare adjacency matrix and adjacency list representations in terms of space complexity and use cases.

(a)
3 marksAsked in 3 of 7 papers
List any three uses of linked list.

Also asked in Winter 2023 Q3a, Summer 2023 Q4b

(b)
4 marks

Write an algorithm to delete next element from doubly linked list from given position,

(c)
7 marksAsked in 3 of 7 papers

Write an algorithm to implement singly linked list and its operation such as insert element at front, last and at any position.

Also asked in Summer 2024 Q4c OR, Summer 2023 Q5c OR

Q.5

14 Marks
(a)
3 marks
What is priority queue?
(b)
4 marks
Write an algorithm to implement queue using Linked List.
(c)
7 marks
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.

(a)
3 marks
Define
1)Forest
2)Leaf Node
3)Tree
(b)
4 marksSame type asked in 3 of 7 papers

Construct tree from Following  In order Traversal: D, B, E, A, F, C  Pre order Traversal: A, B, D, E, C, F

Also asked in Summer 2024 Q4c, Winter 2023 Q4b

(c)
7 marks

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.

More Data Structures papers

Questions repeat across sessions. Working through two or three papers shows you which topics GTU asks most.

Preparing with friends?

Send this paper to your class group. Every question has its own link.

About this paper

Official Gujarat Technological University (GTU) examination paper 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.

ViewDownload PDF