Scribd
Upload
53 views3 pages

Assignment 3

This document presents 6 case studies related to algorithms and data structures. The case studies involve applying algorithms like the knapsack problem, traveling salesman problem, and subset sum problem to optimize supply chain planning, detect plagiarism, plan routes for autonomous vehicles, allocate resources for space missions, optimize school bus routing, and allocate resources to projects under budget constraints. The goal is to use algorithms and data structures to solve real-world optimization problems in domains like logistics, transportation, resource allocation, and more. Learners are asked to describe the algorithmic approaches that could be applied to balance objectives and find efficient solutions in each case study scenario.

Uploaded by

janvimalhotraofficial
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
53 views3 pages

Assignment 3

This document presents 6 case studies related to algorithms and data structures. The case studies involve applying algorithms like the knapsack problem, traveling salesman problem, and subset sum problem to optimize supply chain planning, detect plagiarism, plan routes for autonomous vehicles, allocate resources for space missions, optimize school bus routing, and allocate resources to projects under budget constraints. The goal is to use algorithms and data structures to solve real-world optimization problems in domains like logistics, transportation, resource allocation, and more. Learners are asked to describe the algorithmic approaches that could be applied to balance objectives and find efficient solutions in each case study scenario.

Uploaded by

janvimalhotraofficial
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/ 3

Design and Analysis of Algorithm with Lab

21CSH-311/21ITH-311
Assignment-3
SET-1 (Attempt any 2 Case Studies)

S Questions CO
No.
1. Case Study 1: Multi-Objective Supply Chain Planning CO5
Background:

You are responsible for supply chain planning in a


manufacturing company. You have a range of suppliers, each
offering products with varying costs, lead times, and qualities.
The company aims to optimize its supply chain based on cost,
lead time, and product quality simultaneously.

Case Study Question: How would you approach the


Knapsack Problem in the context of multi-objective supply
chain planning? Explain the algorithmic approach to balance
cost, lead time, and quality when selecting suppliers and
products to maximize supply chain efficiency.

2. Case Study 2: Plagiarism Detection in Academic Papers CO5


Background:
You are a software engineer working with an educational
institution that wants to implement an automated plagiarism
detection system to ensure the integrity of academic work
submitted by students. The institution receives a large number
of essays, research papers, and assignments regularly, and it
needs to identify any instances of plagiarism accurately and
efficiently.
Case Study Question: The challenge is to design an algorithm
that can detect similarities between submitted documents and
existing academic sources, potentially from the internet or the
institution's own database. The goal is to ensure that students'
work is original and properly cited.
3. CO5
Case Study 3: Dynamic Route Planning for Autonomous
Vehicles
Background:
You are part of a team developing autonomous vehicles for a
ride-sharing service. The vehicles must continuously adapt
their routes to efficiently pick up and drop off passengers
while avoiding traffic congestion and ensuring passenger
safety.
Case Study Question: Describe how you would design an
algorithm to dynamically plan routes for autonomous vehicles,
considering real-time traffic data and passenger requests.
Discuss the data structures, heuristics, and optimization
techniques you would use to ensure efficient route planning.

SET-2 (Attempt any 2 Case Studies)


S Questions CO
No.
1. Case Study 1: Resource Allocation in Space Missions CO5
Background:

Imagine you work for a space agency planning a mission to a


distant planet. The spacecraft has limited payload capacity and
various scientific instruments, each with different weights and
scientific importance. The goal is to maximize the scientific
return of the mission by selecting the most valuable
instruments while staying within the payload limit.

Case Study Question: How would you apply the Knapsack


Problem to select the scientific instruments for the spacecraft,
considering payload capacity, scientific value, and instrument
weights? Explain the algorithmic approach and how it helps
optimize resource allocation for the mission.
2. Case Study 2: School Bus Routing for Rural Students C05
Background:

A school district serves students residing in rural areas. The


goal is to optimize the routes of school buses to pick up and
drop off students while minimizing travel time, fuel costs, and
ensuring that students are not on the bus for an excessive
duration.

Case Study Question: How can the Traveling Salesman


Problem be used to optimize the bus routes for rural students?
Explain the algorithmic approach and its application to provide
efficient and cost-effective transportation for students.

3. Case Study 3: Subset Sum Problem for Resource C05


Allocation
Background: The Subset Sum problem is a well-known
combinatorial optimization problem that involves finding a
subset of a given set of numbers whose sum matches a target
value. This problem has applications in resource allocation,
budgeting, and decision-making scenarios.

Case Study Question: You are working for a project


management company, and you need to allocate resources to
various projects while adhering to budget constraints. The goal
is to determine the most efficient allocation of resources to
meet project requirements while staying within budget.

You might also like