Total Questions: 23
Subjective Question: 5
3 and 5 marks questions
CS502 MID TERM SPRING 2018
CURRENT PAPER NO. 1
|CS502-Fundamentals Of Algorithms current mid term paper spring 2018
MCQs are 85% from book and remaining 15% from past paper.
1) It is possible to sort without comparison, yes then how?
2) Find the maximal point(which is not dominated by any other)example of 2D maximal set(the set of point use plane sweep Algorithm.)
3) Arranged this given set:
(((O,√nlog n), o (n/n), o(n/logn),o(n/√n) o(√n,√n)))
4) Why the statement are meaningless.
the remaining Algorithm is at least o(n^2).
5) Write down the dynamic programming steps.
Shared by: Fahad Mughal
Share your paper of CS502 Also below 👇 in comments with us and help others.