CS301 Latest Final Term Paper
40 MCQS..
4 QUESTIONS.. 2 MARKS
4 QUESTIONS.. 3 MARKS
4 QUESTIONS.. 5 MARKS..
ABOUT HALF MCQS WAS PAST PAPERS..
AND QUESTION ARE HERE..
1.Differenece b/w binary search tree and AVL tree?
2.What are the important facts to build a heap?
3.What do you meant by weight by size?
4.How we find a number using skip list ?
5.How we can take a concept to generate a maze ?
6.Create a max heap? ( some numbers are given)
7.Aur aik function given tha.. us main sy errors find krna thy aur correct krna tha.
No comments:
Post a Comment