Anna University Chennai 2007 Diploma Information Technology DATA STRUCTURES - Question Paper

DATA STRUCTURES
Time : 3 hours Maximum : 100 marks
ans ALL ques..
PART A — (10 ´ two = 20 marks)
1. describe Pseudo Code.
2. What do Time Complexity and Space Complexity mean?
3. provide 2 examples for Divide and Conquer Algorithm.
4. What is meant by Recursion? provide an example.
5. Write the hierarchy of operations in C Language.
6. What is the basic difference ranging from Structure and Union in C?
7. describe Complete Binary Tree.
8. What is the difference ranging from Singly Linked List, Doubly Linked List and Circularly Linked List?
9. What is meant by Minimum Spanning Tree?
10. When a Graph becomes a Tree?
PART B — (5 ´ 16 = 80 marks)
11. discuss the backtracking technique used to solve the 4–queens issue.
12. (a) discuss the implementation of merge sort using divide and conquer method.
Or
(b) discuss the various ways of parameter passing with suitable example.
13. (a) Write a C Program to Create and learn a data file.
Or
(b) What is meant by self–referential structures? discuss with an example.
14. (a) What is Towers of Hanoi Problem? discuss how stack is used to solve it for a issue with three Pegs and three Disks.
Or
(b) discuss a procedure to convert a General Tree into a Binary tree with an example.
15. (a) discuss any 1 algorithm to obtain the Minimum Spanning Tree for a Graph.
Or
(b) discuss the differences ranging from linear search and binary search.

Earning:   Approval pending.