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. Explain the LL rotation and RR rotation with the help of suitable example.
2. What is graph? What are the ways to represent a graph?
3. Define 2-3 tree. What is the advantage of using m-way search tree?
4. Discuss the different cases of insertion in B tree.
5. How using hash table is beneficial for us? List the collision resolution strategies used in hash
table.

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

1. Suppose A is the following list of 14 alphabetic characters: D, A, T, A, S, T, R, U, C,T, U, R,

E, S. Suppose the characters in A are to be sorted alphabetically. Use the quicksort algorithm
to find the final position of the first character D. Also, explain the complexity of quicksort.

2. What is the difference between linear search and binary search? Search the ITEM 4 in the
given list and find the number of comparisons using both techniques and also explain which
one is better?
3 1 6 8 2 4 5

3. What is an AVL? Following keys are inserted in order shown below into AVL tree 50, 45, 80,
95, 26, 43, 105, 2. Show how tree appears after each insertion.

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

1. What is a heap? Write an algorithm to insert an element into a heap.

2. Write Dijkstra’s algorithm to find the shortest path from the given source to destination.
What do you understand by garbage collection and compaction?

3. Write a C program of Bubble sort and analyze its best case.

 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