Scribd
Upload
4 views

DAA-Assignment 2-15.4.25

This document is an assignment for the Design and Analysis of Algorithms course at SRM Institute of Science and Technology for the academic year 2024-2025. It includes two questions: one differentiating between Branch and Bound and Backtracking, and another applying the Branch and Bound method to solve a 0/1 Knapsack Problem with specified package weights and profits. The assignment aims to assess students' understanding of algorithm design and optimization techniques.

Uploaded by

ecapslens3
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
4 views

DAA-Assignment 2-15.4.25

This document is an assignment for the Design and Analysis of Algorithms course at SRM Institute of Science and Technology for the academic year 2024-2025. It includes two questions: one differentiating between Branch and Bound and Backtracking, and another applying the Branch and Bound method to solve a 0/1 Knapsack Problem with specified package weights and profits. The assignment aims to assess students' understanding of algorithm design and optimization techniques.

Uploaded by

ecapslens3
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/ 1

(TIENNAI RAAPTR)

SRM INSTITUTE OF SCIENCE AND TECHNOLOGY


O SRM FACULTY OF ENGINEERING AND TECHNOLOGY
TUN
S00

DEPARTMENTOF COMPUTER SCIENCE AND ENGINEERING


ACADEMIC YEAR 2024-2025 (EVEN SEMESTER)

ASSIGNMENT-2
SubCodelSub Name: 21CSC204J/Design and Analysis of Algorithms
Year/Sem/Dept :II Year/ IV /B.Tech
QUESTIONS

Q.No. Questions Marks CO BL PI

1 Differentiate Branch and Bound and


5 4 1.3.1
Backtracking with valid points
2 A delivery company wants to select the best
combination of packages to load onto a delivery
truck. The truck has a maximum weight
capacity of 15 kg. The company has the
following 5 packages available:

Package Weight (kg) Profit (S)


40
B 5 100
10 4 3 2.7.2
C 10 120
D 3 60

4 95

Using the Branch and Bound approach to solve


the 0/1 Knapsack Problem, determine:
i) Which packages should be selected to
maximize the profit without exceeing the weight
limit?
ii) What is the maximum profit that can be
achieved?

Prepared by Coufse Codrdinator

You might also like