Mcqs 40..
- 1: when hashing is not suitable?
- 2: how does heap sort work to sort asset of data,..
- 3: diif application of hashing.
- 4: characteristic of skip list
- 5:covrt following inn prefix 67*89/-
- 6:which implementation of disjoint wet is better wth space and y/
- 7binary tree ma deletion ka processs tha
- 8 show result of the sequences of instruction
- 1. union(1,2)
- 2. union(3,5)
- 3. union(7,2)
- 4. union(8,9)
- 5. union(14,15)
- 6. union(16,17)
- 7. union(14,17)
- sort list
Insertion sort algorithm
- aik aur b tha remove priority queue ka program likhna tha
Comments
Post a Comment
Please give us your feedback & help us to improve this site.