LAB RESTRICTIONS, PLEASE READ: Do not add any imports, the ones that you need will be given to you. Do not use recursion. Do not use break/continue. Do not use try-except statements, you should be able to anticipate or prevent any errors from happening at all!
LAB RESTRICTIONS, PLEASE READ: Do not add any imports, the ones that you need will be given to you. Do not use recursion. Do not use break/continue. Do not use try-except statements, you should be able to anticipate or prevent any errors from happening at all!
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
DO NOT COPY PASTE THE ANSWER YOU FIND ON GOOGLE, IT IS INCORRECT!
MAKE SURE TO USE THE INPUTS IN THE SECOND PICTURE FOR TESTING.
![LAB RESTRICTIONS, PLEASE READ:
Do not add any imports, the ones that you need will be given to you.
- Do not use recursion.
- Do not use break/continue.
Do not use try-except statements, you should be able to anticipate
or prevent any errors from happening at all!
IL I| ||
def cost_to_hike_naive(m: list[list[int]], start_point: tuple[int, int],
end_point: tuple[int, int]) -> int:
IL || ||
Given an elevation map <m> and a start and end point, calculate the cost it
would take to hike from <start_point> to <end_point>. If the start and end
points are the same, then return 0.
Some definitions and rules:
1. You can only hike to either a vertically or horizontally adjacent
location (you cannot travel diagonally).
2. You must only travel in the direction of the <end_point>. More
explicitly, this means that any move yOu make MUST take you closer
to the end point, so you cannot travel in the other direction.
3. We define the cost to travel between two adjacent blocks as the
absolute difference in elevation between those blocks.
4. You will calculate the naive route here, so at every position, you
will have two choices, to either move closer to the end point along
a row, or along a column, and you will chose the position that costs
the least at that point (you do not need to look ahead to see if the
costlier route now will result in an overall cheaper route).
5. If two choices along the route have the exact same cost, you will
choose the direction that comes first clockwise. For example, yoU
will choose to move horizontally right before vertically down,
vertically down before horizontally left, horizontally left before
vertically up, and vertically up before horizontally right.
Preconditions:
the start and end points will be a valid position on the map.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F7345dbf4-e1f2-469e-892e-6f40faaa81dd%2F19a55779-17c6-44bc-a828-c4fbb5dc55b9%2Fbak69a_processed.png&w=3840&q=75)
Transcribed Image Text:LAB RESTRICTIONS, PLEASE READ:
Do not add any imports, the ones that you need will be given to you.
- Do not use recursion.
- Do not use break/continue.
Do not use try-except statements, you should be able to anticipate
or prevent any errors from happening at all!
IL I| ||
def cost_to_hike_naive(m: list[list[int]], start_point: tuple[int, int],
end_point: tuple[int, int]) -> int:
IL || ||
Given an elevation map <m> and a start and end point, calculate the cost it
would take to hike from <start_point> to <end_point>. If the start and end
points are the same, then return 0.
Some definitions and rules:
1. You can only hike to either a vertically or horizontally adjacent
location (you cannot travel diagonally).
2. You must only travel in the direction of the <end_point>. More
explicitly, this means that any move yOu make MUST take you closer
to the end point, so you cannot travel in the other direction.
3. We define the cost to travel between two adjacent blocks as the
absolute difference in elevation between those blocks.
4. You will calculate the naive route here, so at every position, you
will have two choices, to either move closer to the end point along
a row, or along a column, and you will chose the position that costs
the least at that point (you do not need to look ahead to see if the
costlier route now will result in an overall cheaper route).
5. If two choices along the route have the exact same cost, you will
choose the direction that comes first clockwise. For example, yoU
will choose to move horizontally right before vertically down,
vertically down before horizontally left, horizontally left before
vertically up, and vertically up before horizontally right.
Preconditions:
the start and end points will be a valid position on the map.
![[[1, 3],
[0, 4]]
>>> cost_to_hike_naive(sample_map, (0, 0), (1, 1))
>>> sample_map
...
>>> cost_to_hike_naive(sample_map, (1, 1), (0, 0))
IL || ||](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F7345dbf4-e1f2-469e-892e-6f40faaa81dd%2F19a55779-17c6-44bc-a828-c4fbb5dc55b9%2Fn6h9nur_processed.png&w=3840&q=75)
Transcribed Image Text:[[1, 3],
[0, 4]]
>>> cost_to_hike_naive(sample_map, (0, 0), (1, 1))
>>> sample_map
...
>>> cost_to_hike_naive(sample_map, (1, 1), (0, 0))
IL || ||
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 3 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education