B.Sc. DEGREE EXAMINATION, NOVEMBER 2017
Second Semester
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. Define Class.
2. What is Private member function?
3. What is Constant member function?
4. How do create array of objects?
5. What is Default Constructor?
6. Define Destructor.
7. Define polymorphism.
8. What is pure virtual function?
9. What is the principle used in quicksort?
10. How is Graph represented using Adjacency matrix?
Sub. Code
1BCE2C1
AFC-10383
2
WK16
Part B x 5 25)
Answer all questions, choosing either or
11. Compare switch statement with if ..... else if
statement.
Or
What is inline function? Give an example.
12. Explain passing objects as function argument.
Or
Explain friend function with an example.
13. Explain parametreized constructor with an
example.
Or
Explain copy constructor.
14. Write a program to find out area of Triangle,
square and rectangle using function over loading
and virtual function.
Or
Write a program to illustrate abstruct class.
15. Explain Binary search algorithm with an example.
Or
Explain merge sort with an example.
AFC-10383
3
WK16
Part C x 10 30)
Answer any three questions.
16. Discuss principles of object oriented programming.
17. Explain static member function and pointer to member.
18. Explain Dynamic constructor and initialization of objects.
19. Explain multiple and hybrid inheritance.
20. Explain prim's algorithm.
————————