B.Sc. DEGREE EXAMINATION, NOVEMBER 2017
Second Semester
Computer Science
PROGRAMMING IN C AND DATA STRUCTURES
(CBCS 2014 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. What do you mean by dynamic initialization of a
variable? Give an example.
2. What does function prototype means? Is it compulsory?
3. What are objects? How are they created?
4. What is a parameterized constructor?
5. What do you mean by base class and derived class?
6. How can private members be accessed using pointers?
7. Give an algorithm to add an element to a stack.
8. What do you mean by queue?
9. What is binary tree?
10. What is meant by weighted graph?
Sub. Code
4BCE2C1
AFF-4559
2
Ws1
Part B x 5 25)
Answer all questions.
11. Explain briefly the basic concepts of object- oriented
Programming.
Or
Write a program to display only even numbers
in between 1 to 50.
12. Describe the importance of destructors.
Or
Write a program to declare static member
functions and call them from main function.
13. Explain hierarchical inheritance with an example.
Or
Explain how is polymorphism achieved at compile
time and run time.
14. Explain the linked stack add and delete procedure.
Or
Explain the doubly linked list insert and delete
algorithm.
15. Write and explain the three tree traversal
algorithms.
Or
Explain the three representation of graph.
AFF-4559
3
Ws1
Part C x 10 30)
Answer any three questions.
16. Write a program to find NCR using function factorial
and treat this function as inline
17. Define a class string. Use over loaded operator to
compare two strings.
18. Write a program to illustrate the use of this'
pointer.
19. Write an algorithm to evaluate an expression using
stacks. Illustrate with an example.
20. Describe in detail about the various graph traversal
methods.
————————