Total No. of Questions 18] [Total No. of Pages 02
M.Sc. DEGREE EXAMINATION, MAY 2018
First Year
COMPUTER SCIENCE
Data Structures
Time 3 Hours Maximum Marks :70
SECTION A
Answer any three questions. × 15 45)
Q1) Write a sub-routine to implement PUSH and POP operations
using linked list.
Explain about open hashing and closed hashing.
Q2) How to create double linked list? Explain about various operations of
double linked list.
Q3) Discuss about tree traversing techniques with suitable example and also
how to represent binary trees.
Q4) Write a step by step procedure to create a heap from the following
sequence of nodes and sort them: 76, 22, 64, 46, 100, 68, 118, 91, 55, 76.
Q5) Construct Minimum Spanning Tree for the following graph using Prims's
algorithm
SECTION B
Answer any five questions. × 4 20)
Q6) Write about memory allocation for one and two dimensional arrays.
Q7) Briefly explain about priority queue.
Q8) What is expression tree? Draw the expression tree for a
Q9) Write a sub routine to delete operation in binary tree.
Q10) How to sort large objects.
Q11) Write about B tree indexing with example.
Q12) Represent the following graph by Adjacency Matrix, Adjacency list.
Q13) Explain about Hamiltonian circuit with suitable example.
SECTION C
Answer all questions. × 1
Q14)What is dequeuer?
Q15) Define recursion.
Q16) What is threaded binary tree?
Q17) What is bucket sort?
Q18) Define spanning tree.