COURSE FILE INDEX

S. No Details
1 Vision, Mission of the institute and Department, along with PEOs
2 Course Descriptor (Prepared by Course Coordinator only)
3 Previous results and self-target for the present semester
4 Previous question papers along with answers
5 Academic Calendar
6 Student Roll List
7 Individual and Class Timetable
8 Session Planner
Class notes (Must Include the following in Unit Wise)
i. Lecture-wise Notes
ii. Bloom's Taxonomy (contains 5 levels of questions & answers)
iii. Question Bank (20 Short Answer Questions and 20 Descriptive Questions for
theoretical subjects, or 30 Descriptive/Analytical/Programming/Derivation
Questions for tutorial and programming-based courses for each unit.) along with
COs and Bloom's taxonomy levels
9 iv. 20 objective questions with answers include Gate questions (For Gate
subjects, mandatory of Gate questions)
v. 8-10 Unit-wise solved Tutorial Problems
vi. 5 Assignment Questions chapter-wise, along with Bloom's Levels and CO's mapping.
vii. 5 topics for tech talks/ PPT /concept video, etc. (selected for the course)
viii. Case Studies and Real-Life Examples
ix. Complex Engineering Problems Incorporating Sustainability Goals
x. SWAYAM/NPTEL/MOOC/Self Learning (provide 5 links for 5 different topics)
xi. Student seminar topics (if applicable)
xii. Two Micro Projects/certifications related to courses (If applicable)
Unit Wise Active Learning (activities)
Collaborative learning
Stump your partner
10 Muddiest point
Flipped classroom
Think pair and share
11 Unit Test question papers along with COs and Blooms Taxonomy Levels
MID-I and MID-II Exam schedules and Question Papers and Award list
12 (Slow learner identification and remedial action-
List of slow learners, Remedial class Timetable, Remedial Lecture Plan, Improvement
Analysis)
13 CO Attainment for MID-I With Micro Analysis
14 CO Attainment for MID-II With Micro Analysis
15 Final CO Attainment with Micro Analysis
16 Actions Taken Based on the Results of Evaluation of the COs, POs, and PSOs
17 Task table
18 Certificate
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

BLOOM'S TAXONOMY (CONTAINS 5 LEVELS OF QUESTIONS & ANSWERS)

UNIT-V

Admitted Batch 2023-24 Program / Semester B.Tech. V Sem

Regulation MLRS-R22 Branch CSE

DESIGN AND ANALYSIS OF
Course Name Course Code 2250511
ALGORITHMS

Course Faculty ALLIMALI Academic Year 2025-26

DURGABHAVANI
1. Remembering

Question:
What is the purpose of the Branch and Bound algorithm?

Answer:
The purpose of the Branch and Bound algorithm is to solve optimization problems (both minimization and
maximization) by systematically exploring branches of a solution space and eliminating those that cannot lead to an
optimal solution using bounds.

2. Understanding

Question:
Explain how bounding helps in the Branch and Bound algorithm.

Answer:
Bounding helps reduce the search space by estimating the best possible solution that can be obtained from a node. If the
bound is worse than the current best-known solution, the node (and its children) can be pruned, thus saving
computation time.
3. Applying

Question:
Given a 0/1 Knapsack problem with 3 items, apply the Branch and Bound method to find the optimal solution.

Answer (simplified):
Using Branch and Bound:

 We construct a state-space tree.

 At each node, we calculate an upper bound (e.g., using fractional knapsack).
 Nodes with bound < current best profit are pruned.
 Traverse until all promising nodes are explored.
 Select the path with the maximum profit within capacity.
(Detailed problem values would be required for full steps.)

4. Analyzing.

Question:
How does Branch and Bound differ from a brute-force approach in solving the Traveling Salesman Problem (TSP)?

Answer:
Branch and Bound avoids exploring all possible permutations by pruning subtrees that cannot produce better solutions,
based on cost estimates (bounds). In contrast, brute-force examines every possible route, which is computationally
expensive for large input sizes.

5. Evaluating

Question:
Evaluate the efficiency of the Branch and Bound algorithm in comparison to dynamic programming for the Knapsack
problem.

Answer:
Branch and Bound is more efficient when the problem allows early pruning, especially in sparse or low-dimensional
solution spaces. However, dynamic programming guarantees polynomial-time solutions for bounded integer capacities
and is often more predictable in runtime. Branch and Bound can outperform DP when pruning is highly effective.
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Question Bank (20 Short Answer Questions And 20 Descriptive Questions Along With Cos And
Bloom's Taxonomy Levels

UNIT-V

Admitted Batch 2023-24 Program / Semester B.Tech. V Sem

Regulation MLRS-R22 Branch CSE

DESIGN AND ANALYSIS OF
Course Name Course Code 2250511
ALGORITHMS

Course Faculty ALLIMALI Academic Year 2025-26

DURGABHAVANI

PART-A
Short Answer Questions
(1-Mark Questions)
Course Bloom’s
S.NO QUESTION Outcome Taxonomy
1 What is the main strategy used in Branch and Bound? CO5 Remembering
2 What is a bounding function? CO5 Remembering
3 Define a state space tree in Branch and Bound. CO5 Remembering
4 What is a live node in the context of Branch and Bound? CO5 Understanding
5 What is a dead node in the context of Branch and Bound? CO5 Remembering
6 How is the Travelling Salesman Problem solved using Branch and Bound? CO5 Remembering
7 What does LC in LC Branch and Bound stand for? CO5 Remembering
How does Branch and Bound differ from Greedy algorithms?
8 CO5 Understanding
9 What data structure is commonly used in LC Branch and Bound? CO5 Remembering
Give one real-life application of Branch and Bound.
10 CO5 Understanding
Compare the time complexity of Branch and Bound with other exhaustive
11 CO5 Understanding
methods.
Analyze why Branch and Bound is better than brute force in optimization.
12 CO5 Understanding
 Evaluate the effectiveness of Branch and Bound in solving NP-Hard
13 CO5 Remembering
14 Justify the use of least cost (LC) strategy in Branch and Bound. CO5 Remembering
Explain the concept of live nodes and E-nodes in Branch and Bound
15 CO5 Remembering
16 Identify scenarios where Branch and Bound is inefficient. CO5 Understanding
17 Write a pseudocode for solving job sequencing using Branch and Bound. CO5 Remembering
18 Solve a simple 0/1 Knapsack problem using Branch and Bound manually. CO5 Understanding
Modify Branch and Bound to include heuristics for better performance.
19 CO5 Evaluating
Formulate a real-life scheduling problem using Branch and Bound.
20 CO5 Remembering

PART-B
Descriptive Questions
(5-Marks Questions)
Course Bloom’s
S.NO QUESTION Outcome Taxonomy

Explain the principle of Branch and Bound and how it differs from the
1 CO5 Understanding
Backtracking approach.
Describe the structure and components of a Branch and Bound tree with an
2 CO5 Understanding
example..
Illustrate how bounding functions help in pruning the search space in Branch and
3 CO5 Analyzing
Bound..
Compare FIFO, LIFO, and LC strategies used in Branch and Bound.
4 CO5 Understanding
Derive a bounding function for the 0/1 Knapsack problem using Branch and
5 CO5 Applying
Bound..
Write and explain the steps of solving a Travelling Salesman Problem using
6 CO5 Applying
Branch and Bound.
Develop a Branch and Bound algorithm to solve the Job Sequencing with
7 CO5 Understanding
deadlines problem.
Discuss how Branch and Bound can be applied to solve the Sum of Subsets
8 CO5 Applying
problem.
9 Design a state space tree for solving an instance of the 8-Queen problem using CO5 Analyzing
Branch and Bound.
Analyze the worst-case and best-case time complexity of Branch and Bound
10 CO5 Understanding
algorithms.
Evaluate the advantages and limitations of the Branch and Bound technique in
11 CO5 Understanding
solving large-scale problems.
Justify the importance of choosing a good bounding function in the efficiency of
12 Branch and Bound.
CO5 Applying
Explain the difference between live nodes, E-nodes, and dead nodes with a
13 CO5 Understanding
suitable example.
Identify real-world applications where Branch and Bound is a suitable approach
14 CO5 Evaluating
and explain why?
15 Modify the traditional Branch and Bound to integrate heuristic information for CO5 Applying
 faster convergence..
Discuss the role of cost functions in LC Branch and Bound for optimization
16 CO5 Understanding
problems.
Discuss the role of cost functions in LC Branch and Bound for optimization
17 CO5 Applying
problems.
Formulate a real-world optimization scenario that can be solved using Branch and
18 CO5 Evaluating
Bound.
Critically assess why Branch and Bound fails to perform efficiently in high-
19 CO5 Understanding
dimensional problems.
Explain how Branch and Bound fits into solving NP-Hard problems and the
20 CO5 Applying
limitations therein.

Signature of Faculty Signature of Course Coordinator

Signature of HOD Signature of Dean Academics

 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

ASSIGNMENT QUESTIONS
UNIT-V
Admitted Batch 2023-24 Program / B.Tech. V Sem
Semester
Regulation MLRS-R22 Branch CSE
DESIGN AND ANALYSIS OF
Course Name Course Code 2250511
ALGORITHMS

Course Faculty ALLIMALLI Academic Year 2025-26

DURGABHAVANI

Course Bloom’s
S.No QUESTION Outcome Taxonomy
Implement a Branch and Bound algorithm for solving the 0/1 Knapsack
1 problem. Analyze its performance. CO5 Understand

Design a Branch and Bound solution to the Travelling Salesman Problem.

Explain how pruning reduces the search.. Apply
2 CO5

Compare the effectiveness of Branch and Bound with Backtracking and

3 Greedy methods for solving optimization problems.. CO5 Analyzing

Write a detailed report on the role of bounding functions in solving NP-Hard

problems using Branch and Bound..
4 CO5 Analyzing

Create a real-world scheduling problem (e.g., exam timetable, delivery

route) and solve it using Branch and Bound..
5 CO5 Evaluate
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
UNIT-V

CASE STUDIES AND REAL-LIFE EXAMPLES

Admitted Batch 2023-24 Program / B.Tech. V Sem
Semester
Regulation MLRS-R22 Branch CSE
DESIGN AND ANALYSIS OF
Course Name ALGORITHMS Course Code 2250511

Course Faculty ALLIMALLI Academic Year 2025-26

DURGABHAVANI

S.No Question /Topic/Details Type Complexity CO PO PSO

Real-Life Context: A courier company like
FedEx or Amazon Logistics uses TSP to find the Exploratory Medium CO5 3 1
1 most cost-efficient path to deliver packages to
multiple locations..
Real-Life Context: In cloud data centers (e.g.,
AWS or Google Cloud), multiple jobs must be Exploratory Medium CO5 2 1
2 scheduled on limited virtual machines to minimize
total processing time.
Real-Life Context: Airline cargo management
— selecting items (cargo) to be loaded into an Exploratory High CO5 4 2
3 aircraft without exceeding weight limits while
maximizing profit..
Real-Life Context: IT companies managing
multiple projects with limited team members or Descriptive High CO5 3 2
4 hardware resources.

Real-Life Context: Used in AI-based puzzle

5 solvers or game bots (e.g., for educational software Exploratory High CO5 3 2
or game apps).

Usage and Application

 Travelling Salesman Problem (TSP) in Logistics & Delivery

 Job Scheduling in Cloud Computing.
 Knapsack Problem in Cargo Loading
 Summary

The reliability design approach focuses on ensuring that systems, products, or components perform their intended function
without failure over a specified period under stated conditions. It is widely applied in engineering design, product development,
software engineering, electronic systems, automotive, aerospace, and manufacturing Reliability is the probability that a system or
component will perform its required functions without failure for a specified period of time under stated operating conditions
Note: Types of Case Studies – Purpose, Complexity Level, and Details
Type of Case Purpose Simple Explanation Complexity Details of Complexity
Study Level Level
To explore a topic Used when you don’t Involves forming
Exploratory where little is know much about the Moderate questions, identifying
known; ask “what is topic and want to learn issues, and initial analysis
happening?” more. (Apply, Analyze)
To describe in detail Focuses on documenting Involves observation,
Descriptive what is happening everything that happens Low to classification, and
in a particular case. Moderate reporting facts
(Remember, Understand)
To explain how and Looks at causes and Requires analyzing
Explanatory why something effects. High relationships, reasoning,
happens and drawing conclusions
(Analyze, Evaluate)
To study a unique or Focuses only on Demands deep
Intrinsic special case just for understanding a special Moderate understanding of one
its own interest case, not generalizing it. context and internal
dynamics (Understand,
Analyze)
To use one case to The case helps Applies the case to explore
Instrumental understand a bigger understand general High broader theoretical
issue concepts or theories. insights (Analyze,
Evaluate, Create)
To study several Compare multiple cases Requires synthesis and
Collective cases and compare to find patterns or High comparative analysis
(Multiple) them differences. across cases (Analyse,
Evaluate, create)
To study changes Track changes in the Observes evolution and
Longitudinal over time same case over months or High trends, requires long-term
years. thinking (Analyze over
time, Evaluate, Create)
Ethnographic To observe real-life Researcher spends time Involves immersion,
behavior and culture in the company to watch High cultural interpretation, and
from inside and learn how people narrative understanding
work and interact. (Analyze)
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

UNIT TEST-V

Admitted Batch 2023-24 Program / B. Tech. V Sem

Semester
Regulation MLRS-R22 Branch CSE
DESIGN AND ANALYSIS OF
Course Name ALGORITHMS Course Code 2250511

Course Faculty ALLIMALLI Academic Year 2025-26

DURGABHAVANI

Answer the following Questions 2*5=10M

Course Bloom’s
S.No QUESTION Outcome Taxonomy
Discuss in detail about Branch and Bound & LC Branch and Bound Solutions? CO5
1 Apply

Describe NP Complete and NP Hard Problems & Classes?

2 CO5 Understand
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

ACTIVE LEARNING

UNIT-V

Admitted Batch 2023-24 Program / B.Tech. V Sem

Semester
Regulation MLRS-R22 Branch CSE
DESIGN AND ANALYSIS OF
Course Name ALGORITHMS Course Code 2250511

Course Faculty ALLIMALLI Academic Year 2025-26

DURGABHAVANI
Activity name Muddiest Point Topic
No of Students Attended Date of ALP
Conducted

Group Roll Numbers Course Bloom’s

No QUESTION/TOPIC Outcome Taxonomy
1 Difference Between Backtracking and Branch and
Bound. CO5 Apply
Compare supervised and unsupervised learning with CO5
2 examples.
Understand
Describe the steps involved in designing a LC Branch & CO5
3 Bound .
Analyze
Demonstrate how Deterministic algorithm works using a CO5
4 simple dataset.
Apply

5 Analyze the FIFO Branch and Bound examples. CO5 Apply

Evaluate the Candidate Elimination algorithm and its CO5
6 convergence properties. Analyze
Explain the concept of inductive bias with respect to CO5
7 concept learning. Evaluate

8 Construct Cooks Theorem. CO5 Understand

9 Analyze the 0/1 Knapsack Problem in Branch and Bound CO5 Create

Note: Attach 2 geotag photos of the ALP Conducted

 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

SWAYAM / NPTEL / MOOC / SELF LEARNING

UNIT-V

Admitted Batch 2023-24 Program / B.Tech. V Sem

Semester
Regulation MLRS-R22 Branch CSE
DESIGN AND ANALYSIS OF
Course Name ALGORITHMS Course Code 2250511

Course Faculty ALLIMALLI Academic Year 2025-26

DURGABHAVANI

Details/Links of
S. No Topic Swayam/NPTEL/MOOCs/Self CO PO PSOs
Learning
1 General Method of Branch and bound NPTEL:
CO5 3 1
http://www.digimat.in/nptel/courses/video
/106106226/L17.html
2 O/1 Knapsack problem
NPTEL: CO5 3 1
https://onlinecourses.swayam2.ac.in/cec
20_cs03/preview
3 Swayam:
L C Branch and Bound CO5 2 1
https://www.geeksforgeeks.org/dsa/int
roduction-to-branch-and-bound
4 NON Deterministic Problem Coursera: Algorithms, Part I
CO5 4 2
(Deterministic )
5 Cooks Theorem NPTEL:
CO5 3 2
http://nptel.iit
m.ac.in
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

COMPLEX ENGINEERING PROBLEMS INCORPORATING SUSTAINABILITY GOALS

UNIT-V

Admitted Batch 2023-24 Program / B.Tech. V Sem

Semester
Regulation MLRS-R22 Branch CSE
DESIGN AND ANALYSIS OF
Course Name ALGORITHMS Course Code 2250511

Course Faculty ALLIMALLI Academic Year 2025-26

DURGABHAVANI

Course Bloom’s SDG

S.NO QUESTION Outcome Taxonomy
Define a complex engineering problem that can be solved CO5 Applying SDG 11 (Sustainable
using Branch and Bound and incorporates sustainability Cities &
1 goals. Communities), SDG
13 (Climate Action)
Explain how bounding functions in B&B can be CO5 Creating SDG 7 (Affordable
modified to include energy or emission and Clean Energy),
2 constraints. SDG 12 (Responsible
Consumption)
List three real-world engineering applications where CO5 Analyzing SDG 9 (Industry,
Branch and Bound can be applied with sustainability Innovation &
3 as a constraint. Infrastructure), SDG
12
How can you incorporate carbon emission factors in the CO5 Creating SDG 9, SDG 12,
4 objective function of a Branch and Bound problem?. SDG 13

Why is Branch and Bound suitable for multi-objective CO5 Applying SDG 11, SDG 13
5 optimization in sustainable systems?

Note:

For this only give from analyze and above level questions.
1. This includes Project based learning, problem-based learning, mini projects, integrated design projects, capstone
projects, hackathon or any other activity-based learning towards solving complex engineering problems targeting
relevant SDGs.
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

OBJECTIVE QUESTIONS AND ANSWERS

UNIT-V

Admitted Batch 2023-24 Program / B.Tech. V Sem

Semester
Regulation MLRS-R22 Branch CSE
DESIGN AND ANALYSIS OF
Course Name Course Code 2250511
ALGORITHMS

Course Faculty ALLIMALLI Academic Year 2025-26

DURGABHAVANI

1. Branch and Bound is primarily used to solve:

A. Non-optimization problems B. Decision problems
C. Optimization and search problems D. Only linear programming problems

2. Which of the following is NOT a component of the Branch and Bound method?
A. Branching B. Bounding C. Greedy selection D. Pruning

3. Which data structure is commonly used to implement Branch and Bound?

A. Queue B. Stack C. Priority Queue D. Linked List

4. The bounding function is used in Branch and Bound to:

A. Divide the problem B. Select the worst solution C. Eliminate non-promising solutions
D. Merge sub problems

5. Which problem is best solved using Branch and Bound?

A. Merge Sort B. Knapsack Problem (0/1) C. Binary Search D. Counting Sort

6. In the 0/1 Knapsack Problem using B&B, the upper bound is calculated using:
A. Greedy fraction approach B. Dynamic Programming
C. Brute Force D. Merge and Cut

7. Branch and Bound guarantees finding:

A. A feasible solution only B. An optimal solution
C. A heuristic solution D. A random solution

8. Which of the following problems can be solved using B&B?

A. Hamiltonian Cycle B. N-Queens
C. Traveling Salesman Problem D. All of the above
9. What is the best-case time complexity of Branch and Bound (in general)?
A. O(1) B. O(n²) C. O(2ⁿ) D. Depends on pruning

10. Pruning in Branch and Bound helps to:

A. Increase solution time B. Eliminate infeasible solutions
C. Eliminate optimal solutions D. Increase memory usage

11. Which node is explored next in Best-First Search B&B?

A. Node with the largest bound B. Node C. Random node D. Leaf node only

12. Which of the following strategies is used in Branch and Bound?

A. Divide and Conquer B. Dynamic Programming
C. Backtracking with Bounding D. Greedy Algorithm

13. In Branch and Bound, the 'live node' refers to:

A. Already explored node B. Node with the highest priority
C. Node that is yet to be explored D. Node that is discarded

14. In Branch and Bound, the root node corresponds to:

A. A solution node B. The final answer
C. A state with no decisions made D. The least promising solution

15. Which of the following increases the efficiency of Branch and Bound?
A. Better bounding functions B. Avoiding pruning
C. Using brute-force subproblems D. Expanding all nodes

16. Which of the following is a bounding strategy in TSP using Branch and Bound?
A. Lower bound using MST B. Upper bound using Dijkstra
C. Prune all leaf nodes D. Reverse traversal

17. Branch and Bound differs from Backtracking primarily in:

A. Use of recursion B. Elimination of promising paths
C. Use of bounding to prune the search space D. Memory usage

18. Which approach is used to handle fractional items in Knapsack within Branch and Bound?
A. Ignore them B. Add them greedily for bound calculation
C. Take them all D. Multiply profits

19. The node selected in a FIFO Branch and Bound corresponds to:
A. Best node B. Worst node C. Least cost node D. First generated node

20. In B&B applied to the N-Queens problem, which method is used to eliminate invalid configurations?
A. Random assignment B. Cost matrix C. Constraint checking D. Depth-first traversal
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Two Micro Projects/certifications related to courses (If applicable)

UNIT-V

Admitted Batch 2023-24 Program / B.Tech. V Sem

Semester
Regulation MLRS-R22 Branch CSE
DESIGN AND ANALYSIS OF
Course Name Course Code 2250511
ALGORITHMS

Course Faculty ALLIMALLI Academic Year 2025-26

DURGABHAVANI
Project 1:

Title: Optimization of Delivery Routes Using Branch and Bound

Objective:
To implement a Branch and Bound algorithm for solving the Travelling Salesman Problem (TSP) to optimize
delivery routes with minimal distance or cost.

Description:

Expected Outcome:

 Implementation of Branch and Bound algorithm for TSP.

 Visualization of optimal route.
 Comparison with greedy or brute-force methods.

Learning Outcome:

 Understanding of state space trees and pruning.

 Application of bounding techniques.
 Practical understanding of time complexity optimization.

Tools Used :  ython / C++ / Java , Visualization Library (e.g., matplotlib for Python)
 Project 2:

Title: Sustainable Resource Allocation in Cloud Computing using Branch and Bound

Objective:
To model and solve the Knapsack Problem using Branch and Bound in a cloud computing scenario to optimize
resource allocation.
Description:

You are given a set of tasks, each requiring a certain amount of resources (CPU, memory) and offering a certain profit.
The goal is to select tasks that maximize the profit without exceeding resource limits using Branch and Bound.

Expected Outcome:

 Efficient resource allocation strategy using Branch and Bound.

 Comparison with Dynamic Programming and Greedy methods.
 Graphs showing time and space analysis.

Learning Outcome:

 Ability to convert real-world cloud scenarios into algorithmic models.

 Deep understanding of how pruning reduces computational time.
 Sustainable computing considerations in algorithm design.

Tools Used:  Python / Java / C++,Optional: AWS Educate / GCP (simulation only)
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Seminar topics
UNIT-V

Admitted Batch 2023-24 Program / B.Tech. V Sem

Semester
Regulation MLRS-R22 Branch CSE
DESIGN AND ANALYSIS OF
Course Name Course Code 2250511
ALGORITHMS

Course Faculty ALLIMALLI Academic Year 2025-26

DURGABHAVANI

Course
Bloom’s
S.No Seminar Topic / Question Source Details Outcome PO PSO
Taxonomy
(CO)
Comparison with other
algorithmic strategies (like NPTEL Prof. Radha
greedy, dynamic Krishna, DAA Book CO3 Understand PO1, PO2, PSO1
1
programming, backtracking). PO12

Discussion on how B&B tackles

NP-hard problems. Apply
NPTEL DAACourse, PO2, PO3,
2 CO3 PSO1, PSO2
SlideShare Logic Modules PO5

PO1,
Discuss the State-space tree
DAA A Modern Approach, PO4,
3 construction for TSP. CO3 Analyze PO10 PSO2
Lecture Notes

Discuss Branch and Bound in

NPTEL, DAA Lab Apply PO2,
4 Resource-Constrained Scheduling CO3 PSO1
Manuals PO3

How To Optimizing Knapsack

Understand PO1,
5 Problem Using Branch and Bound NPTEL Book Ch. 2–4 CO3 PSO1
PO8