Current paper of Cs502 28 november 2011
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
You received this message because you are subscribed to the Google Groups "Pak Youth" group.
To post to this group, send email to pak-youth@googlegroups.com.
To unsubscribe from this group, send email to pak-youth+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/pak-youth?hl=en.
No comments:
Post a Comment