Total No. of Questions 18] [Total No. of Pages 2
M.Sc. DEGREE EXAMINATION, MAY 2017
COMPUTER SCIENCE
First Year
DATA STRUCTURES
Time 3 Hours Maximum Marks 70
SECTION A × 15 45)
Answer any three questions.
Q1) Write the following subroutines of double linked list
Insert a new node at the end
Delete the first node
Insert a node after a specific node
Q2) Describe various queue operations. How to implement queues using single linked lists.
Q3) Explain about linear and linked representation of binary tree with suitable example.
Q4) Consider the following list elements 67, 12, 89, 26, 38, 45, 22, 79, 53, 61 Sort these
elements using heap sort.
Q5) What is minimum spanning tree? Construct Minimum Spanning Tree for the following
graph using Prims's algorithm.
SECTION B × 4 20)
Answer any Five questions
Q6) Describe the applications of queues.
Q7) Convert the following infix expression into prefix and post fix notation.
B G
Q8) Construct binary search tree for the following
F,Q
Q9) Write short notes on B trees.
Q10) What is meant by expression tree? Give suitable example.
Q11) Describe various ways to representing graphs into computer memory.
Q12) Explain about Hamiltonian circuit with example.
Q13) Briefly explain about bucket sorting with example.
SECTION C × 1
Answer all questions
Q14) What is sparse matrix?
Q15) What is De queue?
Q16) What is heap tree?
Q17) Define graph.
Q18) Define in order and post order of tree traversing.