CS502 Midterm Current Paper Courtesy by Rabia

On Fri, Dec 14, 2012 at 5:43 PM, ^*^Aniqa Malik^*^ <aniqa@vuzs.net> wrote:

  

 

Q # 1: how we heapify ??    2 marks

Q #2: Write running time for edit distance Algo... (2 marks)

Q # 3: tell the one similarity and 2 difference b/w divide and conquer strategy ?? 3marks

Q# 4:this statemnent is true or false: IN knapsack problem the rows are in non decreasing order . brefily explain ? 3marks

Q # 5: write the pseudo code of memofib ? 5marks

Q # 6: What is the timing complexity of this code?  5 marks

KNAPSACK(n, W)

1 for w=0, W

2 doV[0, w] ←0

3 for i=0, n

4 doV[i, 0] ←0

5 for w=0, W

6 do if(wi ≤w&v

i+V[i−1, w−wi

] > V[i−1, w])

7 thenV[i, w] ←v

i+V[i−1, w−wi

]

8 else V[i, w] ←V[i−1, w]

Regards

Aniqa MAlik

The Coward dies a thousand deaths, 

the Valiant, only once!

--
-- --
Please visit www.vuzs.net For Current & Old Papers, Quizzes, Assignments and study material.
 
To post a new message on this group, send email to vuZs@googlegroups.com
 
Message Posting Rules: http://www.vuzs.net/faq/4795-vuzs-google-groups-basic-rules-for-posting-messages.html
--
To unsubscribe from this group, send email to vuZs+unsubscribe@googlegroups.com
--
To join this group Send blank email to vuZs+subscribe@googlegroups.com
or visit
http://groups.google.com/group/vuZs/subscribe
 
 

--

-- 
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