Scribd
Upload
17 views2 pages

Gujarat Technological University

This document is an examination paper for the Data Structures subject at Gujarat Technological University for the BE Semester III Summer 2022 session. It includes instructions for the exam, a total of five questions covering various topics such as memory allocation, data structures, algorithms, and graph theory, with specific marks allocated to each part. The exam allows the use of simple scientific calculators and requires students to make suitable assumptions where necessary.

Uploaded by

prathamgujar82
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views2 pages

Gujarat Technological University

This document is an examination paper for the Data Structures subject at Gujarat Technological University for the BE Semester III Summer 2022 session. It includes instructions for the exam, a total of five questions covering various topics such as memory allocation, data structures, algorithms, and graph theory, with specific marks allocated to each part. The exam allows the use of simple scientific calculators and requires students to make suitable assumptions where necessary.

Uploaded by

prathamgujar82
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Seat No.: ________ Enrolment No.

___________

GUJARAT TECHNOLOGICAL UNIVERSITY


BE - SEMESTER– III (NEW) EXAMINATION – SUMMER 2022
Subject Code:3130702 Date:28-07-2022
Subject Name:Data Structures
Time:02:30 PM TO 05:00 PM Total Marks:70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Simple and non-programmable scientific calculators are allowed.

MARKS

Q.1 (a) Compare static memory allocation and dynamic memory allocation. 03
(b) Differentiate: 04
(i) primitive and non-primitive data structures
(ii) linear and non-linear data structures
(c) What is time and space complexity? Explain asymptotic notations in 07
detail.

Q.2 (a) Convert following infix to prefix and postfix expression: 03


(a + (b * c) / (d – e) )
(b) Write a ‘C’ program to reverse the string using stack. 04
(c) Enlist applications of stack. Write an algorithm to push and pop elements 07
with respect to stack.
OR
(c) Enlist applications of queue. Write an algorithm to insert and delete 07
elements with respect to simple queue.

Q.3 (a) What is priority queue? Explain with example. 03


(b) Write an algorithm to delete a node from doubly linked list. 04
(c) Write a ‘C’ program to implement a circular queue using array with all 07
necessary overflow and underflow checks.
OR
Q.3 (a) Briefly discuss malloc( ) memory allocation function. 03
(b) Write an algorithm to insert a node into doubly linked list. 04
(c) Write a ‘C’ program to implement singly linked list with (1) insert (2) 07
delete and (3) total_node_count functions.

Q.4 (a) Define complete binary tree and almost complete binary tree. 03
(b) What is a graph? Explain various representations of graphs. 04
(c) What is a binary search tree? Create a binary search tree for inserting the 07
following data.
50, 35, 100, 25, 41, 120, 105, 46, 90, 95
Explain delete operation for above tree.
OR
Q.4 (a) Discuss the properties of a B-Tree. 03
(b) Construct a binary tree from the traversals given below: 04
Inorder: 5, 8, 11, 12, 13, 16, 15, 19, 18, 21
Postorder: 5, 11, 12, 8, 16, 18, 21, 19, 15, 13

1
(c) What is a minimum spanning tree? Explain Kruskal’s algorithm for 07
finding a minimum spanning tree.

Q.5 (a) Define topological sort? 03


(b) Explain indexed sequential file structure. 04
(c) Describe various collision resolution techniques in hashing. 07
OR
Q.5 (a) Differentiate: BFS and DFS. 03
(b) Compare sequential searching with binary searching in detail. 04
(c) What is hashing? What are the qualities of a good hash function? Explain 07
any two hash functions in detail.

*************

You might also like