by Airborne on December 28, 2013 at 10:31pm For mid term preparation...Here is the summary of all Algorithms, Do remember in Prayers!:-
Download past papers, Video Lectures, Handouts, Study Software
Posts
by Neha on December 20, 2013 at 2:25pm total 26 question thy jin m se 2o number k mcqs mostly mcq's from prevous paper redix sort ka question aya 2 number ka r 5 number ka apliication of edit distance ai thi heap sort ka worst case pocha hoa tha 2 question m codes diye hoye thy onk worst case time analysis likhny thy average case ki assumption pochi gai thi,
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
by zaheer ahmad toseef on December 22, 2013 at 1:52pm MCQ's from moaaz file. and subjective from last 5 lectures. radix sort ka aik 5 marks ka question tha. edit distance ka aik question tha, number of entries pochi gyi thin. aik matrix walay se tha. baqi nyad ni.