@all
CS502 mid term exam today 0730(10-06-23)
L.Q
*Apply merge sort on following nbrs
7,9,1,5,3,8,4,2,6
*Difference between divide & conquer and dynamic programing
*Aik code k analysis thy 🥺
S.Q
* Define & explain heap
* Summation & theta notation of geometric series
* Aik 😇 gya h 😕
MCQ’s
***Tym cmplxty for
Heap , Quick & insertion
*Heap use inorder traversal
*Dp running time theta n^2
*Max heap m nbr remove karty hoe hole kahan ho ga(root ya leaf pay)
*if the given memory is premium the we use (inplace ya stable )
*Counting sort m sy rank waly q thy like which matter , only consideration & only emphasis…
*Plane sweep m fist action kn sa karien gy
* ….✌️