GTU · BE Computer · Semester 3
GTU 3130702 Data Structures (DS) Old Question Papers & Solutions PDF
Official Gujarat Technological University (GTU) old question papers PDF (Regular & Remedial) and step-by-step solved questions for Data Structures (DS) across 2023 – 2026 examinations.
37 questions GTU asked more than onceAsked in 5 of 7 papers: Describe any two collision resolution techniques.See listExam papers
Most repeated questions
37 questions GTU set in two or more of 7 papers, most repeated first. Tap a year to open that paper at the question.
Describe any two collision resolution techniques.
Summer 2026 Q5c OR Summer 2025 Q5c Winter 2024 Q3c OR Winter 2023 Q5c Summer 2023 Q3c OR
Write a short note on AVL tree.
Summer 2026 Q3c Winter 2025 Q5a OR Summer 2024 Q4b Winter 2023 Q4a OR
Write a C functions for insertion and deletion operation in simple queue.
Winter 2025 Q2c OR Summer 2024 Q2c OR Winter 2023 Q2c OR Summer 2023 Q1c
Convert the following expression to postfix using stack. Show each step clearly ((A-B)+D/((E+F)*G))
Winter 2025 Q3b Summer 2025 Q2c Winter 2024 Q2b Winter 2023 Q1c
Explain the tower of Hanoi problem.
Summer 2026 Q3b Summer 2025 Q3a OR Summer 2024 Q2a Summer 2023 Q1b
Write a C program for a bubble sort.
Summer 2025 Q5b Winter 2024 Q3a Summer 2024 Q5b Winter 2023 Q5b
Derive basic operation of stack and write C function to implement it.
Winter 2024 Q1b Summer 2024 Q2c Winter 2023 Q2c Summer 2023 Q2c
Compare and Contrast DFS and BFS
Winter 2025 Q3b OR Winter 2024 Q3c Summer 2024 Q3b OR Winter 2023 Q4c
Sort following elements using quick sort. 22 15 26 06 40 31, 92, 45, 78
Winter 2025 Q5a Summer 2025 Q4b OR Winter 2024 Q3b OR Winter 2023 Q5c OR
Write a short note on 2-3 tree.
Show 27 more repeated questionsHide the 27 more
Write an algorithm to convert infix expression into postfix expression using stack.
Write a C program for the following operations on a circular queue. 1. Insert 2. Delete 3. Display
List various file organizations and explain one in detail.
Write an algorithm to implement singly linked list and its operation such as insert element at front, last and at any position.
Construct tree from Following In order Traversal: D, B, E, A, F, C Pre order Traversal: A, B, D, E, C, F
How does a linked list differ from an array in terms of structure and memory allocation?
List any three uses of linked list.
Explain prim’s and krushkal’s algorithm with suitable example.
What is minimum cost spanning tree? Discuss Prim’s algorithm with an example
Find the minimum spanning tree of the following graph using Kruskal’s algorithm.
Discuss Dijkstra's algorithm for finding the shortest path.
Write an algorithm to sort an array using selection sort method.
Define hash function. Explain it with suitable example.
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,
Sort 20,35,40,100,3,10,15 using insertion sort. Show all passes.
Apply merge sort on the following array. A=[38, 27, 43, 10]
Evaluate the following expression using stack, show each step. 10 2 + 8 4 / * 6 3 -/
Explain row-major order and column-major order representation of 2-D array.ss
Define data structure. Enlist and explain types of data structure.
Define data structure. What are the applications of data structures?
Differentiate Primitive and Non Primitive Data Structures
Describe the characteristics of a good hash function.
Define file. Explain its types.
Write an algorithm to delete an item from the doubly linked list.
Compare linear search and binary search in terms of their time complexity.
Compare and contrast queue, priority queue and dequeue.
How new node can be inserted into a binary search tree?
Which branches take this subject
GTU's syllabus lists 3130702 for 5 branches. One set of papers serves all of them.
Semester 3: 5 branches
Computer Engineering, Computer Science & Engineering, Computer Science & Engineering (Data Science), Information & Communication Technology, Information Technology
Other Semester 3 subjects
Common questions
Are these GTU 3130702 Data Structures papers valid for both Regular and Remedial exams?
Yes. Gujarat Technological University (GTU) follows the same 70-mark syllabus, exam blueprint, and 23-mark passing cutoff for both Regular and Remedial (ATKT/backlog) examinations. All 7 past exam sessions (2023 – 2026) serve as comprehensive preparation for either attempt.
How can I download GTU 3130702 Data Structures old question papers PDF?
You can download official GTU 3130702 original question paper PDFs directly from the table above with 1 click and zero deceptive ads or wait timers. Every paper also includes interactive online questions with AI study prompts.
What is the passing mark for GTU Data Structures (3130702)?
The external theory exam carries 70 marks. The minimum passing cutoff is 23 marks (33%). Exam duration is 2.5 hours.
What is the GTU exam pattern for 3130702?
The examination contains 5 main questions of 14 marks each, totaling 70 marks. Questions 2 through 5 provide internal OR choices, typically split into 3-mark, 4-mark, and 7-mark questions.