B.Sc. DEGREE EXAMINATION, NOVEMBER 2017
Third Semester
Information Technology
PROGRAMMING IN AND ALGORITHMS
(CBCS 2014 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. Define Class.
2. What is static Data members?
3. Define Constructor.
4. Write about Dynamic Initialization of objects.
5. Define Operator Overloading.
6. Define Pointers.
7. What is the restriction of binary search?
8. What is the Computing time of quick sort?
9. What is known as Huffman code?
10. How can you compute Fibonacci number?
Sub. Code
4BIT3C1
AFF-4546
2
Wk16
Part B x 5 25)
Answer all questions.
11. Write a note on data types used in
Or
Discuss about memory allocation for objects.
12. Write a note on Parameterized Constructors.
Or
Write a program in illustrate the usage of copy
constructor.
13. Write a program illustrating the concept of
pointer.
Or
Give a brief note on virtual functions.
14. Discuss about a lower bound for the sorting
problem.
Or
Write a note on topological sort.
15. Describe the longest common Subsequence
problem.
Or
Give a brief note on Prim's algorithm.
AFF-4546
3
Wk16
Part C x 10 30)
Answer any three questions.
16. Explain the principles of object oriented programming in
detail.
17. Write a program to arrange the given set of names in
alphabetical order.
18. Explain the various forms of inheritance.
19. Write a detailed note on Strassen's Matrix product
algorithm.
20. Explain in detail the Algorithm of Warshall.
————————