NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY

THIRD SESSIONAL TEST

ODD SEMESTER(2014)
B. Tech. III Semester
Branch: CSE Section: B
Subject: Data Structures using C Paper Code: NCS-301
Time: 1:30 HRS. Maximum Marks:
30

Section A
Attempt all questions: (5*2=10)

1. Insert the following keys in the order shown to construct an AVL search tree:
A, B, C, D, E, K, J, I, H, G, F

2. Discuss the different cases of insertion in B tree.

3. What do you understand by activity network? Explain with the help of suitable example.

4. Define transitive closure. Assume any graph and find out its transitive closure.

5. Analyze the best, worst and average case of insertion, selection, bubble, quick, merge sort.

Section B

Attempt any two questions: (2*5=10)

1. What do you understand by Hashing? Explain different types of technique of hashing. How
the problem of collision is handled in hashing?

2. What are the properties of B tree? Create a B tree of order 5 using following keys:
3, 14, 7, 1, 8, 5, 11, 17, 13, 6, 23, 12, 20, 26, 4, 16, 18, 24, 25 and 19

3. Write the Warshall algorithm and illustrate it with the help of an example. Define garbage
collection and compaction

Section C
Attempt any two questions: (2*5=10)

1. Describe an AVL tree. How it is different from BST? Also discuss the different rotations done
in AVL Tree.

2. Write an algorithm for sorting a set of numbers in descending order using selection sort.
Analyze the algorithm. Write a C program of Insertion sort and analyze its worst

3. What do you understand by heap? Illustrate the operation of Heap sort on the following
array: A={5, 13, 2, 25, 7, 17, 20, 8, 4}.