Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

please help me to write the body of the functions below (the photos below!! please use the function find_bridges_in_radius to write the body of map_route

please help me to write the body of the functions below (the photos below!! please use the function find_bridges_in_radius to write the body of map_route

################################################################################ # Begin constants ################################################################################ COLUMN_ID = 0 COLUMN_NAME = 1 COLUMN_HIGHWAY = 2 COLUMN_LAT = 3 COLUMN_LON = 4 COLUMN_YEAR_BUILT = 5 COLUMN_LAST_MAJOR_REHAB = 6 COLUMN_LAST_MINOR_REHAB = 7 COLUMN_NUM_SPANS = 8 COLUMN_SPAN_DETAILS = 9 COLUMN_DECK_LENGTH = 10 COLUMN_LAST_INSPECTED = 11 COLUMN_BCI = 12

INDEX_BCI_YEARS = 0 INDEX_BCI_SCORES = 1 MISSING_BCI = -1.0

EARTH_RADIUS = 6371

################################################################################ # Sample data for docstring examples ################################################################################ def create_example_bridge_1() -> list: """Return a bridge in our list-format to use for doctest examples.

This bridge is the same as the bridge from row 3 of the dataset. """

return [ 1, 'Highway 24 Underpass at Highway 403', '403', 43.167233, -80.275567, '1965', '2014', '2009', 4, [12.0, 19.0, 21.0, 12.0], 65.0, '04/13/2012', [['2013', '2012', '2011', '2010', '2009', '2008', '2007', '2006', '2005', '2004', '2003', '2002', '2001', '2000'], [MISSING_BCI, 72.3, MISSING_BCI, 69.5, MISSING_BCI, 70.0, MISSING_BCI, 70.3, MISSING_BCI, 70.5, MISSING_BCI, 70.7, 72.9, MISSING_BCI]] ]

def create_example_bridge_2() -> list: """Return a bridge in our list-format to use for doctest examples.

This bridge is the same as the bridge from row 4 of the dataset. """

return [ 2, 'WEST STREET UNDERPASS', '403', 43.164531, -80.251582, '1963', '2014', '2007', 4, [12.2, 18.0, 18.0, 12.2], 61.0, '04/13/2012', [['2013', '2012', '2011', '2010', '2009', '2008', '2007', '2006', '2005', '2004', '2003', '2002', '2001', '2000'], [MISSING_BCI, 71.5, MISSING_BCI, 68.1, MISSING_BCI, 69.0, MISSING_BCI, 69.4, MISSING_BCI, 69.4, MISSING_BCI, 70.3, 73.3, MISSING_BCI]] ]

def create_example_bridge_3() -> list: """Return a bridge in our list-format to use for doctest examples.

This bridge is the same as the bridge from row 33 of the dataset. """

return [ 3, 'STOKES RIVER BRIDGE', '6', 45.036739, -81.33579, '1958', '2013', '', 1, [16.0], 18.4, '08/28/2013', [['2013', '2012', '2011', '2010', '2009', '2008', '2007', '2006', '2005', '2004', '2003', '2002', '2001', '2000'], [85.1, MISSING_BCI, 67.8, MISSING_BCI, 67.4, MISSING_BCI, 69.2, 70.0, 70.5, MISSING_BCI, 75.1, MISSING_BCI, 90.1, MISSING_BCI]] ]

def create_example_bridges() -> List[list]: """Return a list containing three unique example bridges.

The bridges contained in the list are from row 3, 4, and 33 of the dataset (in that order). """ return [ create_example_bridge_1(), create_example_bridge_2(), create_example_bridge_3() ]

################################################################################ # Helper function ################################################################################ def calculate_distance(lat1: float, lon1: float, lat2: float, lon2: float) -> float: """Return the distance in kilometers between the two locations defined by (lat1, lon1) and (lat2, lon2), rounded to the nearest meter.

>>> calculate_distance(43.659777, -79.397383, 43.657129, -79.399439) 0.338 >>> calculate_distance(43.42, -79.24, 53.32, -113.30) 2713.226 """

# This function uses the haversine function to find the # distance between two locations. You do NOT need to understand why it # works. You will just need to call on the function and work with what it # returns. # Based on code at goo.gl/JrPG4j

# convert decimal degrees to radians lon1, lat1, lon2, lat2 = (math.radians(lon1), math.radians(lat1), math.radians(lon2), math.radians(lat2))

# haversine formula t lon_diff = lon2 - lon1 lat_diff = lat2 - lat1 a = (math.sin(lat_diff / 2) ** 2 + math.cos(lat1) * math.cos(lat2) * math.sin(lon_diff / 2) ** 2) c = 2 * math.asin(math.sqrt(a))

return round(c * EARTH_RADIUS, 3)

def find_bridge_by_id(bridges: List[list], bridge_id: int) -> list: """Return the data for the bridge with id bridge_id from bridges.

If there is no bridge with the given id in bridges, then return an empty list.

>>> example_bridges = create_example_bridges() >>> find_bridge_by_id(example_bridges, 4) [] >>> find_bridge_by_id(example_bridges, 2) == create_example_bridge_2() True """ if bridge_id == 1: return create_example_bridge_1() elif bridge_id == 2: return create_example_bridge_2() elif bridge_id == 3: return create_example_bridge_3() else: return [] example_bridges = create_example_bridges()

def find_bridges_in_radius(bridges: List[list], lat: float, lon: float, radius: int, exclusions: List[int]) -> List[int]: """Return the IDs of the bridges that are within radius kilometres from location (lat, lon). Include bridge IDs that are exactly radius kilometres away. The bridge IDs in exclusions are not included in the result.

Preconditions: - (lat, lon) is a valid location on Earth - radius > 0

>>> example_bridges = create_example_bridges() >>> find_bridges_in_radius(example_bridges, 43.10, -80.15, 50, []) [1, 2] >>> find_bridges_in_radius(example_bridges, 43.10, -80.15, 50, [1, 2]) [] """ found_bridges_in_radius = [] for bridge in bridges: bridge_id = bridge[COLUMN_ID] #while bridge_id not in exclusions: if bridge_id in exclusions: continue lat_bridge = bridge[COLUMN_LAT] lon_bridge = bridge[COLUMN_LON] distance = calculate_distance(lat_bridge, lon_bridge, lat, lon) if distance

image text in transcribed

image text in transcribedimage text in transcribed

def inspect_bridge (bridges: List[list], bridge_id: int, date: str, bci: float) -> None : *** Update the bridge in bridges with id bridge_id so that it is last inspected at the new date date and its most recent BCI score is bci in the year given by date. Precondition: bridges contains a bridge with id bridge_id - date is in the format "MM/DD/YYYY - 0.0 >> my_bridge = create_example_bridge_10 >>> inspect_bridge([my_bridge], 1, "02/14/2021', 71.9) >>> my_bridge [COLUMN_LAST_INSPECTED] 02/14/2021' >>> my_bridge [COLUMN_BCI][INDEX_BCI_YEARS] [O] 2021' >>> my_bridge [COLUMN_BCI] [INDEX_BCI_SCORES][@] 71.9 1 1 1 def find_worst_bci(bridges: List[list], bridge_ids: List[int]) -> int: "Return the bridge ID from bridge_ids of the bridge from bridges who has the lowest most recent BCI score. If there is a tie, return the bridge with the smaller bridge ID in bridges. Precondition: bridges contains the bridges with the ids in bridge_ids every bridge in bridges has at least one BCI score - the IDs in bridge_ids appear in increasing order >>> example_bridges = create_example_bridges() >>> find_worst_bci(example_bridges, [1, 2]) 2 >>> find_worst_bci(example_bridges, [1, 3]) 1 11 def map_route(bridges: List[list], lat: float, lon: float, max_bridges: int, radius: int) -> List[int]: ******Return the sequence of bridge IDs from bridges that must be visited by an inspector who initially starts at location (lat, lon). The sequence must contain at most max_bridges IDs. Every ID in the sequence must be unique; an inspector cannot inspect the same bridge twice. The inspector visits the bridge within radius of their location that has the lowest most recent BCI score. The next bridge inspected is the bridge with the lowest most recent BCI score within radius radius of the last bridge's location. This step repeats until max_bridges bridges have been inspected, or there are no bridges to inspect within radius. >>> example_bridges = create_example_bridges() >>> map_route (example_bridges, 43.10, -80.15, 3, 50) [2, 1] >>> map_route (example_bridges, 43.1, -80.5, 30, 10) []

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Modern Database Management

Authors: Heikki Topi, Jeffrey A Hoffer, Ramesh Venkataraman

13th Edition

0134773659, 978-0134773650

More Books

Students also viewed these Databases questions

Question

=+Are you married?

Answered: 1 week ago

Question

What is Constitution, Political System and Public Policy? In India

Answered: 1 week ago

Question

What is Environment and Ecology? Explain with examples

Answered: 1 week ago