# Institute of Chartered Financial Analysts of India (ICFAI) University 2008 B.Tech Computer Science and Engineering test 3rd: Data Structure and algorithm - Question Paper

Monday, 17 June 2013 10:25Web

Icfai tech,Bangalore

TEST III

Subject: Data Structure and algorithm Ma

**x.**

**Marks:**17

Code:CS302

**Time:**9AM to 9.50AM

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

**PART I**Fill up the blanks (5*0.5=2.5 )

1.The structure of a splay tree is simply a ____________________ tree.

2.The overall running time of search,insertion or deletion in a splay tree is _________________.

3.The method of finding an empty cell if a collision occurs is ________________________.

4.Average-case analysis of Quick sort algorithm is ________________________.

5.The value put in the 0th position of the binary heap is called as_________________.

**actual or False (5*0.5=2.5 )**

**PART I**I1.the DFS traversal ends when there are no more unexplored edges in the begin vertex.

2.BFS traversal terminates when all the vertex has been explored.

3.Merge sort runs in O(n log n) time in the worst case.

4.splay tree is not an attractive data structure in an amortized sense.

5.Any node in the min-heap should be smaller than all of its descendants.

**ans the subsequent : (4*3=12)**

**I****PART I**I1.Explain when to splay with an example every.

2.Give the routine for insertion Sort. Trace it for the input sequence, A=[24,23,7,30].

3.Explain any 2 Collision-handling Schemes.

4.Explain the BFS algorithm with an example.

******************************************** ALL THE BEST ***************************************************************

Earning: Approval pending. |