Gujarat Technological UniversityWinter 2025 examination

GTU BE03000081 Data Structures Winter 2025 Question Paper & PDF

B.E. · Common Engineering · Semester 3 · Subject code BE03000081
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.

Q.1

14 Marks
(a)
3 marks
What is the difference between linear and non-linear data structures?
(b)
4 marks
Differentiate between primitive and non-primitive data structures with examples.
(c)
7 marks

Explain storage representation methods for different data structures and discuss their impact on algorithm implementation and efficiency.

Q.2

14 Marks
(a)
3 marks
Explain the Tower of Hanoi with an example.
(b)
4 marks

Explain the memory representation of a one-dimensional and two-dimensional array with examples.

(c)
7 marks

Show the procedure of converting the following infix expression to postfix form using a Stack. (( A – (B + C)) × D) / (E + F)

(c)
7 marks

Define the circular queue and mention its advantages. Write an algorithm to implement the Insert & Delete operation into a Circular Queue.

Q.3

14 Marks
(a)
3 marks
What is a sparse matrix, and why is it represented differently than a standard matrix?
(b)
4 marks
Define a queue. List three real-time applications of queues with examples.
(c)
7 marks

Analyze the linked list data structure. Compare singly linked lists, doubly linked lists, and circular linked lists in terms of structure, traversal, and applications.

(a)
3 marks

Define the following terms: 1. Degree of vertex, 2. Height of a tree, 3. Balanced binary tree.

(b)
4 marks
Explain the depth-first search operation with an example.
(c)
7 marks

Define a threaded binary tree. What are the advantages and disadvantages of a threaded binary tree? Write down a few applications of a threaded binary tree.

Q.4

14 Marks
(a)
3 marks
Define graph, and list out three applications of graph.
(b)
4 marks
List the applications of trees.
(c)
7 marks

Given the following traversals, create a binary tree from them. Also, generate the postorder traversal for the same. preorder = {7,10,4,3,1,2,8,11}, inorder = {4,10,3,1,7,11,8,2}.

(a)
3 marks
Generate the inorder, preorder and postorder traversal for the following tree.
GTU Data Structures (BE03000081) Winter 2025 Question 4 OR (a) Diagram
(b)
4 marks
List out applications of hashing.
(c)
7 marks

What is a minimum spanning tree? Explain Kruskal’s algorithm for finding a minimum spanning tree with an example.

Q.5

14 Marks
(a)
3 marks
Define collision in hashing and mention two collision resolution techniques.
(b)
4 marks
Explain the Binary search method.
(c)
7 marks
Explain Sequential, Indexed and Relative/Random File Organization.
(a)
3 marks
Write an algorithm for Bubble sort.
(b)
4 marks
Explain the working of a hashing function with a suitable example.
(c)
7 marks
Sort the following numbers using
i)Selection sort,
ii)Quick sort: [10, 50, 0, 20, 30, 10]. Show the steps.

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 (Winter 2025, B.E. · Common 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