B.Sc. DEGREE EXAMINATION, NOVEMBER 2017
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. List out the uses Object oriented Programming.
2. State the uses of reference variable.
3. Define constructor.
4. How does dynamic initialization of objects achieved in

5. What is the purpose of an abstract class?
6. What is polymorphism'?
7. What is topological sorting?
8. Write the conditions for binary search tree.
9. Write a travelling salesman problem.
10. What is a shortest path algorithm?
Sub. Code
1BIT3C1
AFC-10399
2
WSS
Part B x 5 25)
Answer all the questions, choosing either or
11. Explain control structures in with a program.
Or
Write the uses of inline functions with an example.
12. Discuss Dynamic constructor in detail.
Or
Write a program to implement Two-Dimensional
Array.
13. Explicate Operator overloading in with sample
program.
Or
Write a program to implement virtual function.
14. Illustrate Depth-First Search algorithm with an
example.
Or
Elucidate Breadth-First Search algorithm with an
example.
15. What is Coin changing? Explain.
Or
Write about Dijkstra's Algorithm.
AFC-10399
3
WSS
Part C x 10 30)
Answer any three questions.
16. Explain the following with examples
Array within a class
Pointer to Member.
17. Explain new and delete operators with examples.
18. What is Inheritance? Explain different types of
Inheritances.
19. What is Sorting? Discuss the various types of Sorting.
20. Illustrate the Kruskal's algorithm in detail.
————————