What is the exam pattern and passing mark for GTU Data Structures (3130702)?

The GTU theory examination carries 70 total marks with a duration of 2.5 Hours. Minimum passing criteria is 23 marks (33%). The paper consists of 5 main questions with official marking breakdown and internal choices.

Where can I download the official GTU 3130702 Summer 2023 question paper PDF?

The official GTU question paper PDF is linked directly from Gujarat Technological University's official examination archive. You can view the full paper online or download the original file.

How can I practice solutions for these GTU questions?

Every question on UnFoldPrep includes deep-linking and one-click AI prompt buttons for ChatGPT, Claude, and Perplexity that instantly formulate structured exam prompts with standard mark breakdowns and academic rubrics.

Gujarat Technological UniversitySummer 2023 examination

GTU 3130702 Data Structures (DS) Summer 2023 Question Paper & PDF

B.E. · Computer Engineering · Semester 3 · Subject code 3130702

Download official PDF View PDF here

Share with your class

Total: 70 marks
To pass: 23 marks (33%)
Duration: 2.5 Hours 2:30 PM – 5: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.

11 of 25 questions on this paper were also asked in other years. 1 more is a type 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

What is DS? Explain data structure and its types.

Also asked in Winter 2023 Q1a

(b)

4 marksAsked in 4 of 7 papers

Explain Tower of Hanoi with example.

Also asked in Summer 2026 Q3b, Summer 2025 Q3a OR, Summer 2024 Q2a

(c)

7 marksAsked in 4 of 7 papers

Write algorithms to insert, and delete elements in queue

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

Q.2

14 Marks

(a)

3 marksSame type asked in 2 of 7 papers

Construct Binary Tree where the preorder traversal is 1,2,4,5,3,6,8,9,7 & postorder is 4,5,2,8,9,6,7,3,1.

Also asked in Winter 2023 Q4b OR

(b)

4 marks

Construct an AVL Tree by inserting numbers from 1 to 8.

(c)

7 marksAsked in 4 of 7 papers

What is stack? Explain operations on stack in detail.

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

(c)

7 marks

Explain tree traversal in detail with example.

Q.3

14 Marks

(a)

3 marksAsked in 3 of 7 papers

Explain 2-3 Tree in brief.

Also asked in Summer 2026 Q3c OR, Summer 2024 Q4b OR

(b)

4 marks

Explain any three hashing techniques with example.

(c)

7 marksAsked in 3 of 7 papers

What is problem with simple queue? Explain its solution with example and algorithms.

Also asked in Summer 2025 Q3c, Winter 2024 Q2c

(a)

3 marks

Explain binary search technique.

(b)

4 marks

Explain fastest sorting technique with example.

(c)

7 marksAsked in 5 of 7 papers

What is collision? Explain collision resolution techniques with example.

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

Q.4

14 Marks

(a)

3 marks

List all asymptotic notations and explain any one of it.

(b)

4 marksAsked in 3 of 7 papers

List and explain linked list applications.

Also asked in Winter 2024 Q4a OR, Winter 2023 Q3a

(c)

7 marks

What is doubly linked list? Write Algorithm for insertion and deletion in doubly linked list.

(a)

3 marksAsked in 2 of 7 papers

What is file? Explain types of files.

Also asked in Summer 2024 Q5a

(b)

4 marks

Convert the following infix expressions to their prefix.

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

(c)

7 marksAsked in 2 of 7 papers

Explain Prim’s & Kruskal’s algorithm with suitable example

Also asked in Winter 2023 Q4c OR

Q.5

14 Marks

(a)

3 marks

Explain malloc and free functions in ‘C’.

(b)

4 marks

Define the following: 1. Sibling 2. Forest 3. Complete Binary Tree 4. Complete Graph

(c)

7 marks

Explain following:

i)Recursion

ii)Nonprimitive data structures

iii)Hashing

iv)Non- linear data structures

v)sparse matrix

vi)Priority queue

vii)Collision

(a)

3 marks

What is time complexity? Explain with example.

(b)

4 marks

Explain Binary Search with example.

(c)

7 marksAsked in 3 of 7 papers

Write and explain algorithm for insertion in Singly Linked List

Also asked in Winter 2024 Q4c OR, Summer 2024 Q4c 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

Winter 202570 marks · 5 questions

Summer 202570 marks · 5 questions · Solved

Winter 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) (Summer 2023, 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