N A L A N D A O P E N U N I V E R S I T Y
Master of Computer Application Part-II
PAPER-XVI
(MCS-021: Data and File Structures)
Annual Examination, 2017
Time 3 Hours. Full Marks 80
Answer any Five Questions.
All questions carry equal marks.
1. Compare and contrast between linked list and queue. Write an algorithms for the insertion
and deletion operations on the circular queue.
2. Write a procedure to create, insert and display the content of a linked list and doubly linked
list.
3. Explain "Depth First Search" Algorithm with an example. How it is different from Breadth First
algorithm
4. What is the need for external sorting? Explain any one method to perform external sorting
with an example.
5. What is a stack Write a program in C to implement all the operations on a stack.
6. Compare and contrast between heap sort and quicksort. Write a procedure to sort the
following sequence using heap sort
20, 15, 30, 77, 10, 92, 12, 33, 45, 66.
7. What are Binary Search Trees? Create a binary search tree for following numbers starting
from empty BST
45, 26, 10, 60, 70, 30, 40, 12, 22, 11
8. Write Prim's algorithm for constructing Minimum Cost Spanning Tree and trace the algorithm
for the following graph.
9. Explain the following with an example
AVL trees.
The process of converting any Tree into a Binary Tree.
10. What are arrays Write a function to sort a matrix row wise. Also calculate the complexity at
this code using Big "O" notation.