Mahatma Gandhi University (MGU) 2011-2nd Sem M.Sc Computer Science (Data and file structure) - Question Paper

1.

(a)

Answer all questions. Explain various types of data structures.

(5 marks)

(b)

Write suitable procedures to perform insertion and deletion operations in stack.

Or

How to represent a 2-dimmenssional array in memory ?

(5 marks)

2.

(a)

(5 marks)

(b)

Discuss the array implementation of Priority queues. Also write its applications.

(5 marks)

3.

(a)

Explain different types of linked lists with neat diagram.

(10 marks)

(b)

Explain linked list representation of queue.

(5 marks)

(c)

Give an algorithm to delete an element from a doubly linked list.

Or

Explain the implementation of free memory pool.

(5 marks)

4.

(a)

(6 marks)

(b)

Describe the boundary tag memory management system.

(10 marks)

(c)

Write a note on garbage collection.

(4 marks)

5.

(a)

Discuss the various representation of binary tree with suitable example.

(8 marks)

(b)

What are the various tree traversal methods ? Explain.

Or

Discuss any two applications of binary tree.

(7 marks)

6.

(a)

(8 marks)

(b)

Compare threaded binary tree and binary search tree.

(7 marks)

7.

(a)

Obtain a procedure to insert a node to a B-tree and explain.

(12 marks)

(b)

Write a procedure for linear search. Explain with suitable example.

Or

Explain merge sort algorithm with suitable example.

(8 marks)

8.

(a)

(10 marks)

9.

(b)

(a)

Simulate the following numbers using shell sort method : 81, 94, 11, 96, 12, 35, 17, 95, 28, 58, 41, 75, 15.

Explain the linked organization of files.

(10 marks) (5 marks)

(b)

Discuss the advantages of random file organization.

Or

Explain the collision handling techniques in hashing.

(5 marks)

10.

(a)

(5 marks)

(b)

Briefly explain static hashing.

(5 marks)