Periyar University 2006 B.Sc Computer Science C AND DATA STRUCTURES - Question Paper

B.Sc. DEGREE EXAMINATION, APRIL/MAY 2006.
Third Semester
C.S
C AND DATA STRUCTURES
Time : 3 hours Maximum : 100 marks
PART A — (10 x two = 20 marks)
ans ALL the ques..
1. What are tri graph characters? How are they useful?
2. What is the use of kind conversion in C?
3. How will you declare the pointer variables?
4. What are the common uses of rewind and ftell functions?
5. Distinguish ranging from 'stack' and 'queue'.
6. Convert the infix expression (A + B) * D - (E - F) to postfix expression.
8. What is Circular List?
9. Define binary tree.
10. What is digraph?
PART B — (5 x four = 20 marks) ans ALL the ques..
11. (a) define the 4 basic data kinds. How could
we extend the range of values they represent.
Or
(b) discuss the printf and scanf statements.
12. (a) How to describe a structure and list out the
rules associated with structure members?
Or
(b) Write a C program to copy 1 string to a different and count the number of characters copied.
13. (a) provide an algorithm to add an element to a
stack.
Or
(b) How will you delete an element from a queue? Illustrate.
14.(a)linked structure is formed.
Or
(b) Write the doubly linked list concept and its application.
15. (a) explain the various tree traversals.
Or
(b) discuss the graph representation with examples.
PART C — (5 x 12 = 60 marks)
ans ALL the ques..
16. (a) With suitable example discuss the different
operators used in C.
Or
(b) Write a C program to obtain the number of days in a month for a provided month and year using switch statement and functions.
17. (a) discuss how to use pointers in C
programming and provide examples for pointer arithmetic.
Or
(b) Write a C program to print a file in reverse order.

18. (a) discuss Representation of arrays in memory.
Or
(b) What is a circular queue? Write procedures for insertion and deletion of an element.
19. (a) Summarize the procedures of linked stacks
and linked queues.
Or
(b) discuss the procedure to add 2 polynomials.
20. (a) discuss the steps involved in converting
forest to binary tree.
Or
(b) discuss different graph traversal method.

Earning:   Approval pending.