B.Sc. DEGREE EXAMINATION, APRIL 2018
Third Semester
Information Technology
PROGRAMMING IN AND ALGORITHMS
(CBCS 2011 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. Mention the use of Object Oriented Programming?
2. What are the advantages of function prototypes in
3. Define class.
4. What is the benefit of scope resolution operator in
5. When do you use the protected visibility specifier to a
class member?
6. Define virtual base class.
7. What do you mean by topological sorting?
8. Write the condition for Binary Search tree.
9. What is greedy algorithm?
10. How do you find the Fibonacci number?
Sub. Code
1BIT3C1
AFC-10691
2
WK16
Part B x 5 25)
Answer all questions, choosing either or
11. Explain the concepts of functions in
Or
Discuss the various operators available in
12. Differentiate call by value and call by reference with
an example.
Or
Explain Constructors and Destructors in with a
program.
13. Explicate Type conversions in with a program.
Or
Illustrate the concepts of Polymorphism.
14. What is Backtracking? Explain with an example.
Or
What is the lower bound of the sorting problem?
Discuss it.
15. What is Huffman codes? Illustrate them.
Or
Discuss the Dijkstra's Algorithm.
AFC-10691
3
WK16
Part C x 10 30)
Answer any three questions.
16. What is virtual function? Explain with a sample program.
17. Discuss the following
Copy Constructor
Dynamic Constructor
18. How arithmetic operators are overloaded using friend?
Write a program to demonstrate it.
19. Explain Strassen's matrix product algorithm.
20. Discuss Floyd and Warshall Algorithms.
————————