Cochin University of Science and Techology (CUST) 2010-1st Sem M.C.A Computer Aplications CAS 2103 Data structures using c - Question Paper

CUSAT MCA first semester exam november 2010
CAS 2103 Data structures using c

MCA. 1/10.64

MCA DEGREE I SEMESTER EXAMINATION NOVEMBER 2010 CAS 2103 DATA STRUCTURES USING C

Time: 3 Hours

PART A

(Answer ALL questions)

(All questions carry EQUAL marks)

(15x2 = 30)

I.    (a) What Ts a stack? Explain PUSH and POP operations.

(b)    What is a circular queue?

(c)    Compare array with lists

II.    (a) What is a red blade tree?

(b)    Define binary search tree.

(c)    Explain tree traversals.

HI. (a) What is a binomial heap?

(b)    What is a Fibonacci heap?

(c)    Explain mid square hashing.

IV.    . (a) What is recursion? Explain with examples.

(b)    How can you remove recursion?

(c)    Explain backtracking.

V.    (a) Compare quick sort with merge sort in terms of complexity.

(b)    What is count sort?

(c)    What is heap sort complexity?

PART B

(All questions carry EQUAL males)

VI A    Implement a deque in C

OR

B.    Implement the insertion and deletion in linked list.

VII. A.    Implement binary search tree and its traversals.

OR

B.    Explain AVL tree with all its rotations

VIE A.    Explain has functions.

OR

B.    Explain an application of binomial heap.

IX.    A.    Implement a non recursive pre order traversal.

OR

recursion.

X.    A.    Implement Merge sort with example

OR

B.    Explain radix sort with an example.

Attachment: cochin-university-of-science-and-techology--cust--2010-m-c-a-computer-aplications-37422-1.pdf

Earning:   Approval pending.