Calicut University 2006 M.C.A , - 2K 204 - DATA STRUCTURES AND ALGORITHMS (New Scheme) - Question Paper
Second Semester M.C.A Degree Examination, August 2006
MCA 2K 204 - DATA STRUCTURES AND ALGORITHMS
(New Scheme)
Name
Reg. No.
SECOND SEMESTER WLCA DEGREE EXAMINATION, AUGUST 2006 MCA 2K 204DATA STRUCTURES AND ALGORITHMS (New Scheme)
Maximum: 100 Marks
Time: Three Hours
Answer any five full questions. AH questions carry equal marks.
1. (a) Solve the recurrence relation
T<-1) + C*T0*-1); if/>l 
C ; ifn=l.
(b) Explain the raKhodt used to determine time and space complexity of algorithms.
2. (a) A double ended queue is a linear list where additions and deletions can be performed at
either end. Represent the data structure using an array. Write functions for .additions and deletion* of elements.
(b) Write a function to copy one stack to another assuming the stack is implemented using linked
list.
3. (a) BarpUi* nf irulrit a-nd djaapwy Kat_ flw wimflw
(b) Define representation of a binary tree using an array Write a function to traverse the tree in preorder manner.
4. (a) Write an algorithm to find connected components of a graph.
(b) Explain set implementation using bit string.
5. (a) Explain graph data structure. Illustrate a practical use of graph data structure.
(b) What is an expression tree ? Draw an example expression tree of height 3. Illustrate basic traversals on the tree.
6. (a) Give a definitim for binary search tree. Wnte algorithms to insert and delete keys from a
(b) What is double hashing ? Illustrate double hashing using a suitable example.
7. (a) Illustrato merge sort using a suitable example.
(b) Discuss external sort algorithms.
H
(5 x 20 = 100 marks)
|
Attachment: |
| Earning: Approval pending. |
