by waqasdec on
My today paper 27-12-2013
Mcq’s mostly from past papers
1. Draw cost table r chain etrix multiplication problem with initial state. 2 marks
2. How to avoid unnecessary repetition for recursive calls. 2 marks
3. Why do we analyze the average case performance of randomized algorithm and not its worst case performance. 3marks
4. How to construct an optimal solution for 0/1 knapsack problem. 3 marks
5. Steps of dynamic programming strategy. 5 marks
6. Consider the following recursivem search function which return the index of array
element containing key, if such an element exist.
Int search(int array,int left, int right,int key)
{
Int mid= left+right/2
If (left == right)
Return left
Else
If (array [mid]<= array ...........)
.........
..........
........
List{5,6,7,8}
Pora question to yad nai
Is tra ka kuch tha
Remember me in ur prayers
Comments
Post a Comment
Please give us your feedback & help us to improve this site.