B.Tech. Degree Examination
(Model Question Paper)
Third Semester
Branch: Common to all Branches
Course: Data Structures and Algorithms
Time: 3 hours
Max. Marks: 70
Note: Answer all questions.
Question 1
a) Explain different types of data structures. (7 marks)
b) What are the applications of data structures? Explain with example. (7 marks)
Question 2
a) Explain the algorithm for evaluating postfix expression with example. (7 marks)
b) Write a C program to implement queue using arrays. (7 marks)
--- Content provided by FirstRanker.com ---
Question 3
a) What is a Binary Search Tree? Write a C program to implement Binary Search Tree. (7 marks)
b) Explain different tree traversal techniques with example. (7 marks)
Question 4
a) Explain different types of graph representations. (7 marks)
b) Explain BFS graph traversal technique with example. (7 marks)
Question 5
a) Sort the following elements using Merge sort: 23, 45, 12, 67, 89, 34, 56, 90. (7 marks)
--- Content provided by FirstRanker.com ---
b) Explain Quick sort algorithm with example. (7 marks)