Scribd
Upload
0 views2 pages

Sums

Sums

Uploaded by

dhruv darji
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 views2 pages

Sums

Sums

Uploaded by

dhruv darji
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Navlakhi

Sums
1. Show how heap sort processes the input 31, 41, 59, 26, 53, 58, 97
2. Find 88 in the data given below. At each step show the position of first, last and mid
8, 13, 17, 26, 44, 56, 88, 97
3. Use modulo – division method and linear probing, store the keys shown below in an array with
19 elements. How many collisions occurred? What is the density of the list after all keys have
been inserted?
224562 137456 214562
140145 214576 162145

navlakhi.mobi
144467 199645 234534
4. Use B-tree of order 3 & delete 90, 60. In each step show the resulting B-tree
9820246760 / 9769479368

5. Give DFS & BFS traversal of the graph shown below, starting from vertex A

|
navlakhi.com
6. Find the minimum spanning tree (Prims algorithm) for the following graph [ONLY for IT]

7. The preorder and postorder sequence is as follows. Draw the tree


Preorder: GFDABEC
Postorder: ABDCEFG
8. The Inorder and Postorder sequence is as follows. Make the tree
INORDER: RQONPSZ
POSTORDER: RONQSZP

Be With The Best


Navlakhi
9. Draw all possible trees for the INORDER sequence ABC
10. Show insertion of 2,1,4,5,9,3,6,7 into an already empty AVL tree.
11. An algorithm runs a given input of size N. If N is 4096, the run time is 512 ms. If N is 16384, the
run time is 1024 ms. What is the big – O notation for the same?
12. Explain the QuickSort on the following list of numbers
65 70 75 80 85 50 55 45
13. Show insertion sort passes on the following number
567 456 455 324 213 665 777 907 990 654
14. Give DFS & BFS of the following graph. Assume 1 to be the start node

navlakhi.mobi
9820246760 / 9769479368

15. Give the HAUFFMAN Tree for MANTRALAYA

|
navlakhi.com

Be With The Best

You might also like