40 MCQS and 12 subjective
postfix to infix conversion
insertion
show all steps by converting the array into min heap
conclusion of running time analysis of ADT
length() method
c++ code
.............
Another Paper:
objective mostly past prrz sy aya tha...............
1-3 important characteristics of skip list.
2-drawback of using array to store BST.
3-examples of hashing.
4-c++ code to add node in doubly link list.
5-wat u conclude from the running time analysis of disjoint sets.
6-explain how heap sort work.
7-what is c++ template.
8-explain and write the code for union and find operation of parent array in disjoint sets.
aur 2 question main coding thi.........aik main error theakh krna tha aur dosra yaad nae kia krna tha
han aik aur v question tha...............5 3 8 9 1 7 0 2 6 4 is main select sort operation krna tha.
1-3 important characteristics of skip list.
2-drawback of using array to store BST.
3-examples of hashing.
4-c++ code to add node in doubly link list.
5-wat u conclude from the running time analysis of disjoint sets.
6-explain how heap sort work.
7-what is c++ template.
8-explain and write the code for union and find operation of parent array in disjoint sets.
aur 2 question main coding thi.........aik main error theakh krna tha aur dosra yaad nae kia krna tha
han aik aur v question tha...............5 3 8 9 1 7 0 2 6 4 is main select sort operation krna tha.
No comments:
Post a Comment