Acharya Nagarjuna University (ANU) 2007 Diploma Information Technology DATA STRUCTURES WITH C - - Question Paper

P.G.DIPLOMA EXAMINATION, MAY 2007.
info Technology
Paper IV- DATA STRUCTURES WITH C

Time: 3 hours Maximum: 75 Marks
ans any 5 ques.
All ques. carry equal marks.

1. Write about different loop structures available in C.

2. discuss about Binary Trees with example.

3. discuss about Single and Double linked lists with examples.

4. What is a tree and discuss about different tree traversal techniques.

5. discuss about any five String handling functions with examples.

6. discuss about Quick Sort.

7. What is a Doubly ended queue and provided examples.

8. discuss about a procedure for searching for a element in a provided list.

9. discuss about Circular Linked list and provide its advantages over Doubly Linked List.

10. discuss about the insertion and deletion of a node in a Binary Tree.

Earning:   Approval pending.