MY TODAY PAPER CS502 SAEED AHMED MC120400429
MCQS almost all past paper sy thy , kuch 4 5 hongy new
1) how we heapify? 2 makrs
2) solve the knap-sap algoritham with brute force it takes O(2^n) time , can we improve efficiency ? 2 marks
3) three Applications of Edit distance ? 3 marks
4) why do we analysis average case of randumlize algorithem and not in case of worst algoritham ? 3 marks
5) 1 array thi howi thi is tarah kuch , 455, 698, 826,123,100,300,111, 819,943, apply radix sort on it? 5 marks
6) given array list order x1, x2, .....xn , thats hase n/5 copies, use the algoritham average cost , is tarah ka tha kuch........5 marks
Comments
Post a Comment
Please give us your feedback & help us to improve this site.