Starting Out with Python (4th Edition)
4th Edition
ISBN: 9780134444321
Author: Tony Gaddis
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 7.10, Problem 26CP
Explanation of Solution
Function “plot()”:
- • “plot()” function creates a line graph.
- • This function is accessible in the “matplotlib.pyplot” module.
- • This “plot()” function creates a line graph by joining the data points with straight lines.
- • The “plot()” function takes two lists as its input arguments.
- • The first list represents the X coordinates of all the data points.
- • The second list represents the Y coordinates of all the data points.
Syntax:
The “plot()” function has the following procedure in Python.
plt.plot(xcoordinates, ycoordinates)
Explanation:
Here,
- • “plot()” is the function that plots a line graph.
- • The variable “xcoordinates” is a list that contains the X coordinates of all data points.
- • The variable “ycoordinates” is a list that has the Y coordinates of all data points.
Example program:
The below example shows how to use the “plot()” function in Python.
#Import the files
import matplotlib.pyplot as plt
#Create a list to have the X coordinates of data points
xcoord = [1, 2, 3, 4]
#Create a list to have the Y coordinates of data points
ycoord = [2, 4, 6, 8]
#Call the function
plt...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Programming Language: C++
Create a pseudocode (if you not familiar with this, you can create a program) that check if "directed graph"
is actually circle graph. The meaning of circle is that let's say there is 1~6 nodes.
The graph start with 1 and only can move to 2, and 2 can only move to 3....etc and after you hit 6, you move back to 1.
so 1=>2=>3=>4=>5=>6=>1
this is example of circle directd graph. Please create a pseudocode/program to check if graph is circle or not.
Also, include the time complexity of your pseudocode by [Worst case time complexity / Best case time complexity]
You are competing in a hedge race
The maze is described as a graph with a start, goal, edge lengths, and
two types of edges: regular paths in the maze, and hedges which one
can crawl through. (Some parts of the maze are too thick to crawl
through.) Design an algorithm which finds the shortest path to the
goal, as quickly as possible
Volume of Histogram: Imagine a histogram (bar graph). Design an algorithm to compute the
volume of water it could hold if someone poured water across the top. You can assume that each
histogram bar has width 1.
EXAMPLE
Input: {0, 0, 4, 0, 0, 6, 0, 0, 3, 0, 5, 0, 1, 0, 0, 0}
(Black bars are the histogram. Gray is water.)
Output: 26
0 0 4 0 0 6 0 0 3 0 5 0 1 0 0 0
Chapter 7 Solutions
Starting Out with Python (4th Edition)
Ch. 7.2 - What will the following code display? numbers =...Ch. 7.2 - Prob. 2CPCh. 7.2 - Prob. 3CPCh. 7.2 - Prob. 4CPCh. 7.2 - Prob. 5CPCh. 7.2 - Prob. 6CPCh. 7.2 - Prob. 7CPCh. 7.2 - Prob. 8CPCh. 7.3 - Prob. 9CPCh. 7.3 - Prob. 10CP
Ch. 7.3 - Prob. 11CPCh. 7.3 - Prob. 12CPCh. 7.3 - Prob. 13CPCh. 7.4 - What will the following code display? names =...Ch. 7.5 - Prob. 15CPCh. 7.5 - Prob. 16CPCh. 7.5 - Prob. 17CPCh. 7.5 - Prob. 18CPCh. 7.8 - Prob. 19CPCh. 7.8 - Prob. 20CPCh. 7.8 - Write a set of nested loops that display the...Ch. 7.9 - Prob. 22CPCh. 7.9 - Prob. 23CPCh. 7.9 - Prob. 24CPCh. 7.9 - Prob. 25CPCh. 7.10 - Prob. 26CPCh. 7.10 - Prob. 27CPCh. 7.10 - Prob. 28CPCh. 7.10 - Prob. 29CPCh. 7.10 - Prob. 30CPCh. 7.10 - To create a bar chart with the bar function, what...Ch. 7.10 - Assume the following statement calls the bar...Ch. 7.10 - Prob. 33CPCh. 7 - This term refers to an individual item in a list....Ch. 7 - This is a number that identifies an item in a...Ch. 7 - Prob. 3MCCh. 7 - This is the last index in a list. a. 1 b. 99 c. 0...Ch. 7 - This will happen if you try to use an index that...Ch. 7 - This function returns the length of a list. a....Ch. 7 - When the operator's left operand is a list and...Ch. 7 - This list method adds an item to the end of an...Ch. 7 - This removes an item at a specific index in a...Ch. 7 - Prob. 10MCCh. 7 - If you call the index method to locate an item in...Ch. 7 - Prob. 12MCCh. 7 - This file object method returns a list containing...Ch. 7 - Which of the following statement creates a tuple?...Ch. 7 - Prob. 1TFCh. 7 - Prob. 2TFCh. 7 - Prob. 3TFCh. 7 - Prob. 4TFCh. 7 - A file object's writelines method automatically...Ch. 7 - You can use the + operator to concatenate two...Ch. 7 - Prob. 7TFCh. 7 - You can remove an element from a tuple by calling...Ch. 7 - Prob. 1SACh. 7 - Prob. 2SACh. 7 - What will the following code display? values = [2,...Ch. 7 - Prob. 4SACh. 7 - Prob. 5SACh. 7 - Prob. 6SACh. 7 - Prob. 1AWCh. 7 - Prob. 2AWCh. 7 - Prob. 3AWCh. 7 - Prob. 4AWCh. 7 - Write a function that accepts a list as an...Ch. 7 - Prob. 6AWCh. 7 - Prob. 7AWCh. 7 - Prob. 8AWCh. 7 - Total Sales Design a program that asks the user to...Ch. 7 - Prob. 2PECh. 7 - Rainfall Statistics Design a program that lets the...Ch. 7 - Prob. 4PECh. 7 - Prob. 5PECh. 7 - Larger Than n In a program, write a function that...Ch. 7 - Drivers License Exam The local driver s license...Ch. 7 - Name Search If you have downloaded the source code...Ch. 7 - Prob. 9PECh. 7 - World Series Champions If you have downloaded the...Ch. 7 - Prob. 11PECh. 7 - Prob. 12PECh. 7 - Magic 8 Ball Write a program that simulates a...Ch. 7 - Expense Pie Chart Create a text file that contains...Ch. 7 - 1994 Weekly Gas Graph In the student sample...
Knowledge Booster
Similar questions
- Write a program that asks user to enter number of vertices in an undirected graph and then the adjacency matrix representing the undirected graph. The program, then, must display whether the given graph is connected or not.arrow_forwardMipMaps I Suppose that a pixel projects to an area of 10x28 texels in a texture map. From what mipmap level does the texture unit look up the texture value for this pixel, if the texture unit is using "nearest" lookup for mipmaps? Enter a single integer that is the mipmap level. A/arrow_forwardWrite a program that asks user to enter number of vertices in an undirected graph and then the adjacency matrix representing the undirected graph. The program, then, must display whether the given graph is connected or not. Sample 1Enter number of vertices: 3Enter adjacency matrix:0 1 11 0 01 0 0The graph is connected.arrow_forward
- Pattern expression has several methods. Explain the following five pattern depiction methods: Provide examples.arrow_forward1. In each iteration of a loop, generate a random number, and use it to determine some attribute of what is drawn in that iteration. For example, draw one shape multiple times in random locations and/or at random sizes OR 2. write a triply nested for loop to add even more complexity to your drawing than with a doubly nested looparrow_forwardComputer Science The draw selection method implementation does not create a dashed box. Instead it fills the shape. What is the correct implementation?arrow_forward
- i want code in c language A food based company wants their users to rate their newly launched food items, items are Burger, Broast, Rice, Roll, Handi, Platter, Kebabs, Sandwich, Shake, Kheer. Scoring can be done from 1 to 10, best towards worst respectively. Design a solution that saves the food items and then let users rate these food items along with their comments. A bar graph based on rating should also be printed Note: (Structures must be used to save the data) A sample run of the application is shown as follows: Enter score for Burger (1-10) 8 Enter reason for liking or disliking Fresh and juicy Output of your program should be as follows Item Rating Reason Histogram Burger. 8 Fresh and juicy ******** Broast 4 Taste was not good **** . . . . . . . .arrow_forwardYou should consider the following points in your solution: Each octagon side has a length of 40 units. Each octagon has a different color. The border lines should be thick enough. The final shape of the output should be as shown above. You might place the desired colors in a list to access them by index in the drawing loop. Make sure to set properly the starting position (x & y) of your drawing, to maintain the above diagram. Tip: You can use the below colors and fillsarrow_forward6. Map Colouring Using theBush fire map Draw a graph of the region on the map and store the graph in the code. Then write an algorithm or pseudo code in python to find if the map is 4 colourable. NT BUSHFIRES COUNCIL REGIONS Arafura See Timer Vernon Arnhem Sea Gulf Arafura Katherine Carpintaria Gulf VRD Elliot Wauchope Barkly Cre NORTHERN TERRITORY Alice Springs West Alice N Springs East SOUTH AUSTRALIA WESTERN AUSTRALIA QUEENSLANDarrow_forward
- Using Raptor Procedures In the second section of Dr. Wayne Brown's tutorial on modules (Subcharts and Procedures in Raptor), you created the following Raptor program, shown here with its output: RAPTORGraph OX Start Start (in x,in y) Open_Graph Window(300, 300) Draw_Circle(x, y, 40, Red, filled) Draw_bulls eye(100, 100) Draw_Circle(x, y, 30, Green, filled) Draw_bulls_eye(200, 100) Draw_Circle(x, y, 20, Red, filled) Draw_bulls_eye(200, 200) Draw_Circle(x, y, 10, Green, filled) Draw_bulls eye(100, 200) End End Your job is to modify the program (if you have and can locate your work on this, start with that; otherwise you will need to create it now). Your task is to modify that program so that the output looks like this: riqDROTRARarrow_forwardCreate a function that finds the maximum range of a triangle's third edge, where the side lengths are all integers. Note that, (side1 + side2) - 1 = maximum range of third edge Example: next_edge (8, 10) → 17 (Write in python)arrow_forwardDraw W7 . Be able to draw 10 of its subgraphs.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
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