oday paper of CS502 is at 7:30 am

90%Mcqs from vu topper file.

3 short questions of 2 marks 

1)differwnce between computer programe and algorith.2 makrs

2) instructions do thi 3 k wo konsi sort hain ...answer is bubble sort thi.insertion sort and selection sort.

3)array thi 1 or quick sort perform  karna tha.

Long question:

1)How does bubble sort works?

2) functions of counting sort

3) running time of 3n^2+7n-12 .find the constant c and n not.



@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 

* ....✌️