CS502 VU Midterm Current Papers Fall 2011 of Virtual university of paksitan (www.vusolutions.com)
Paper details of question.
MCQz were 50% from past papers and 50% were new and tough.
Subjective part was from the past papers except 1 (5 number) question Detail is.
• How to Build heap? (2 marks.)
• Write down the steps of dynamic programming strategy. (2 marks)
• Two sorting algorithm having duplicate elements is such a way that
one of order nlogn and On^2 (3marks).
• Write steps involved in 0/1 knapsack algorithm problem (3-Marks)
• Solve the recursion problem. (5marks.)
• We are given an array of n elements of x1 , x2 ,x3 , ,,,,xn,
suggest best sorting algorithm of order On. (5 marks).
