First picture is assignment I need help with, second picture is my code from assignment 17. Using python import turtleheights = [856, 420, 360, 260, 2051|def main () :t=turtle.Turtle ()t.hideturtle ()for i in range (5) :drawFilledRectangle (t, -200+i*75, 0, 75, heights[i]/4, "black", "light blue")displayText (t).#Draw a filled rectangle with bottom left corner (x, y)#With height h and width w, colorP-pen color, colorF=Fill color, t is a turtle objectdef drawFilledRectangle (t, x, y, w, h, colorP, colorF):t.pencolor (colorP)t.fillcolor (colorF)t.up ()t.goto (x, Y)t.down ()t.begin fill()t. goto (x+w,y)t.goto (x+w,y+h)t.goto (x, y+h)t.goto (x, Y)t.end fil1()def displayText (t):languages=["Mandarin", "Spanish", "English", "Hindi", "Bengali"]t.pencolor ("Blue")t.up ()for i in range (5) :#display numbers for each rectanglet.goto (-200+38+ (75*i), heights[i]/4)t.write (str (heights[i]),align=' center', font=("Arial",10,'normal'))#Display languages for each rectanglet.goto (-200+38+ (75*i), 5)t.write (languages [i],align='center', font=("Arial",10,'normal'))#display title below chartt.goto (-200,-25)t.write ("Principal Languages of the World",align='left', font=("Arial",10, 'normal'))t.goto (-200,-40)t.write (" (in millions of \"first language\" speakers) ",align='left', font= ("Arial",10,'normal'))main ()Ln: 3 Col: 4 In Assignment #17, you created a program to generate the following graph:856420360260205MandarinSpanishEnglishHindiBengaliPrincipal Languages of the World(in millions of "first language" speakers)For this assignment, create a new program that will be similar to Assignment#17. Make modifications so that your new program produces the followinggraph. It should match this graph exactly:by YOUR NAME GOES HERE16628153801271010915492042113861LenovoHP Inc.DellАppleASUSAcer GroupOthersWorldwide PC Vendor Unit Shipment Estimates for 4Q18(in thousands of units shipped)Be sure to include comments at the top of your Python program with yourname and other descriptive information

Import required files. Create a variable height for storing heights of the histogram. A function…

For this assignment, create a new program that will be similar to Assignment #17. Make modifications so that your new program produces the following graph. It should match this graph exactly: by YOUR NAME GOES HERE 16628 15380 12710 10915 4920 4211 3861 Lenovo HP Inc. Dell Apple ASUS Acer Group Others Worldwide PC Vendor Unit Shipment Estimates for 4Q18 (in thousands of units shipped) Be sure to include comments at the top of your Python program with your name and other descriptive information

For this assignment, create a new program that will be similar to Assignment #17. Make modifications so that your new program produces the following graph. It should match this graph exactly: by YOUR NAME GOES HERE 16628 15380 12710 10915 4920 4211 3861 Lenovo HP Inc. Dell Apple ASUS Acer Group Others Worldwide PC Vendor Unit Shipment Estimates for 4Q18 (in thousands of units shipped) Be sure to include comments at the top of your Python program with your name and other descriptive information

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 23PE

See similar textbooks

Similar questions

a) Write a program that asks user to enter number of vertices in a directed graph and thenthe adjacency matrix representing the directed graph. The program, then, must display thenode with the highest outdegree. Assume that nodes are named as 0, 1, 2 and so on.
Write a program that outputs the nodes of a graph in a breadth first traversal. in c ++ 10 0 1 3 -9991 4 -9992 5 -9993 2 -9994 -9995 7 8 -9996 4 7 -9997 -9998 -9999 7 8 -999 #include <iostream> #include <fstream> #include <iomanip> #include <cassert> using namespace std; template <class Type> struct nodeType { Type info; nodeType<Type> *link; }; template <class Type> class linkedListIterator { public: linkedListIterator() { current = nullptr; } linkedListIterator(nodeType<Type> *ptr) { current = ptr; } Type operator*() { return current->info; } linkedListIterator<Type> operator++() { current = current->link; return *this; } bool operator==(const linkedListIterator<Type>& right) const { return (current == right.current); } bool operator!=(const linkedListIterator<Type>& right) const { return (current != right.current); } private: nodeType<Type> *current; }; template <class Type> class…
C+ Write a program that outputs the shortest distance from a given node to every other node in the graph. I NEED THESE HEADER FILES INCLUDED IN THE PROGRAM PLEASE These are the header files: graphType.h, linkedList.h, linkedQueue.h, queueADT.h, testProgGraph.cpp, unorderedLinkedList.h, weightedGraph.h
In C++, write a program that outputs the nodes of a graph in a breadth first traversal. Data File: Please use this data file. Text to copy: 100 1 3 -9991 4 -9992 5 -9993 2 -9994 -9995 7 8 -9996 4 7 -9997 -9998 -9999 7 8 -999 Diagram: Also, please take a look at the attached figure on and calculate the weights for the following edges: 0 -> 1 -> 4 0 -> 3 -> 2 -> 5 -> 7 0 -> 3 -> 2 -> 5 -> 8 6 -> 4 6 -> 7 9 -> 7 9 -> 8 To calculates these weights, please assume the following data: 0 -> 1 = 1 0 -> 3 = 2 1 -> 4 = 3 3 -> 2 = 4 2 -> 5 = 5 5 -> 7 = 6 5 -> 8 = 7 6 -> 4 = 8 6 -> 7 = 9 9 -> 7 = 10 9 -> 8 = 11
I could use help, me please: Write a program (in main.cpp) that: Prompts the user for a filename containing node data. Outputs the minimal spanning tree for a given graph. You will need to implement the createSpanningGraph method in minimalSpanTreeType.h to create the graph and the weight matrix. Note: Files Ch20_Ex21Data.txt and Ch20_Ex4Data.txt contain node data that you may test your program with. minimalSpanTreeType.h: #ifndef H_queueADT #define H_queueADT template <class Type> class queueADT { public: virtual bool isEmptyQueue() const = 0; //Function to determine whether the queue is empty. //Postcondition: Returns true if the queue is empty, // otherwise returns false. virtual bool isFullQueue() const = 0; //Function to determine whether the queue is full. //Postcondition: Returns true if the queue is full, // otherwise returns false. virtual void initializeQueue() = 0; //Function…
USING THE C LANGUAGE, NOT JAVA OR C++ Given the graph above represented by a CSV file. Each line contains two nodes and the weight between that two nodes; each information is separated by a comma. Implement a Create_Graph method that reads from an input CSV file as described above and returns a graph representation of your choice. For the graph above, the following lines are in the CSV file: A, B, 8 A, C, 22 B, D, 15 B, C, 7 C, D, 18 Implement a Display method that take a graph representation as input and shows the adjacent matrix associated with weights. Implement a Shortest_Distance method that takes a graph representation and a node name as inputs. The method will return the shortest distance from the input node to all other nodes. If the input node is A then the method will generate the output which has information as below: Note: you have to use Dijkstra’s Algorithm in your solution.
IN C LANGUAGEthe program will display the maximum number of edges as well as the minimum number of edges connecting the two nodes (in case of course they are connected to each other).
In C++, write a program that outputs the nodes of a graph in a breadth first traversal. Data File: Please use this data file. Text to copy: 100 1 3 -9991 4 -9992 5 -9993 2 -9994 -9995 7 8 -9996 4 7 -9997 -9998 -9999 7 8 -999 Diagram: Also, please take a look at figure 20-6 on page 1414 and calculate the weights for the following edges: 0 -> 1 -> 4 0 -> 3 -> 2 -> 5 -> 7 0 -> 3 -> 2 -> 5 -> 8 6 -> 4 6 -> 7 9 -> 7 9 -> 8 To calculates these weights, please assume the following data: 0 -> 1 = 1 0 -> 3 = 2 1 -> 4 = 3 3 -> 2 = 4 2 -> 5 = 5 5 -> 7 = 6 5 -> 8 = 7 6 -> 4 = 8 6 -> 7 = 9 9 -> 7 = 10 9 -> 8 = 11
A C++ Program Make necessary changes to the Class Definition Graph ADT so that it can store data in the following way (as seen in the attach images) Create the following operations and include a menu-driven main program that will demonstrate your operations. The program will only stop when the user chooses 5 Exit Program. 1. Create Grapha. Adjacency Listb. Adjacency Matrix 2. Traversala. BFS (Breadth First Search)b. DFS (Depth First Search) 3. Find Path (Given Source and Destination) 4. Path Cost (Given Source and Destination) 5. Exit Program NOTE: Users will input name of places as string and your program will do the manipulation to convert it to an integer vertex. Also, you will have to convert integer vertex back to string when displaying back output to users. Cost will the basis on what vertex to take in BFS and DFS. Cost will only be displayed in option 4.
A)Draw the linked node structure created by the following program and , B)List the output of program. struct node{ struct node *left; char letter; struct node *right; }; typedef struct node *NODEPTR; NODEPTR getnode(void); void displayList(NODEPTR); void main() { NODEPTR p , list , save; char one; p=getnode(); p->letter='A'; list=p; p->right=p; p->left=p; save=list; for(int i=2;i<8;i+=2) { one='A'+ i; p=getnode(); p->letter=one; p->left=save; save->right=p; save=p; printf("Letter= %c\n",p->letter); } list->left=save; save->right=list; list=p; displayList(list); } void displayList(NODEPTR head) {NODEPTR save; printf("\nLIST\n"); save=head; do {printf("%c ",save->letter); save=save->left; }while(save!=head); } NODEPTR getnode() { NODEPTR q; q = (NODEPTR) malloc(sizeof(struct node));…
One way to define a transportation system iswith a set of sequences of vertices, each sequence defining a path connecting the vertices. For example, the sequence 0-9-3-2 defines the edges 0-9, 9-3, and 3-2. Write aEuclideanGraph client RandomTransportation that builds a graph from an input fileconsisting of one sequence per line, using symbolic names. Develop input suitable to allow you to use your program to build a graph corresponding to the Paris Métro system.Testing all algorithms and studying all parameters against all graph models is unrealistic.For each problem listed below, write a client that addresses the problem for any given inputgraph, then choose among the generators above to run experiments for that graph model.Use your judgment in selecting experiments, perhaps in response to results of previousexperiments. Write a narrative explaining your results and any conclusions that might bedrawn.
In this assignment, you will create a Linked List data structure variant called a “Circular Linked List”. The Node structure is the same as discussed in the slides and defined as follows (we will use integers for data elements): public class Node { public int data; public Node next; } For the Circular Linked List, its class definition is as follows: public class CircularLinkedList { public int currentSize; public Node current; } In this Circular Linked List (CLL), each node has a reference to an existing next node. When Node elements are added to the CLL, the structure looks like a standard linked list with the last node’s next pointer always pointing to the first. In this way, there is no Node with a “next” pointer in the CLL that is ever pointing to null. For example, if a CLL has elements “5”, “3” and “4” and “current” is pointing to “3”, the CLL should look like: Key observations with this structure: The currentSize is 3 meaning there…