Looking for Berhampur University Design and Analysis of Algorithms Old Question Papers / Model Question Papers ? Collect MTech CSE Design and Analysis of Algorithms Question Paper of 2007 exam year here.
University Name : Berhampur University
Department : M.Tech Computer Science
Question Paper Code: Not Applicable
Exam Year : 2007
Subject Name of Question Paper: Design and Analysis of Algorithms
Question Paper Description : Text Version of 2007 Berhampur University M.Tech CSE Design and Analysis of Algorithms University Question Paper 2007
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)
or
a. Describe 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 method
or
a. Explain the greedy technique with Kuapsack problem as an example.
b. Explain the problem 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.
or
a. Describe merge sort algorithm using Divide-and-conquer strategy.
b. Explain how the above merge sort algorithm sorts the following lost or numbers 5,8,6,3,7,2.
4.a. Describe NP-Hard problem with suitable example.
b. Explain the difference between NP-Hard and NP-Complete problem.
or
a. State and prove Cook's theorem.
University Name : Berhampur University
Department : M.Tech Computer Science
Question Paper Code: Not Applicable
Exam Year : 2007
Subject Name of Question Paper: Design and Analysis of Algorithms
Question Paper Description : Text Version of 2007 Berhampur University M.Tech CSE Design and Analysis of Algorithms University Question Paper 2007
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)
or
a. Describe 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 method
or
a. Explain the greedy technique with Kuapsack problem as an example.
b. Explain the problem 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.
or
a. Describe merge sort algorithm using Divide-and-conquer strategy.
b. Explain how the above merge sort algorithm sorts the following lost or numbers 5,8,6,3,7,2.
4.a. Describe NP-Hard problem with suitable example.
b. Explain the difference between NP-Hard and NP-Complete problem.
or
a. State and prove Cook's theorem.
0 comments:
Pen down your valuable important comments below