B.Sc. DEGREE EXAMINATION, APRIL 2018
Computer Science
PROGRAMMING IN C AND DATA STRUCTURES
(CBCS 2011 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. How do you strings as input and output in
2. What are left shift and right shift operation?
3. How to initialize one dimensional array?
4. What is pointer?
5. Define union.
6. What is sequential file?
7. What are the advantages of linked list?
8. How are elements processed in queue?
9. Define degree of node in tree.
10. Define binary tree.
Sub. Code
1BCE1C1
AFC-10678
2
Wk 10
Part B x 5 25)
Answer all questions choosing either or
11. Explain break and continue statement with an
example.
Or
Tabulate Arithematic, logical and relational
operators supported by
12. Write a program to illustrate passing pointers to
a function.
Or
What are the operations done on pointers? Explain.
13. Explain self referential structure.
Or
Explain Enum data type.
14. Explain operation on stack.
Or
Explain operation on queue.
15. How are binary trees represented using array?
Or
How are binary trees represented using linked list?
AFC-10678
3
Wk 10
Part C x 10 30)
Answer any three questions.
16. Explain storage classes supported by
17. Write program to find out average of given set of
numbers using function.
18. Explain operations on a file.
19. Discuss algorithms used to insert a node into the linked
list.
20. Discuss applications of binary trees.
————————