Nalanda Open University 2009 B.C.A Computer Application Final , , Part I, VI (CS 62) (Practical ) - Question Paper
Final Examination, 2009, BCA Part I, Paper VI (CS 62) (Practical Examination)
Final Examination, 2009 Bachelor of Computer Application, Part-1,
Paper-VI (CS-62)
[ Practical Examination ]
SET-I
Time : 2.00 Hrs. Full Marks : 100
Answer all the questions.
1. WAP in C for evaluation of postfix expression.
2. A Dequeue is a list from which elements can be inserted or deleted at either end. WAP in C to implement a dequeue. Also check the necessary conditions.
3. WAP in C for searching a linked list to find a specific item of information stored in the list.
Final Examination, 2009 Bachelor of Computer Application, Part-1,
Paper-VI (CS-62)
[ Practical Examination ]
SET-II
Time : 2.00 Hrs. Full Marks : 100
Answer all the questions.
1. WAP to multiply two matrices of dimension [3 X 3] in C.
2. It is possible to keep two stacks in a single array, if one grows from the first position and other grows from the last position. Write procedure push (X, S) that pushes elements X onto stack S where S is one or other of these two stacks. Include all necessary assumptions.
3. WAP in C for searching a linked list to find a specific item of information stored in the following:
1
2 1
3 2 1
4 3 2 1
5 4 3 2 1
|
Attachment: |
| Earning: Approval pending. |
