B.Sc. DEGREE EXAMINATION, APRIL 2018.
Computer Science
PROGRAMMING IN AND ALGORITHMS
(CBCS 2011 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. What is an object?
2. What is the advantages of inline functions?
3. What is the restriction for static member function?
4. What is the characteristic of court member function?
5. Define constructor?
6. What is the use of destructor?
7. What is the advantage of inheritance?
8. Define virtual functions.
9. What is the principle used in binary research?
10. What is minimum spanning tree?
Sub. Code
1BCE2C1
AFC-10679
2
Ws20
Part B x 5 25)
Answer all questions, choosing either or
11. Compare switch statement with if...else if statement.
Or
Explain rules for coding for...loop.
12. How is memory allocated for static and dynamic
objects?
Or
How are objects passed as function argument?
13. Explain about parameterized constructor with an
example.
Or
Explain about dynamic initialization of objects.
14. Write a program to overload binary operator.
Or
Write a program to over load uniary operator.
15. Explain insertion sort with an example.
Or
Explain merge sort with an example.
AFC-10679
3
Ws20
Part C x 10 30)
Answer any three questions.
16. Explain features of object oriented progrmming.
17. Explain friend function with an example.
18. Write a program to generate Fibnoacii series using
copy constructor.
19. Explain multilevel and hierarchical inheritance with
suitable example.
20. Explain Dijikstra's algorithm.
————————