Scribd
Upload
167 views3 pages

Mcs-021 December 20

The document is a 3 page exam for a Data and File Structures course. It contains 8 questions testing topics like binary trees, heap sort, AVL trees, graph algorithms, queues, linked lists, and sorting algorithms.

Uploaded by

Ashik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
167 views3 pages

Mcs-021 December 20

The document is a 3 page exam for a Data and File Structures course. It contains 8 questions testing topics like binary trees, heap sort, AVL trees, graph algorithms, queues, linked lists, and sorting algorithms.

Uploaded by

Ashik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

No.

of Printed Pages : 3 I MCS-021 I

MCA (Revised) / BCA (Revised)


Term-End Examination
3_ June, 2017

MCS-021 : DATA AND FILE STRUCTURES

Time : 3 hours Maximum Marks : 100


(Weightage 75%)

Note : Question number 1 is compulsory. Attempt any


three questions from the rest. All algorithms
should be written nearer to 'C' language.

1. (a) Prove by induction that


(i) the number of leaves in a Binary Tree
of height 'If are less than or equal
to 2h.
(ii) the number of nodes in a full
Binary Tree of height 'h' is equal to
(2h + 1 1 ) . 5

(b) Write an algorithm for Heap Sort. Write


the step-by-step working of the algorithm
for the following set of data : 10

5, 25, 13, 36, 78, 95, 3, 6

MCS-021 1 P.T.O.
(c) Explain the types of rotations performed on
AVL trees with an example of each. 10

(d) Write the algorithm for each of the


following :
(i) Depth First Search
(ii) Breadth First Search 5

2. (a) Write Prim's algorithm and construct a


minimum cost spanning tree on the
following network using Prim's algorithm : 10

(b) Write an algorithm for the addition of two


Sparse Matrices. 10

3. (a) Write an algorithm for array implementation


of a Circular Queue. 10

(b) Create a Binary Search Tree for the


following alphabets. Start from an empty
BST. 10
5, U, B, D, K, V, A, L

MCS-021 2
. (a) Write a non-recursive algorithm for
inorder traversal of a Binary Tree. 10

(b) Explain the process of converting a Tree to


a Binary Tree. 10

. (a) Write an algorithm for the implementation


of a Singly Linked List. 10

(b) Name the sorting algorithm which accepts


an input string that is already sorted yet
performs at its worst case to give a sorted
output. Explain your answer. 10

MCS-021 3 7,500

You might also like