Advertisement

Mid Term Exams CS502 (Fundamental Of Algorithm)



Total Question were =22

MCQs =16

Question: (1 Marks)

What is 2-dimenssion Maxima Problem?

Question: (1 Marks)

Where Divide and Conquer Strategy is Applicable?

Question: (2 Marks)

Concider sorting three Numbers a1, a2, a3 with comparison- based sorting Algorithm then how many combinations Are possible?

Question: (3 Marks)

According to divide and conquer Strategy describe its Steps shortly.

Question: (5 Marks)

Given is the recursive relation for quick sort.

If we take n=2 then solve it.

Question: (10 Marks)

If you have to compare three values a1,a2,a3 then make the decision tree for it without considering the equality.

0 Responses