Tamil Nadu Open University (TNOU) 2006 M.C.A Data Structures through C - - Question Paper

First Semester
Data Structures through C
Time: three hours
Maximum marks: 60

PART A - (4 x five = 20 marks)
ans any 4 ques..

1. discuss the basic structure of a C program.

2. define the 4 basic data kinds.

3. Compare while loop with do-while loop.

4. discuss the difference ranging from 'call by reference' and 'call by value'.

5. What is a Queue? discuss the different operations performed on it.

6. State and discuss the Heap Sort algorithm.

PART B - (4 x 10 =40 marks)
ans any 4 ques..

7. State the differences ranging from structure and union in C.

8. elaborate pointers? discuss the usage of pointers in C.v9. define the tree traversal techniques and discuss their applications.

10. How a graph can be represented by its adjancency list and matrix? discuss it.

11. Write the operation on AVL Tree and discuss them.

12. Write and discuss the breath-first search algorithm and depth 1st search algorithm.

Earning:   Approval pending.