Problem 2: Outlet Service Planning A new restaurant is opening in Egypt. Therefore, the owners will open a few outlets to better service their customers, through reduced time of delivery. After building these outlets, the owners would like to create an algorithm that shows the responsibility area of each outlet. This map will help in addressing the requests to the nearest outlet, for faster delivery. Therefore, given a map of .' representing a neighborhood which outlets could serve, '#' representing blocks could not be served, and a letter representing the outlet, you need to output the map based on the distance. Specifications: • Each outlet has its own ID; typically it should be an alphabet like A or B • A delivery man from an outlet can move either up, down, left, or right. Because these blocks represents an area with roads, we cannot move diagonally. • There are uncovered area represented by #' where the delivery man cannot move there. • If a particular outlet can serve a covered block .' first, mark it with its ID • If more than one outlet could serve that block, mark it with the IDs of the outlets concatenated. Input: you are given a matrix M whose entries consists of the symbols .', #', or the outlet ID Output: return the map, R, after filling the covered blocks, .', with the outlet ID that can serves this block according to the above specifications. Leave it . if no outlet can serve it. Example: Input: M = The procedures of our algorithm: %23 • 23
Problem 2: Outlet Service Planning A new restaurant is opening in Egypt. Therefore, the owners will open a few outlets to better service their customers, through reduced time of delivery. After building these outlets, the owners would like to create an algorithm that shows the responsibility area of each outlet. This map will help in addressing the requests to the nearest outlet, for faster delivery. Therefore, given a map of .' representing a neighborhood which outlets could serve, '#' representing blocks could not be served, and a letter representing the outlet, you need to output the map based on the distance. Specifications: • Each outlet has its own ID; typically it should be an alphabet like A or B • A delivery man from an outlet can move either up, down, left, or right. Because these blocks represents an area with roads, we cannot move diagonally. • There are uncovered area represented by #' where the delivery man cannot move there. • If a particular outlet can serve a covered block .' first, mark it with its ID • If more than one outlet could serve that block, mark it with the IDs of the outlets concatenated. Input: you are given a matrix M whose entries consists of the symbols .', #', or the outlet ID Output: return the map, R, after filling the covered blocks, .', with the outlet ID that can serves this block according to the above specifications. Leave it . if no outlet can serve it. Example: Input: M = The procedures of our algorithm: %23 • 23
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
100%
Transcribed Image Text:Problem 2: Outlet Service Planning
A new restaurant is opening in Egypt. Therefore, the owners will open a few outlets
to better service their customers, through reduced time of delivery. After building these
outlets, the owners would like to create an algorithm that shows the responsibility area
of each outlet. This map will help in addressing the requests to the nearest outlet, for
faster delivery.
Therefore, given a map of .' representing a neighborhood which outlets could serve, #
representing blocks could not be served, and a letter representing the outlet, you need to
output the map based on the distance.
Specifications:
Each outlet has its own ID; typically it should be an alphabet like A or B
• A delivery man from an outlet can move either up, down, left, or right. Because
these blocks represents an area with roads, we cannot move diagonally.
• There are uncovered area represented by #' where the delivery man cannot move
there.
• If a particular outlet can serve a covered block .' first, mark it with its ID
• If more than one outlet could serve that block, mark it with the IDs of the outlets
concatenated.
Input:
you are given a matrix M whose entries consists of the symbols .', #', or the
outlet ID
Output:
return the map, R, after filling the covered blocks, .', with the outlet ID that can
serves this block according to the above specifications. Leave it . if no outlet can
serve it.
Example:
Input:
M =
B
The procedures of our algorithm:
%23
Transcribed Image Text:(a)
|A
A #
B
в в
(b)
A A . #
A # B B
# в в В
в в
(c)
A A AB
A # B
# B
23
В
B
B
В
(d)
A A АВ #
A #
# B
|в в в в
B
B
B
Output: hence, the output of your algorithms is just the same matrix as below
A A AB #
A # B
B
R =
# B
B B
B
B
B
B
Requirements:
1. develop a python function that implements the required algorithm.
2. empirically, test your functions while increasing the matrix size.
3. show the complexity analysis of your developed functions, theoretically.
B.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY