Scribd
Upload
30 views2 pages

DAA - Theory Assignment 3

(1) The document provides 13 theory questions related to greedy and dynamic programming algorithmic strategies. Specifically, it asks students to explain greedy strategies with examples, solve knapsack problems using greedy methods, discuss greedy job scheduling algorithms and their time complexity, and apply greedy approaches to activity selection problems. (2) It also asks students to explain dynamic programming principles and time analysis with examples, solve matrix chain multiplication and optimal binary search tree problems using dynamic programming, and compare the greedy and dynamic programming approaches for solving knapsack problems. Students are expected to provide algorithms and optimal solutions for the various problems.

Uploaded by

djalok190109
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
30 views2 pages

DAA - Theory Assignment 3

(1) The document provides 13 theory questions related to greedy and dynamic programming algorithmic strategies. Specifically, it asks students to explain greedy strategies with examples, solve knapsack problems using greedy methods, discuss greedy job scheduling algorithms and their time complexity, and apply greedy approaches to activity selection problems. (2) It also asks students to explain dynamic programming principles and time analysis with examples, solve matrix chain multiplication and optimal binary search tree problems using dynamic programming, and compare the greedy and dynamic programming approaches for solving knapsack problems. Students are expected to provide algorithms and optimal solutions for the various problems.

Uploaded by

djalok190109
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Sinhgad Technical Education Society’s

SINHGAD INSTITUTE OF TECHNOLOGY, LONAVALA


(Affiliated to Savitribai Phule Pune University and Approved by AICTE, New Delhi)
Accredited by NAAC with Grade “A”
Department of Computer Engineering

Design and Analysis of Algorithms

UNIT - III: Greedy and Dynamic Programming algorithmic Strategy

Theory Questions

Sr. No. Questions Marks


1. Explain Greedy strategy: Principle, control abstraction, time analysis of 8
control abstraction with suitable example.
2. Consider following instance for simple knapsack problem. Find the solution 8
using greedy method.
N = 8, P = {11, 21, 31, 33, 43, 53, 55, 65},
W = {1, 11, 21, 23, 33, 43, 45, 55}, M = 110
3. Discuss a specific Greedy algorithm used to solve the Job Scheduling 7
problem and its time complexity.
4. Find the correct sequence for jobs that maximizes profit using following 7
instances,
JobID(1, 2, 3, 4, 5),
Deadline(2, 1, 2, 1, 3) and
Profit(100, 19, 27, 25, 15).
5. Provide an example scenario and demonstrate how the Greedy approach can 7
be applied to solve the Activity Selection problem.
6. Consider the following instances of knapsack problem 7
n = 3, (w1, w2, w3) = (10, 20, 30), (p1, p2, p3) = (60, 100, 120) and M = 50.
Find the optimal solution using Greedy approach.
7. Explain Dynamic programming: Principle, control abstraction, time 8
analysis of control abstraction with suitable example.
8. Solve the matrix chain multiplication for the following 6 matrix problem 10
using Dynamic programming.

9. Write an algorithm for matrix multiplication using dynamic programming. 7


10. Explain the ‘dynamic programming’ approach for solving problems. Write 10
a dynamic programming algorithm for creating an optimal binary search
tree for a set of ‘n’ keys. Use the same algorithm to construct the optimal
binary search tree for the following 4 keys.

Dept Tel. : +91 2114-673490, 491 Office : 02114-673355, 356 Email : [email protected] Website : sit.sinhgad.edu
Sinhgad Technical Education Society’s
SINHGAD INSTITUTE OF TECHNOLOGY, LONAVALA
(Affiliated to Savitribai Phule Pune University and Approved by AICTE, New Delhi)
Accredited by NAAC with Grade “A”
Department of Computer Engineering

11. Discuss the Dynamic Programming approach to finding an optimal solution 7


for OBST.
12. Consider a knapsack instance 7
n = 3, (w1, w2, w3) = (2, 3, 4), (p1, p2, p3) = (1, 2, 5) and M = 6.
Find the optimal solution using dynamic programming.
13. Explain how the Greedy approach and the Dynamic Programming approach 7
differ in solving the Knapsack Problem.
14. Describe a Dynamic Programming approach to efficiently calculate binomial 7
coefficients.

Course In charge:
Ms. Rupali S. Shishupal

Dept Tel. : +91 2114-673490, 491 Office : 02114-673355, 356 Email : [email protected] Website : sit.sinhgad.edu

You might also like