Download Model question papers & previous years question papers
Submit Previous Years University Question Papers
Posted Date: 08 Oct 2009 Posted By:: Sachidananda Patnaik Member Level: Silver Points: 5 (Rs. 1)
2007 Berhampur University M.Tech Computer Science Design & Analysis of Algorithms Question paper
Full Marks - 60
Each Question 15 marks
1.a. What is an algorithm? State & Explain basic properties of an algorithm. (8 marks)
b. Explain the Space & time complexities. (7 marks)
a. Describs the kruskal's algorithms for finding the minimum spanning three.
b. What is an optimal Binary Three? Write an algorithm for inserting an element into a binary search tree.
2.a. What is the principle of optimality? Explain with two examples.
b. Explain the Dynamic Programming methid.
a. Explain the greedy technique with Kuapsack problem as an example.
b. Explain the probelm of job Scheduling with dead lines with an example.
3.a. Explain Branch & Bound Technique using traveling salesman problem as an example.
b. Explain the Back Tracking Strategy.
a. Describe merge sort algorithm using Divide-and-conquer strategy.
b. Explain how the above merge sort algorithm sorts the following losts or numbers 5,8,6,3,7,2.
4.a. Describe NP-Hard probelm with suitable eample.
b. Explain the difference between NP-Hard and NP-Complete problem.
a. State and prove Cook's theorem.
~~~~~Best of Luck~~~~~
Return to question paper search
and make money from adsense revenue sharing program
Are you preparing for a university examination? Download model question papers
and practise before you write the exam.