Monday, November 28, 2011

(VU-Study-Corner) my CS502 Today Paper 28 nov 2011



Current paper of Cs502


Mcqs past paper men say koi aik 2 hi tha bs


20 MCQs most about running time and worst case time of algorithms.

1.       Worst case for edit distance algorithm? What is the simple change that can change the worst case time ? 5 marks

2.       Write Pseudo code for KNAPSACK algorithm?  5 marks

3.       Spelling correction in edit distance? 3 marks

4.       Differentiate b/w Bubble sort, insertion sort and selection sort? 3 marks

5.       Average case and worst case time for quick sort?  2 marks

--
Join us at facebook: https://www.facebook.com/VU.Study.Corner
 
Group Link: http://groups.google.com/group/VU-Study-Corner?hl=en
 
Group Rules: http://groups.google.com/group/VU-Study-Corner/web/group-rules
 
Unsubscribe: VU-Study-Corner+unsubscribe@googlegroups.com
 
Adult contents, Spamming, Immoral & Rudish talk, Cell number, Websites & Groups links specially in paper days are strictly prohibited and banned in group.

No comments:

Post a Comment