B.Sc. DEGREE EXAMINATION, NOVEMBER 2017
First Semester
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. What is identifier?
2. What is the purpose of gets and puts functions?
3. Define array.
4. What is pointer?
5. What is Enum data type?
6. What is the difference between array and structure?
7. Convert the following expression into postfix form.
.
8. What is linked stack?
9. Define degree of a tree.
10. What is depth of a tree?
Sub. Code
1BCE1C1
AFC-10382
2
ws2
Part B x 5 25)
Answer all questions, choosing either or
11. Compare do.. while and while .. do loop.
Or
What is recursion? Explain with an example.
12. Explain any five string functions with example.
Or
Write a program to arrange 10 names in
alphabet.
13. Explain any five operations related with files.
Or
Write a program to illustrate Enum.
14. Writ an Algorithm to delete an node from the linked
list.
Or
Explain push and pop operations in a stack.
15. Explain representation of Binary tree using array.
Or
How to represent binary tree using linked list?
AFC-10382
3
ws2
Part C x 10 30)
Answer any three questions.
16. Discuss Datatypes supported by C.
17. Explain Dynamic memory allocation.
18. Write a program to declare results of an examination
for ten students using structure.
19. Explain Representation and operations on queue.
20. Discuss applications of Binary tree.
————————