Gujarat Technological UniversityWinter 2025 examination

GTU 3130702 Data Structures (DS) Winter 2025 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.

7 of 25 questions on this paper were also asked in other years. 4 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 marks
What is data structure? Differentiate between data types and data structures
(b)
4 marks
Define static, dynamic, linear and non-linear data structures.
(c)
7 marks

Explain the concept of recursion and write a recursive C program to calculate factorial of a number.

Q.2

14 Marks
(a)
3 marksAsked in 2 of 7 papers
Compare and contrast queue, priority queue and dequeue.

Also asked in Summer 2024 Q3b

(b)
4 marksSame type asked in 2 of 7 papers
Evaluate the following expression using stack, show each step.

10 2 + 8 4 / * 6 3 -/

Also asked in Winter 2024 Q2c OR

(c)
7 marksAsked in 3 of 7 papers
Write an algorithm to convert an infix expression to postfix.

Also asked in Summer 2026 Q2c, Summer 2025 Q2c OR

(c)
7 marksAsked in 4 of 7 papers
Write a C functions for insertion and deletion operation in simple queue.

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

Q.3

14 Marks
(a)
3 marksAsked in 3 of 7 papers
Differentiate Array and Linked lists

Also asked in Summer 2026 Q2a, Winter 2023 Q2a

(b)
4 marksSame type asked in 4 of 7 papers

Convert the following expression to postfix using stack. Show each step clearly ((A-B)+D/((E+F)*G))

Also asked in Summer 2025 Q2c, Winter 2024 Q2b, Winter 2023 Q1c

(c)
7 marks
Write an algorithm to insert an element in an ordered link list
(a)
3 marks
Define :
1Directed Graph
2Acyclic and cyclic graph
3Weighted and unweighted graph
(b)
4 marksAsked in 4 of 7 papers
Compare and Contrast DFS and BFS

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

(c)
7 marksSame type asked in 2 of 7 papers
What is minimum cost spanning tree? Discuss Prim’s algorithm with an example

Also asked in Summer 2024 Q3c

Q.4

14 Marks
(a)
3 marks

Explain the properties of binary tree and differentiate between complete binary tree, full binary tree and balanced binary tree

(b)
4 marks

Insert the following nodes into an empty BST in this order: 50, 30, 70, 20, 40, 60,

80Draw the resulting BST after each insertion
(c)
7 marks

What is a binary search tree? write an algorithm to search an element in BST and show it’s time complexity

(a)
3 marks
Define following with respect to Tree: i) M-ary tree ii) Out Degree iii) Leaf
(b)
4 marks

If the depth of the binary tree is k, the maximum number of nodes in the binary tree is 2k -1. Justify. Also mention atleast how many nodes a tree should have given it’s depth as k.

(c)
7 marks
For a given tree show the Inorder, Preorder and Postorder traversals
GTU Data Structures (3130702) Winter 2025 Question 4 OR (c) Diagram

Q.5

14 Marks
(a)
3 marksSame type asked in 4 of 7 papers
Sort following elements using quick sort. 22 15 26 06 40 31, 92, 45, 78

Also asked in Summer 2025 Q4b OR, Winter 2024 Q3b OR, Winter 2023 Q5c OR

(b)
4 marks

Compare the below different hashing methods and discuss about each method in a detailed Manner.

iStatic Hashing. Ii. Dynamic Hashing
(c)
7 marks

Insert the following keys into a hash table of size 10 using linear probing: 12, 26, 31, 92, 45, 78 Show the steps and the final hash table

(a)
3 marksAsked in 4 of 7 papers
Explain AVL tree with suitable example.

Also asked in Summer 2026 Q3c, Summer 2024 Q4b, Winter 2023 Q4a OR

(b)
4 marks
Construct the 2-3 tree for the following sequence 10, 20, 30, 40, 50, 60, 70, 80, 90.
(c)
7 marksAsked in 2 of 7 papers
Write an algorithm to sort an array using selection sort method.

Also asked in Summer 2025 Q5b OR

More Data Structures papers

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

Summer 202670 marks · 5 questions
Summer 202570 marks · 5 questions · Solved
Winter 202470 marks · 5 questions
Summer 202470 marks · 5 questions

Other Semester 3 subjects

BE Computer

130001
Mathematics-III
3130004
Effective Technical Communication
3130006
Probability and Statistics
3130703
DATABASE MANAGEMENT SYSTEM

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 2025, 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 official PDF All Data Structures Papers (7) →Report a typo or correction
ViewDownload PDF