Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Write a program in Python for the following tasks. 1. Search for one product that you are interested in on Amazon. Create a list in

Write a program in Python for the following tasks. 1. Search for one product that you are interested in on Amazon. Create a list in Python to document the product prices of the first 10 pieces of search results.

2. Print the following message I am interested in the product you are insterested in

3. Find and print the maximum price on the list using the format The highest price is the maximum price on your list

4. Find and print the minimum price on the list using the format The lowest price is the minimum price on your list

5. Find and print the median price on the list using the format The median price is the median price on your list

6. Find and print the average of the maximum and minimum prices using the format The average is the average based on your list

7. Compare the average to the median and print the result the median is larger than the average? Print True or False here

8. Insert the product name to the first position of the list and print the whole list.

9. Remove the highest price on the list and print the whole list again.

10. Create another list in the following format [My favorite product, the price of your favorite product among 10 search results]. Add this list to the end of the previous list as one element. Print both lists.

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

Temporal Databases Research And Practice Lncs 1399

Authors: Opher Etzion ,Sushil Jajodia ,Suryanarayana Sripada

1st Edition

3540645195, 978-3540645191

Students also viewed these Databases questions