CS/CT/CO-303 (GS) – Data Structures

B.Tech., III Semester
Examination, June 2023
Grading System (GS)
Max Marks: 70 | Time: 3 Hours

Note:
i) Attempt any five questions.
ii) All questions carry equal marks.

Previous Year Questions (June 2023)

Q.1

a) What are the different abstract data types? Explain. (Unit 1)

b) What is a linked list? Explain its operations with examples. (Unit 1)
Q.2

a) Differentiate between the stack and queue. (Unit 2)

b) Write a 'C' program to convert the infix expression to postfix expression. (Unit 2)
Q.3

a) Write an algorithm for insert and delete operations in circular linked list. (Unit 1)

b) How a binary search tree is traversed? Explain with a suitable example. (Unit 3)
Q.4

Insert the following list of elements from the avl tree. Delete the elements 18, 2, 30 from the 12, 30, 36, 18, 25, 9, 4, 2, 17, 14, 20 and 47. (Unit 3)
Q.5

a) What is heap data structure? Explain its operations with a suitable example. (Unit 3)

b) Sort the following list of elements 30, 56, 78, 99, 12, 43, 10, 24, 85 by using merge sort. (Unit 5)
Q.6

a) Compare and contrast bfs and dfs. (Unit 4)

b) Discuss kruskals algorithm with an following graph. (Unit 4)

Undirected weighted graph with 5 vertices labeled 0, 1, 2, 3, 4. Vertex 4 is at the top. Vertices 0, 1, 2, 3 are arranged in an arc below. Edges and weights are: (4-0) weight 4, (4-1) weight 6, (4-2) weight 5, (4-3) weight 7. Edges along the bottom arc are: (0-1) weight 8, (1-2) weight 3, (2-3) weight 9.
Q.7

a) Explain shell sort algorithm and simulate it for the following data 35, 33, 42, 10, 14, 19, 27, 44. (Unit 5)

b) Explain sequential search and simulate it for the following data 4, 21, 36, 14, 62, 91, 8, 22, 81, 77, 10. (Unit 5)
Q.8

Write short notes on any two of the following:
i) Stack using linked list (Unit 2)
ii) Indexing (Unit 5)
iii) B tree (Unit 3)
iv) Priority queue (Unit 2)