Thiruvalluvar University 2006 B.C.A Computer Application Data structures and C programming - Question Paper
Thursday, 31 January 2013 05:45Web
APRIL/MAY 2006 CAE
Time:Three hours Maximum marks:100 marks
PART A- (5 * eight = 40marks)
ans any 5 ques..
All ques. carry equal marks.
1. discuss the while and do....while statements
2. provide a brief account on functions in C..
3. discuss with example any 4 string handling functions.
4. discuss array with examples in C.
5. discuss how infix and postfix expressions are evaluated..
6. Write about singly linked list.
7. provide brief account on Hashing.
8. Write about binary tree and its operations..
PART B-( three * 20 = 60 marks)
9. discuss Dynamic memory allocation in C.
10. Write about input/output operations on files in C.
11. explain in detail about stack and queue.
12. discuss how linked list can be used for polynomial addition.
13. Explain:
(a) Graph traversals
(b) Tree traversals
(c) Shortest path.
Earning: Approval pending. |