CS502 All Current Midterm Papers Spring 2013

On Sat, Jun 1, 2013 at 8:38 AM, YASIR AWAN <yasirawan1992@gmail.com> wrote:

my Today's paper CS502
Q Quick sort such that sort the array in to non-increasing order?
Q we can avoid unnecessary repetitions for recursive calls?
Q-Write a pseudo code Fibonacci With memorization? -- (3)
Spelling correction in edit distance? 3 marks
Bubble sort?
What is the worst case running time for the Quick sort? What simple change is
required in the algorithm to preserve its linear expected running time and makes it
worst case time Θ(n log n)
---------------------------------------------------------
MCQ QUESTION MOSTLY FROM HANDOUT
GIVEN ARRAY AND MAKE MAX-TREE 5 MARKS
QUICK,HEAP,COUNTING,MERG KA TABLE KA JIS ME STABLE OR IN-PLACE BTANEY THE 5 MARKS
ADIT DISTANCE KI 3 APPLICATION K NAME BTANEY THE 3 MARKS
MEMOIZATION KI DIFINATION THI 2 MARKS
WORS CASE OR AVERAGE CASE DEFINE KRNE THE 2 MARKS
EK 3 NUMBER WALA QUESTION THA US KA YAD NHE.

--
You received this message because you are subscribed to the Google
Groups "-VU-ROCKS-" group.
To post to this group, send email to VU-ROCKS@googlegroups.com
http://groups.google.com/group/VU-ROCKS?hl=en
---
You received this message because you are subscribed to the Google Groups "-VU-ROCKS-" group.
To unsubscribe from this group and stop receiving emails from it, send an email to VU-ROCKS+unsubscribe@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.
 
 

--

Need Your Comments.....!

-- 
For University of Pakistan Study Material Sharing, Discussion, etc, Come and join us at http://4e542a34.linkbucks.com
You received this message because you are subscribed to the Google
Groups "Study" group.
To post to this group, send email to http://ca13054d.tinylinks.co
For more options, visit this group at
http://004bbb67.any.gs