Madras University (UnOM) 2011 B.C.A Computer Application C++ - Question Paper

NOVEMBER 2011 50410/SAE3A/SAZ3A

Time: three hours Max: 75 marks

part A -(10x2=20 marks)

ans any TEN ques..

All ques. carry equal marks

1. What do you mean by dynamic binding? How is it useful in Object Oriented Programming?

2. List our any 4 special functions of friend function.

3. discuss copy constructor with an example.

4. Why is it necessary to overload an operator.

5. When do we make a virtual function "Pure"? elaborate the implications of making a function a pure virtual function?

6. provide any 4 file mode parameters with their meanings.

7. How do you push and pop elements in a stack?

8. Construct a binary tree for the subsequent expression:A+(B-C)*D.

9. describe hashing.

10. Write the procedure for preorder traversal of binary tree.

11. describe protected variable.

12. Differentiate ranging from true and Formal arguments.

part B -(5x5=25 marks)

ans any 5 ques..

All ques. carry equal marks

13. Write a C++ program to evaluate the cosine series upto n terms.

14. discuss virtual function with an example.

15.Discuss on kind Conversion in C++.

16. discuss fault handling during file operations.

17. discuss the procedure to delete a node in the singly linked list.

18. discuss with a routine to insert anode into a binary search tree.

19. discuss the Linear Probing technique with an example.

part C -(3x10=30 marks)

ans any 3 ques..

All ques. carry equal marks

20. elaborate friend functions? Write a C++ program to add and subtract 2 complex numbers using friend functions.

21. discuss the different kinds of inheritance with examples.

22. discuss with an example how an infix expression is converted into postfix expression.

23. discuss the shortest path algorithm with an example.

24. discuss in detail the common resolution strategies used in Hashing.

Earning:   Approval pending.