20 mcqs came from moaz file out of 40,
subject were
1. define binary tree
2. when an item should be added in array
3. a level order, and post order
4. draw a new heap after removing any element from given heap.
5. correct the code.
6. merge sort
7. characterstics of skip list.
8. name implementation technique of disjoint set for sorted data.
Comments
Post a Comment
Please give us your feedback & help us to improve this site.