Bharathiar University 2009 B.C.A Computer Application Data structures and algorithms - Question Paper
D 1533 Q.P. Code : L07 DSCA 05J
(Kor the candidates admitted from 2007 onwards) B.C.A. DEGREE EXAMINATION, DECEMBER 2009. Second Yoar Part III Computer Applications
DATA STRUCTURES AND ALGORITHMS Time : Three hours Maximum; 100 marks SECTION A (5 x 20 = 100 marks)
Five out of Eight questions to be answered :
1. (a) Explain what criteria should be considered for analysing a program. (10)
(b) Writw a note on sparse matrix. (10)
2. (a) Discuss the working uf stack. (10) (b) Describe on mazing problem. (10)
3. Elaborate the various methods for evaluating an expression. (20)
(a) Comment on the working of linked stacks
and Queues. (8) (b) Illustrate the concept of polynomial addition. (12) Describe the working of (a) Garbage collection and. <10)
(b) Compaction. (10)
Explain the following :
(c) Quick sort. (7) Describe the working principal of hash table. (20)
Narrate the procedure of organizing Files which
suitable illustration. (20)
2 D 1533
|
Attachment: |
| Earning: Approval pending. |
