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

B.Tech., III Semester
Examination, June 2024
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 2024)

Q.1

a) Describe Asymptotic notation in detail. (Unit 1)

b) What is Recursion? Explain in detail with example. (Unit 2)
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

a) How can you convert an infix expression to postfix expression using stack? Give one example. (Unit 2)

b) Write functions to implement recursive versions of preorder, inorder and postorder traversals of a binary tree. (Unit 3)
Q.5

a) Write a 'C' program, how to insert and delete elements in the Binary search tree? (Unit 3)

b) Discuss Kruskal's algorithm with an following graph. (Unit 4)

Undirected weighted graph with 9 vertices labeled 0 to 8. Vertex 0 is connected to 1 (weight 4) and 7 (weight 8). Vertex 1 is connected to 0 (4), 2 (8), and 7 (11). Vertex 2 is connected to 1 (8), 3 (7), 5 (4), and 8 (2). Vertex 3 is connected to 2 (7), 4 (9), and 5 (14). Vertex 4 is connected to 3 (9) and 5 (10). Vertex 5 is connected to 2 (4), 3 (14), 4 (10), and 6 (2). Vertex 6 is connected to 5 (2), 7 (1), and 8 (6). Vertex 7 is connected to 0 (8), 1 (11), 6 (1), and 8 (7). Vertex 8 is a central node connected to 2 (2), 6 (6), and 7 (7).
Q.6

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.7

a) Explain Multiway Merge sort with an example. (Unit 5)

b) What do you mean by sorting? Describe the need for sorting. (Unit 5)
Q.8

Write short notes on any two of the following:
i) Queue using linked list (Unit 2)
ii) Hashing (Unit 5)
iii) B+ tree (Unit 3)
iv) Post fix expression evaluation (Unit 2)