How To Exam?

a knowledge trading engine...


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

Saturday, 18 May 2013 04:00Web


Mahatma Gandhi University M.Sc. 2nd semester computer science (Data and file structure) exam 2010. Download link is provided beneath as page 1.

G 7869    Reg. No,

Name.....................................

M.Sc. (COMPUTER SCIENCE) DEGREE EXAMINATION, JUNE 2010

Second Semester MCS 201DATA AND FILE STRUCTURES (2007 Admission onwards)

Time : Three Hours    Maximum : 75 Marks

Answer all questions.

1.    (a) Explain the implementation of two dimensional arrays.    (5 marks) (b) Write suitable routines to perform insert and delete operations in a queue. (5 marks)

Or

(5 marks) (5 marks)


2.    (a) Write a note on multiple stacks.

(b) List and explain the applications of stack.

3.    (a) Compare the implementation methods of doubly linked list and circular linked list.

(10 marks)

(b)    Explain linked list representation of stack.    (5 marks)

(c)    Compare linked list implementation and array implementation of queue.    (5 marks)

Or

(10 marks) (10 marks) (10 marks) (5 marks)

of them in detail (8 marks)

(7 marks)

(12 marks)

(8 marks)

(10 marks)


4.    (a) Describe the doubly linked list representation of free memory pool.

(b) Explain different memory allocation strategies.

5.    (a) Describe compaction technique.

(b) Give the iterative algorithm for the inorder traversal of binary tree.

Or

6.    (a) What are the basic operations performed on a binary tree ? Explain each

with suitable examples.

(b) Explain AVL trees with representation.

7.    (a) Obtain a procedure to delete a node from a B-tree and explain.

(b) Write algorithm for binary search. Explain with suitable example.

Or

8.    (a) Explain quick sort algorithm with suitable example.

(b) Sort the elements 3,1,4,1,5,9,2,6 in decreasing order using heap sort routine. (10 marks)

(a)    Distinguish between sequential and indexed sequential file organizations.    (5 marks)

9.


(b)    Discuss the advantages of random file organization.    (5 marks)

Or

(a)    Write a note on hashing function.    (5 marks)

(b)    Describe the structure of hash table.    (5 marks)

10.







Attachment:

( 0 Votes )

Add comment


Security code
Refresh

Earning:   Approval pending.
You are here: PAPER Mahatma Gandhi University (MGU) 2010-2nd Sem M.Sc Computer Science (Data and file structure) - Question Paper