My today’s cs301
paper was very easy
Subjective 90% moaz aur waqar ki files se thay aur bht easy thay
Kuch mcqs handouts se thay.
Short questions
1) What is heap and its types
2) how avl is different from bst
3)
Single left rotation perform krni thi
4)
Types of divide and conquerer method
1 question Pseudo code wala tha 1 yad nhi.
Long questions:
1) delete min function apply krna tha 4 bar
2) AVL tree ki double left right rotation
3) C++ code for insertion sort
4) hash function k zariye hash key finds krna thi modulus apply kr k.
Overall paper was so easy
Main topics
AVL tree
Heap and its types and methods
Hashing
Binary search wagera kr k jaen.