Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

these 2 cells please 5. Old Faithful yhour Old Faithful is a geyser in Yellowstone that rupts every 44 to 125 minutos (according to Wikipedia).

these 2 cells please image text in transcribed
image text in transcribed
5. Old Faithful yhour Old Faithful is a geyser in Yellowstone that rupts every 44 to 125 minutos (according to Wikipedia). People are often told that the governets overy h but in fact the waiting time between eruptions in more variable. Let's take a look, Question 1. The first line below assigns waiting times to an array of 272 consecutive walling times between eruptions, taken from a classic 1938 dataset Assign the names shortest, longest and average so that the print statoment is correct. in [] waiting times - Table.read_table 'old_faithful.csv').column('waiting') shortest - longest average print("old Faithful erupts every", shortest, "to, longest, minutes and every", average, adnutes on average.") Question 2. Assign biggest_decrease to the biggest decrease in waiting time between two consecutivo eruption. For example, the third eruption occurred after 74 minutes and the fourth after 2 minutes to the decrease in waiting time was 74-62 - 12 minutes Hint 1: You'll need an array arithmetic function mentioned in the textbook You have also seen this function earlier in the homework! Hint 2: We want to return the absolute value of the biggest decrease In [ ]:biggest_decrease .. biggest_decrease Trusted Python 3 O Edit View Insert Cell Kemel Help a + Run Markdown 5. Old Faithful Old Faithful is a geyser in Yellowstone that erupts every 44 to 125 minutes (according to Wikipedia). People are often told that the geyser erupts every hour. but in fact the waiting time between eruptions is more variable. Let's take a look. Question 1. The first line below assigns waiting times to an array of 272 consecutive waiting times between eruptions, taken from a classic 1938 dataset Assign the names shortest. longest and average so that the print statement is correct. En C): Mwaiting times - Table.read_table('old_faithful.csv').column('waiting') shortest - longest average ... print("old Faithful erupts every", shortest, "to", longest, minutes and every", average, "minutes on average. Question 2. Assign biggest_decrease to the biggest decrease in waiting time between two consecutivo eruptions. For example, the third eruption occurred utter 74 minutes and the fourth after 62 minutes, to the decrease in waiting time was 74 - 62 - 12 minutes, Hint 1: You'll need an array arithmetic function mentioned in the textbook. You have also seen this function earlier in the homework! Hint 2: We want to return the absolute value of the biggest decrease. In: biggest_decrease biggest_decrease Question 3. If you expected Old Faithful to erupt every hour, you would expect to wait a total of 60. k minutes to see k eruptions Set difference_from_expected to an array with 272 elements, where the element at index is the absoluto difference between the expected and actual total amount of waiting time to see the first 1+1 eruptions Hint You'll need to compare a cumulative sum to a range. You'll go through mp.orange more thoroughly in Lab 3, but you can read about it in this textbook section For example, since the first three waiting times are 79,54, and 74, the total waiting time for 3 eruptions is 70 54 74 207. The expected waiting time for 3 eruptions is 603 180. Therefore, difference_fron_expected. Item(2) should be 207 - 1801 - 27 5. Old Faithful yhour Old Faithful is a geyser in Yellowstone that rupts every 44 to 125 minutos (according to Wikipedia). People are often told that the governets overy h but in fact the waiting time between eruptions in more variable. Let's take a look, Question 1. The first line below assigns waiting times to an array of 272 consecutive walling times between eruptions, taken from a classic 1938 dataset Assign the names shortest, longest and average so that the print statoment is correct. in [] waiting times - Table.read_table 'old_faithful.csv').column('waiting') shortest - longest average print("old Faithful erupts every", shortest, "to, longest, minutes and every", average, adnutes on average.") Question 2. Assign biggest_decrease to the biggest decrease in waiting time between two consecutivo eruption. For example, the third eruption occurred after 74 minutes and the fourth after 2 minutes to the decrease in waiting time was 74-62 - 12 minutes Hint 1: You'll need an array arithmetic function mentioned in the textbook You have also seen this function earlier in the homework! Hint 2: We want to return the absolute value of the biggest decrease In [ ]:biggest_decrease .. biggest_decrease Trusted Python 3 O Edit View Insert Cell Kemel Help a + Run Markdown 5. Old Faithful Old Faithful is a geyser in Yellowstone that erupts every 44 to 125 minutes (according to Wikipedia). People are often told that the geyser erupts every hour. but in fact the waiting time between eruptions is more variable. Let's take a look. Question 1. The first line below assigns waiting times to an array of 272 consecutive waiting times between eruptions, taken from a classic 1938 dataset Assign the names shortest. longest and average so that the print statement is correct. En C): Mwaiting times - Table.read_table('old_faithful.csv').column('waiting') shortest - longest average ... print("old Faithful erupts every", shortest, "to", longest, minutes and every", average, "minutes on average. Question 2. Assign biggest_decrease to the biggest decrease in waiting time between two consecutivo eruptions. For example, the third eruption occurred utter 74 minutes and the fourth after 62 minutes, to the decrease in waiting time was 74 - 62 - 12 minutes, Hint 1: You'll need an array arithmetic function mentioned in the textbook. You have also seen this function earlier in the homework! Hint 2: We want to return the absolute value of the biggest decrease. In: biggest_decrease biggest_decrease Question 3. If you expected Old Faithful to erupt every hour, you would expect to wait a total of 60. k minutes to see k eruptions Set difference_from_expected to an array with 272 elements, where the element at index is the absoluto difference between the expected and actual total amount of waiting time to see the first 1+1 eruptions Hint You'll need to compare a cumulative sum to a range. You'll go through mp.orange more thoroughly in Lab 3, but you can read about it in this textbook section For example, since the first three waiting times are 79,54, and 74, the total waiting time for 3 eruptions is 70 54 74 207. The expected waiting time for 3 eruptions is 603 180. Therefore, difference_fron_expected. Item(2) should be 207 - 1801 - 27

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

Step: 3

blur-text-image

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

Intelligent Databases Object Oriented Deductive Hypermedia Technologies

Authors: Kamran Parsaye, Mark Chignell, Setrag Khoshafian, Harry Wong

1st Edition

0471503452, 978-0471503453

More Books

Students also viewed these Databases questions