Anna University -Study Materials for all Departments # CS2201/CS 33/ 10144 CS 302/08023007 Data Structures Unit III Question Bank

Anna university

CS2201/CS 33/ 10144 CS 302/08023007 Data Structures Question Bank for Unit III

Department of Computer science and Engineering

Meant for Anna University Coimbatore,trichy,trinelveli

Question Bank
(Regulation 2008/2010)
___________________________________________________________________________________
Details:
University:Anna University
Year: second Year
Department: B.E Computer Science and Engineering
Semester:Three(III)
Content:CS2201/CS 33/ 10144 CS 302/08023007 Data Structures Question Bank for Unit I
Subject code: CS2201/CS 33/ 10144 CS 302/08023007
Subject Name: Data Structures ( DS )
Unit Number: 3
Regulation: 2008 or 2010
Post Type: Question Bank

PART A QUESTION BANK

1. Define non-linear data structure?
2. Define tree?
3. Define leaf?
4. What is meant by directed tree?
5. What is an ordered tree?
6. What is a Binary tree?
7. What are the applications of binary tree?
8. What is meant by traversing?
9. What are the different types of traversing?
10. What are the two methods of binary tree implementation?
11. Define pre-order traversal?
12. Define post-order traversal?
13. Define in -order traversal?
14. What is the length of the path in a tree?
15. Define expression trees?
16. Define strictly binary tree?
17. Define complete binary tree?
18. What is an almost complete binary tree?
19. Define AVL Tree
20. Define collision resolution

PART – B

1. (a) Construct an expression tree for the expression A+(B-C)*D+(E*F) (8)
(b) Write a function to delete the minimum element from a binary heap (8)
2. Write a program in C to create an empty binary search tree & search for an element X in it. (16)
4. Explain in detail insertion into AVL Trees (16)
5. Write a recursive algorithm for binary tree traversal with an example. (16)
6. Write an algorithm for initializing the hash table and insertion in a separate Chaining (16)
7. State & explain the algorithm to perform Heap sort. Also analyze the time Complexity of the algorithm (16)
8. Write a C program to perform Merge sort and analyze time complexity of the Algorithm. (16)
9. State & explain the algorithm to perform Quick sort. Also analyze the time complexity of the algorithm. (16)
10. State & explain the algorithm to perform Shell sort. Also analyze the time complexity of the algorithm. (16)

---------------------------------------------------------------------------------------------------------------------

Search Terms used by students:

Anna University Coimbatore Question Bank
Anna University Chennai Question Bank
Anna University trichy Question Bank
Anna University tiruelveli  Question Bank
CS2201 Data Structures Question Bank
CS33 Data Structures Question Bank
CS302  Data Structures Question Bank
10144 CS 302  Data Structures Question Bank
08023007 Data Structures (DS)
UNIT 3 Question Bank
Part A DS Question Bank
3rd Semester QB
3rd semester Question Bank
Part B Question Bank on unit 3

Blogger Comment