CS301 final paper vu feb3

1 Q tha k stack me postfin or infix kesy kam karty hai 5 marks
2 heapsort or array mil k kesy kth smallest value maloom karty hai 5 marks
3 number thy usy selection sort me karna tha 5 marks
4 numer thy usy kaha k binary search tree me kar k pta nai kia maloos kary us ki samjh nai i 5 marks
5 lenght() method maloom karna tha in query 3 marks
6 heap sort ki advantage 3 marks
7 searing in skip list method 3 marks
8 number thy usy merge array me karna tha 3 marks
9 what is ADT 2 marks
10 collision ka pocha tha k kesy hoti hai 2 marks
11 divide and conquer k elwa kn sa sort k method hai 2 marks
12 heapsort k bary me he tha Q bhol gya

DOWNLOAD SOLUTION HERE
loading...