Programming in C++ and Data Structures NOVEMBER 2011 SAE3A

NOVEMBER 2011 50410/SAE3A/SAZ3A
Time: 3 hours Max: 75 marks
SECTION A -(10x2=20 marks)
Answer any TEN questions.
All questions carry equal marks

1. What do you mean by dynamic binding? How is it useful in Object Oriented Programming?
2. List our any four special functions of friend function.
3. Explain copy constructor with an example.
4. Why is it necessary to overload an operator.
5. When do we make a virtual function "Pure"? What are the implications of making a function a pure virtual function?
6. Give any four file mode parameters with their meanings.
7. How do you push and pop elements in a stack?
8. Construct a binary tree for the following expression:A+(B-C)*D.
9. Define hashing.
10. Write the procedure for preorder traversal of binary tree.
11. Define protected variable.
12. Differentiate between Actual and Formal arguments.

SECTION B -(5x5=25 marks)
Answer any FIVE questions.
All questions carry equal marks
13. Write a C++ program to evaluate the cosine series upto n terms.
14. Explain virtual function with an example.
15.Discuss on Type Conversion in C++.
16. Explain error handling during file operations.
17. Explain the procedure to delete a node in the singly linked list.
18. Explain with a routine to insert anode into a binary search tree.
19. Explain the Linear Probing technique with an example.

SECTION C -(3x10=30 marks)
Answer any THREE questions.
All questions carry equal marks
20. What are friend functions? Write a C++ program to add and subtract two complex numbers using friend functions.
21. Explain the various types of inheritance with examples.
22. Explain with an example how an infix expression is converted into postfix expression.
23. Explain the shortest path algorithm with an example.
24. Explain in detail the common resolution strategies used in Hashing.