Free Essay

Submitted By eyemback

Words 2276

Pages 10

Words 2276

Pages 10

Task Title: Implementation of basic command-line interface to GraphApplication

Task Description:

Implement classes that will instantiate a graph editor. The system should accept various kinds of objects from user by given commands, and respond to these commands by creating node objects, creating arc objects, displaying them or deleting them. Implement the following classes: 1. GraphApplication class that will implement command line interface and interact with the user: This class needs to implement the following commands in its run() method: a. quit – exits the application b. nodes - lists the nodes in the graph c. arcs – lists the arcs in the graph these commands do not need index or parameters d. node - this command requires object for which the node will be created e. dir-arc – this command requires two objects that have nodes and relation name and makes a directed arc between them f. undir-arc – this command requires two objects that are added to nodes and relation name and makes non-directed (symmetric) arc between them these commands can take any object, but for now we will use strings g. printout, delete – these commands require an index or name for the object to be shown or deleted if delete takes two arguments it deletes the corresponding arc, of it gets only one, it deletes a node, if printout takes one argument it prints a node, if it takes two arguments it prints the fact that an arc exists between two nodes h. rectangle, circle – these commands take 3 (or 4) arguments and make corresponding instance of DrawObject subclasses

This class is the main class of the application. Implement main method in this class, which will create an instance of GraphApplication and execute its run method. 2. DrawObject class, an abstract class that will store common shape data and behavior, this class should include Point2D.Double data item which corresponds to a position of a geometric object in 2D space (x and y coordinates). This class needs to implement toString() methods and it needs to require printout() method from its subclasses. toString() method should report object position and type (use reflection to return class name!!). 3. Circle that will store the circle data (radius) that user enters in the window, this class extends DrawObject to represent a circle. This class needs to implement printout() method. 4. Rectangle that will store the rectangle data (width and height) that user enters in the window, this class extends DrawObject to represent a rectangle. This class needs to implement printout() method. 5. Node class that will store the data about an object that user enters in the command window, and also stores relations between this object and other objects. This class needs to implement printout() method. 6. Arc class that stores a relation between two objects and relation name 7. DirectedArc class that stores directed arc information. It extends Arc 8. UndirectedArc class that stores undirected arc information. It extends Arc 9. Graph class, which will keep a collection of Node-s and provides the methods for adding, listing and deleting objects.

Notes for creating programs: 1. Adhere strictly to object-oriented principles in making these classes. 2. Follow conventions in naming classes, methods and variables. (see distributed sheets) 3. Specifications for Node, Arc, DirectedArc and UndirectedArc, and Graph are given as attachment. For those classes implement only methods that you need to run your application correctly. Implement necessary constructors for those classes, for example You should have at least two constructors for arcs, one taking two nodes, and another taking two objects and finding nodes. 4. Comment your code, use javadoc convention for commenting each member variable and each method. 5. Make each class into separate file.

Testing

I will provide you scripts (sequence of commands) for testing your graph representation. However, you can introduce your own tests (think about family trees, streets - two-way and one-way, roads and cities, molecular structures, web links, facebook friends, …)

Deliverables:

You should submit a report that will describe your solution. The report should include: 1. Listing of all your programs (class code) – on USB disk 2. The screen printout of your program running on test data. 3. Copy your workspace onto USB disk into a folder project3 under your class folder (cs4500 or cs5500). Submit your USB disk to instructor by deadline.

Due date:

Program is due on Tuesday, February 19, 2013. at 1:30 pm.

Graph explanation

Graph definitions

The multigraph Gm = <N, R, A> is defined by a set of nodes N, set of relations R, and set of arcs A such that aE A implies that there exists an r E R, such that for two nodes n1 and n2 it is true that n1 ri n2. That is to say, a multigraph is defined by a set of nodes (objects), a set of relations between those objects and a set of arcs which correspond to facts that nodes are connected by specified relations.

Important property of the multigraph is transitivity of relations, which should be defined differently for a regular graph. In a multigraph transitivity is defined over two relations, which are defined in different dimensions. For relation ri to be transitive the following condition should be met: if N1 ri N2, and N1 rj N1’ and N2 rj N2’ than we define that N1’ ri N2’. An example of this transitivity can be explained on a precedence relation: if a process p1 should precede p2, and p1 is a member of p1’, and p2 is a member of p2’, than precedence relation should hold between p1’ and p2’.

public class Node { /** * Adds a node to this node connected by an undirected arc * @param aNode the node to connect to this node */ public void addNode(Node aNode); /** * Removes the relation between the parameter and this node * @param aNode the node whose relation is removed */ public void removeNode(Node aNode); /** * Adds a child node connected by a directed arc with this object as parent * @param child child node to this node */ public void addChild(Node child); /** * Removes the child node and the arc associated with it * @param child child node to this node * @throws IllegalArgumentException if input node is not a child node */ public void removeChild(Node child); /** * Adds a parent node connected by a directed arc with this object as parent * @param parent parent node to this node */ public void addParent(Node parent); /** * Removes the parent node and the arc associated with it * @param parent parent node to this node * @throws IllegalArgumentException if input node is not a parent node */ public void removeParent(Node parent); /** * Returns a list of graph nodes connected to this node by undirected arcs * @return List of connected Nodes */ public List<Node> getNodes(); /** * Returns a list of parent nodes connected to this node by directed arcs * @return List of parent Nodes */ public List<Node> getParents(); /** * Returns a list of child nodes connected to this node by directed arcs * @return List of child Nodes */ public List<Node> getChildren(); /** * Returns true if this node is root node having no parent nodes * @return true if root node */ public boolean isRoot(); /** * Returns true if this node is leaf node having no child nodes * @return true if child node */ public boolean isLeaf(); /** * Returns true if this node has at least one parent node * @return true if child */ public boolean isChild(); /** * Returns true if this node is child to the input node * @return true if child */ public boolean isChild(Node parent); /** * Returns true if this node has at least one child node * @return true if parent */ public boolean isParent(); /** * Returns true if this node is parent to the input node * @param child graph node * @return true if parent */ public boolean isParent(Node child); /** * Returns true if this node is connected to at least one node by an undirected arc * @return true if connected */ public boolean isConnected(); /** * Returns true if the input node is connected to this node * @param aNode * @return true if input node is connected */ public boolean isConnected(Node aNode); /** * Adds the directed arc to this node with this node as child * @param arc the DirectedArc to be added */ public void addInArc(DirectedArc arc); /** * Removes the directed arc to this node * @param arc the DirectedArc to be removed */ public void removeInArc(DirectedArc arc); /** * Adds the directed arc to this node with this node as parent * @param arc the DirectedArc to be added */ public void addOutArc(DirectedArc arc); /** * Removes the directed arc to this node * @param arc the DirectedArc to be removed */ public void removeOutArc(DirectedArc arc); /** * Adds the undirected arc to this node * @param arc the UndirectedArc to be added */ public void addArc(UndirectedArc arc); /** * Removes the undirected arc to this node * @param arc the UndirectedArc to be removed */ public void removeArc(Arc arc); /** * Returns the undirected arc between the input node and this node * @param aNode Node * @return the undirected arc between the nodes * @throws IllegalArgumentException if no arc exists */ public Arc getArc(Node aNode); /** * Returns the directed arc between the input node and this node * @param parent Node * @return the directed arc between the nodes * @throws IllegalArgumentException if no arc exists */ public DirectedArc getInArc(Node parent); /** * Returns the directed arc between the input node and this node * @param child Node * @return the undirected arc between the nodes * @throws IllegalArgumentException if no arc exists */ public DirectedArc getOutArc(Node child); /** * Returns a list of directed arcs to nodes having this node as child node * @return list of directed arcs */ public List<DirectedArc> getInArcs();

/** * Returns a list of directed arcs to nodes having this node as parent node * @return list of directed arcs */ public List<DirectedArc> getOutArcs(); /** * Returns a list of undirected arcs to nodes connected to this node * @return list of directed arcs */ public List<UndirectedArc> getArcs(); /** * Clears the relations (arcs) between this node and other connected nodes * and removes references to this node in other nodes */ public void clearArcs(); /** * Sets the user object associated with the node * @param o the user object * @throws IllegalArgumentException if o is null */ public void setUserObject(Object o); /** * Gets the user object associated with the arc * @return user object */ public Object getUserObject();

public class Arc {

/** * Determines whether a node belongs to the arc * @param aNode graph node */ public boolean nodeExists(Node aNode);

/** * Clears the arc and removes the relations in the nodes */ public void clear();

/** * Sets the user object associated with the arc * @param o the user object * @throws IllegalArgumentException if o is null */ public void setUserObject(Object o);

/** * Gets the user object associated with the arc * @return user object */ public Object getUserObject();

}

public class DirectedArc extends Arc {

/** * Returns the parent graph node in the arc * @return parent Graph node */ public Node getParent(); /** * Returns the child graph node in the arc * @return parent Graph node */ public Node getChild(); /** * Sets the parent graph node in the arc * @param parent Graph node */ public void setParent(Node parent); /** * Sets the parent graph node in the arc * @param child Graph node */ public void setChild(Node child);

}

public class UndirectedArc extends Arc { /** * Returns the other node associated with the arc given one node * @param aNode graph node in the arc * @throws IllegalArgumentException if node does not belong to arc */ public Node getOtherNode(Node aNode); public List<Node> getNodes();

}

public class Graph { /** * Adds a node to the graph * @param node Graph node */ public void addNode(Node node); /** * Removes a node from the graph * @param node Graph node */ public void removeNode(Node node); /** * Adds an undirected arc to the graph * @param node1 Node * @param node2 Node */ public void addBiArc(Node node1, Node node2); /** * Adds an directed arc to the graph * @param source graph node * @param sink graph node */ public void addDiArc(Node source, Node sink); /** * Removes an undirected arc from the graph * @param arc undirected arc */ public void removeArc(UndirectedArc arc); /** * Removes a directed arc from the graph * @param arc directed arc */ public void removeArc(DirectedArc arc); /** * Tests whether a graph node exists in the graph * @param node graph node * @return true if node exists */ public boolean nodeExists(Node node); /** * Tests whether an arc exists between two nodes in the graph * @param node1 graph node * @param node2 graph node * @return true if arc exists */ public boolean arcExists(Node node1, Node node2); /** * Tests whether a graph node is connected to other nodes by undirected or directed arcs * @param node graph node * @return true if node exists */ public boolean nodeHasArcs(Node node); public Node getNode(Object userObject); /** * Tests whether a graph node is connected to other nodes by directed arcs * @param node graph node * @return true if node exists */ public boolean nodeHasDirectedArcs(Node node); /** * Returns an iterator over the nodes connected to the input node * @param node graph nodes * @return an iterator */ public Iterator<Node> getConnectedNodes(Node node); /** * Returns an iterator over the children nodes to the input node * @param node graph nodes * @return an iterator */ public Iterator<Node> getChildNodes(Node node); /** * Returns an iterator over the parent nodes to the input node * @param node graph nodes * @return an iterator */ public Iterator<Node> getParentNodes(Node node); /** * Returns an iterator over all the nodes in the graph model * @param node graph nodes * @return an iterator */ public Iterator<Node> getNodes();

/** * Returns a subGraph based on the specified list of nodes * @param nodes graph nodes for the subgraph */ public Graph subGraph(List<Node> nodes); /** * Adds a listener to the graph * @param l an EventListener */

/** * Returns an iterator over the set of DirectedArcs present in the graph model * @return list of directed arcs */ public Iterator<DirectedArc> getDirectedArcs(); /** * Returns an iterator over the set of UndirectedArcs present in the graph model * @return list of undirected arcs */ public Iterator<UndirectedArc> getUndirectedArcs(); }…...

Premium Essay

...(How many times higher does the second ball go than the first ball?) A) 4:1 B) 2:1 C) 1.7:1 D) 1.4:1 11) Two objects are thrown from the top of a tall building. One is thrown up, and the other is thrown down, both with the same initial speed. What are their speeds when they hit the street? A) The one thrown up is traveling faster. B) The one thrown down is traveling faster. C) They are traveling at the same speed. D) It is impossible to tell because the height of the building is not given. 12) The slope of a position versus time graph gives A) position. B) velocity. C) acceleration. D) displacement. 13) The slope of a velocity versus time graph gives A) position. B) velocity. C) acceleration. D) displacement. 14) The area under a curve in an acceleration versus time graph gives A) acceleration. B) velocity. C) displacement. D) position. 15) The area under a curve in a velocity versus time graph gives A) acceleration. B) velocity. C) displacement. D) position. 16) An object moves 15.0 m north and then 11.0 m south. Find both the distance traveled and the magnitude of the displacement vector. A) 4.0 m, 26.0 m B) 26.0 m, 4.0 m C) 26.0 m, 26.0 m D) 4.0 m, 4.0 m 17) A boat can move at 30 km/h in still water. How long will it take to move 12 km upstream in a river flowing 6.0 km/h? A) 20 min B) 22 min C) 24 min D) 30 min 18) 55 mi/h is how many m/s? (1 mi = 1609 m.) A) 25 m/s B) 49 m/s C) 90 m/s D) 120......

Words: 10622 - Pages: 43

Free Essay

...Length: 3 Parts: See Assignment Details Points Possible: 75 Graphs and Trees Task Background: Graphs and trees provide you with ways to visualize data sets, and the opportunity to do analysis on the data (e.g., shortest path). Knowing the structure of a database enables you to choose a proper algorithm for searching for data within a database. Primary Task Response: Within the Discussion Board area, write up to 3 paragraphs that respond to the following questions with your thoughts, ideas, and comments. This will be the foundation for future discussions by your classmates. Be substantive and clear, and use examples to reinforce your ideas. Part I (25 points – distributed as follows) Trees are somewhat less complicated than graphs, which makes things like data searching easier, when a data has the structure of a tree. However, not all data can be represented by a tree. Give an example of a data set that cannot be represented by a tree, but that can be represented by a more general graph. 1) Create, show, and describe your data set. (5 points) V = {Bill, John, Kim, James, Chris, Destiny, Noah, Paul} E = {(Bill, John), (Kim, James), (Chris, Destiny), (Noah, Paul), (Bill, Kim), (John, Chris), (Destiny, Noah)} These are people that are employees at a store. Some work on the same shift together and associate with each other. 2) Then, show by building a graph, how your data is represented by a graph. (5......

Words: 1054 - Pages: 5

Free Essay

...Phase 3 DB Graphs and Trees Elie De Jesus MATH203-1302A-01 – Discrete Mathematics Professor Andrew Halverson April 24, 2013 Part I Graphs and trees are a little more complicated to understand than what I thought. Based on the information that I found they give you a way to visualize your sets and use the data that you have to find the shortest path. So because of this it shows that Trees cannot contain a cycle, so a set would be Y=COS(X); which can be a general graph but not a tree. The one example that I understood was the one about “the mileage on a bike”. Now I don’t quite understand the example but it shows that the graph would have a decrease in mileage where as it would increase in time. That is not how a tree is explained because there is no sequence to be shown for the data. This is the examples graph: So based on that example I understand that the tree encoding defines a root node or one path between two nodes that represent the output of a solution. A tree is still a graph but without multiple paths. So to be a tree it has to start from any node and be able to reach another, there can be no cycles, and you must have more nodes that edges. Part II To first answer this question one must know the meaning of a Breadth-first or a Depth-first. A Breadth-first search is a strategy for searching in a graph when search is limited to essentially two operations: (a) visit and inspect a node of a graph; (b) gain access to visit the nodes that neighbor the......

Words: 479 - Pages: 2

Free Essay

...Section 9.1: Exercises 6, 12, 20, 28, 32, 50 6.) Explain why each graph is that of a function. * Each graph is that of a function because at each point in a graph we get a value for y corresponding to a value for x. This is just the pictorial reflection of what we get in case of a function. Solve each system by substitution 12.) Solution * 2x + y = 5 * y = 5- 2x Substituting in first equation 4x – 5y = -11 4x – 5(5-2x) = -11 4x – 25 + 10x = -11 14 x = -11 + 25 14x = 14 x = 1 Therefore, we get : So, y = 5-2x = 5 -2*1 = 3 x = 1, y =3 Solve each system by elimination. 20.) Solution 4x +y = -23 ………………………eq 1 x - 2y = -17…………………………….eq 2 Performing 2*eq 1 + eq 2 we get : 8x + 2y = -46 x – 2y = -17 This Gives us : 8x + x = -46 -17 9x = -63 x = -7 So, x – 2y = -17 -7 -2y = -17 2y = 17-7 =10 y = 5 So, X = -7, Y =5 28.) Solution 3x/2 + y/2 = -2 * 3x + y = -4 ……………………………….eq 1 x/2 + y/2 = 0 * x + y = 0 ………………………………………..eq2 Performing eq 1 – eq 2 3x + y = -4 (-)x + (-)y = (-)0 3x – x = -4 * 2x = -4 * X = -2 So, X + y = 0 * -2 + y = 0 * Y = 2 So, x = - 2, y = 2 Solve each system. State whether it is inconsistent or has infinitely many solutions. If the system has infinitely many solutions, write the solution set and y arbitrary. 32) Solution 3x + 2y = 5 ……………….eq 1 6x + 4y = 8 ……………….eq2 * 3x + 2y = 4 ……………………...

Words: 1309 - Pages: 6

Premium Essay

...heading “Method of Collecting Data”. Mention whether the data was received from different sources, like government agencies or departments within the firm. Also explain each source’s method for reporting data. Explain about the method of accounting analysis for these distinct reporting methods. 5. Title the next section as “Significant Financial Events” and under this section, enlist the events which occurred during the studied time period and which altered results. 6. Proceed with a section titled “Detailed Results” which includes a comprehensive analysis about the investment returns, balance sheets, income statement, and productivity ratios. Also comment on each of these factors in addition to providing support for your statements with graphs and tables. 7. Evaluate results from various quarters in a section titled “Analysis of Variance”. 8. Prepare an appendix for “Financial Revenues” defining how that term was used for preparing the report. Tabulate the revenues over the analysis’ time period. 9. End the report with an appendix for “Observations” discussing any problems faced while performing analysis and thereafter explaining about how research method handled problems. Conclude the report with a statement projecting future performance on the basis of past years’ performance. BalanceSheet - Apollo Tyres Ltd. | | | | | | | Particulars | Mar'13 | Mar'12 | Mar'11 | Mar'10 | Mar'09 | Liabilities | 12 Months | 12 Months | 12 Months | 12 Months | 12 Months | Share......

Words: 738 - Pages: 3

Free Essay

...Inductive Triple Graphs: A purely functional approach to represent RDF Jose Emilio Labra Gayo1 , Johan Jeuring2 , and Jose María Álvarez Rodríguez3 1 University of Oviedo Spain labra@uniovi.es Utrecht University, Open University of the Netherlands The Netherlands j.t.jeuring@uu.nl 3 South East European Research Center Greece jmalvarez@seerc.org 2 Abstract. RDF is one of the cornerstones of the Semantic Web. It can be considered as a knowledge representation common language based on a graph model. In the functional programming community, inductive graphs have been proposed as a purely functional representation of graphs, which makes reasoning and concurrent programming simpler. In this paper, we propose a simpliﬁed representation of inductive graphs, called Inductive Triple Graphs, which can be used to represent RDF in a purely functional way. We show how to encode blank nodes using existential variables, and we describe two implementations of our approach in Haskell and Scala. 1 Introduction RDF appears at the basis of the semantic web technologies stack as the common language for knowledge representation and exchange. It is based on a simple graph model where nodes are predominantly resources, identiﬁed by URIs, and edges are properties identiﬁed by URIs. Although this apparently simple model has some intricacies, such as the use of blank nodes, RDF has been employed in numerous domains and has been part of the successful linked open data movement. The main......

Words: 5524 - Pages: 23

Free Essay

...Koinsber bridge, in 1735. This problem lead to the concept of Eulerian Graph. Euler studied the problem of Koinsberg bridge and constructed a structure to solve the problem called Eulerian graph. In 1840, A.F Mobius gave the idea of complete graph and bipartite graph and Kuratowski proved that they are planar by means of recreational problems. The concept of tree, (a connected graph without cycles [1]) was implemented by Gustav Kirchhoff in 1845, and he employed graph theoretical ideas in the calculation of currents in electrical networks or circuits. In 1852, Thomas Gutherie found the famous four color problem. Then in 1856, Thomas. P. Kirkman and William R.Hamilton studied cycles on polyhydra and invented the concept called Hamiltonian graph by studying trips that visited certain sites exactly once. In 1913, H.Dudeney mentioned a puzzle problem. Eventhough the four color problem was invented it was solved only after a century by Kenneth Appel and Wolfgang Haken. This time is considered as the birth of Graph Theory. Graph theoretical concepts are widely used to study and model various applications, in different areas. They include, study of molecules, construction of bonds in chemistry and the study of atoms. Similarly, graph theory is used in sociology for example to measure actor prestige or to explore diffusion mechanisms. Graph theory is used in biology and conservation efforts where a vertex represents regions where certain species exist and the edges......

Words: 476 - Pages: 2

Free Essay

...acceleration vs. time kinematics graphs To review predicting and sketching distance vs. time and velocity vs. time kinematics graphs PROCEDURE: Begin by making charts like the one below for each of the following a-d a. The man walks slowly to the house from the origin. Position –Time Graph The moving man starts at a position of -8 meters and is accelerating at 1 m/s 2. He starts with a velocity of 0 m/s. After 1 second, he will be going 1 m/s (remember acceleration is 1 m/s per s so velocity will change by +1 m/s with each second that elapses). So after 2 seconds, he will be going 2 m/s, etc. If you carry this motion out with moving man, you see it will take him 4 seconds to get to the origin (a position of 0 meters), or equivalently to move +8 meters from where he started. At 4 seconds, he will have a velocity of 4 m/s On the Position-Time graph, the line is a positive consistent rise. This is because his position is going in a positive direction as well as the time is going in a consistent positive direction. Explanation for graph’s appearance –after actually performing the activity. Velocity-Time Graph On the Velocity-Time graph, the line is straight across at 2 m/s because the velocity does not change because of the consistent speed of the man walking to the house. Since the velocity is constant the acceleration is zero. Explanation for graph’s appearance - after actually performing the activity. Acceleration –Time Graph On the Acceleration-Time graph, the line is......

Words: 604 - Pages: 3

Free Essay

...Introduction To Virtual Spatial Graph Theory 1. Introduction The mathematical theory of knots studies the many ways a single loop can be tangled up in space. Since many biological molecules, such as DNA, often form loops, knot theory has been applied to biological systems with good effect. However, many biological molecules form far more complicated shapes than simple loops; proteins, for example, often contain extensive crosslinking between cystine residues, and hence from the mathematical viewpoint are far more complicated structures–spatial graphs. The study of graphs embedded in space is known as spatial graph theory, and researchers such as Flapan have obtained good results by applying it to chemical problems. However, in biological systems, proteins are often associated with membranes, meaning that some portions of the molecule are prevented from interacting with others. In the case of a simple loop, the virtual knot theory of Kauffman provides a mathematical framework for studying such systems, as it allows some crossings of strands to be labeled “virtual,” i.e. non-interacting. We hope that a merging of these two theories, called virtual spatial graph theory, will prove equally useful in the biological sciences. Knot theory studies embeddings of circles up to isotopy. There are many ways to extend the ideas of knot theory; two natural choices are the study of spatial graphs and the theory of virtual knots. The theory of spatial graphs generalizes the objects......

Words: 2895 - Pages: 12

Free Essay

...Misleading Graphs Paper and Presentation Team A: Roderick Hayes II, Melissa Krol, Ann Leal, Wanda Otey, and Corinn Sanders QNT/273 May 9, 2011 Terry Dunning Misleading Graphs Paper and Presentation Graphs are used to give a visual image of data so readers can analyze and translate it quicker and easier than looking at a mass of numbers. However, incorrectly drawn or disproportionately drawn graphs can lead a reader to incorrect translation of data (Bluman, 2009). This document will describe the problems associated with the graph shown below, explain how they affect readers, and what needs to be done to correct the graph (University of Phoenix, 2010). [pic] (Misleading Graphs, 2011) Problems This bar chart represents sales from the year 1995 -1998, this is an assumption because there is no indication that the figures on the horizontal axis represent years. Charts can be quite useful in explaining many capacities of numbers. In looking at this chart, the boxes seem large because of the 3-D effect, which in this chart makes the 1995 bar seem taller than any of the other bars. The label “number of singles sold” on the vertical axis is unclear. The vertical axis also has no percentages or other numeric values indicating how much was sold and the horizontal axis is vague as it does not indicate what the numbers listed represent (Misleading Graphs, 2011). Effect on Users The chart is not properly set up for users to accurately read......

Words: 924 - Pages: 4

Premium Essay

...Business Graphs Unit 8 focus on business graphs, which is covered in your reading of Chapter 7: “Business Statistics.” Note: In this Assignment you will have both Assignment problems and an essay component. For this Assignment you will write an essay to address the requirements described below. Your essay must be carefully planned and written using well-constructed sentences and paragraphs. Make sure that your grammar and spelling are correct. Points will be awarded for content as well as composition. Your essay must be a minimum of 1 half of a full page in length, with standard 1 inch margins and is required to have at least one reference from a reliable source. This means that you cannot use sites like Wikipedia, Ask.com®, and Yahoo® answers and that only references from reliable sources will earn points. All resources should be cited both as an in-text citation as well as being listed on a reference page in APA format. Assignments must be submitted as a Microsoft® Word® document and uploaded to the Dropbox for Unit 8. Include your essay directly in this document following the instructions. All Assignments are due by Tuesday at 11:59 p.m. ET of the assigned unit. Essay Assignment (40 points) Question 1: (10 Points) a) Create a bar graph or line graph for the following data including labels: Presto Printing Company sales for one week, beginning February 2: $9,300 $7,900 $5,609 $5,876 $5,420 $3,769 $3,900 b) Create a circle graph......

Words: 551 - Pages: 3

Premium Essay

...previous page into the spreadsheet. t'JJ The first issue you have to deal with is the heading "Concentration (mol/L)" is too large to fit in • j cell AI. This must be fixed. You can either increase the column width or wrap text. l'j The second issue is that by default, data in the spreadsheet is not "centered" in the cells as shown in the figure. This must also be fixed. Follow the instructions of your instructor. o Notes: • 3. initial here: • 0 Your spreadsheet should look exactly like that in the example, including capitalization, etc. If it does, 2 " :rQ.e 0~ j Name • Using Spreadsheets and Graphing A Skill-Building Exercise in Excel Goal: To Successfully Create an XY Scatter Chart (Graph) using Microsoft Excel 2013 Introduction This lab exercise will walk you through 20 J 3 and using the available I. Background: In most spreadsheet the process of creating an XY Scatter Chart using Microsoft Excel features to format the Scatter Chart. Entering Data in a Spreadsheet programs, the columns and the rows are labeled with numbers. are labeled with letters 1 2 is called a cell. It is common At the intersection L_ of each row and column is a place where data may be entered and this space to place data in a spreadsheet so that 3 sets of related data values are placed in the same row. An example 4 of this would 5 6 temperature be to put a time......

Words: 1308 - Pages: 6

Premium Essay

...PHY 100 LAB My graph depicts the change in the U.S minimum wage over time. This graph has data starting at the implementation of the minimum wage act in 1938, up to more current data in 2014. The gray bar data represents the nominal value for an unadjusted dollar. The yellow bar accounts for the inflation of the dollar, turning it into a 2014 dollar. This depicts what the minimum wage change would look like in constant data value. Looking at the unadjusted graph, there is a bigger discrepancy between the start and end minimum wage. The gray graph has a slow increase of to minimum wage over time. The adjusted wage data depicts many more fluctuations in the data. The yellow bar depicts a more significant increases in the beginning particularly between 1950 to 1970. There are large decreases to the minimum wage around 1975, the end of 1980 and 2008. These decreases do not populate on the nominal value chart. The yellow data shows that the minimum wage has not been a constant an increase like the nominal data. The adjusted dollar is a more realistic and reliable interpretation to the change in the minimum wage. It's interesting that minimum wage has been "higher" in the past then by 2014's minimum wage value. Graph on Page 2 Citation: Taylor, S. L. (2014, February 1). A Basic Fact About The Minimum Wage. Retrieved February 20, 2016, from http://www.outsidethebeltway.com/a-basic-fact-about-the-minimum-wage/ Velocity Graph Descriptions 1 This graph is at a......

Words: 373 - Pages: 2

Premium Essay

...The Statistical Bar Graph Statistical graphs, charts, and tables are in almost every type of newspaper or journals that are published today. The illustrations are used to make the data easier to understand and read. Although, at times, these graphs, tables, or charts can be confusing. Many types of graphs and charts are used, such as bar graphs, dot plots, pie charts, histograms, and line charts just to name a few. The simplest of these is the bar graph. The bar graph is commonly used for qualitative data and compare the amounts or frequency of occurrence of different characteristics. The display in a bar graph allows a person to compare groups of data and make generalizations about data quickly. Since bar graphs are used to graph frequencies, the height of the bar is important. The longer bar represents a higher frequency. Other areas of interest on the graph are the frequency axis and the axes scale. The frequency axis measures the frequency or amount of the different data, and the axes scale measures the range of values being presented along the frequency axis. In this paper, the bar graph will be addressed using a graph from a study that was found on the internet site theragblog.blogspot.com from an article Health Care Reform: ‘This Won’t Hurt a Bit’ (2010). The bar graph shows the main cause of death is the lack of health insurance, and the article states that health care reform could possibly have an effect on this since everyone would be required to have...

Words: 526 - Pages: 3

Free Essay

...Sample Chart/Graph Paper (Marhar, 2011) The graph above is a bar graph. A bar graph is typically the easiest to visualize data quickly. A bar graph is characteristically used for qualitative information. The longer the bar is the higher the frequency of information for that bar. It is imperative to label clearly so that readers know what they are precisely looking at and do not have to make assumptions (Bennett, Briggs, & Triola, 2009). This graph depicts the strategies to prevent readmissions into the hospital. I do believe that this graph is an appropriate choice to depict the data used from the study. This is the best graph to use because it is easy to glance at the graph and retrieve the information. The spacing in the graph is portrayed evenly, the scale on the vertical axis is evenly spread out, and the graph is titled, which is extremely important. Another option to display this information could be a line graph. Although I believe this graph is the best type of graph to use, I do not believe that the graph was assembled as well as it could have been. The graph is confusing on that the axes are not labeled as well as they could be. For example, the vertical axis should be labeled “Percent of readmissions into the hospital” or “Percent of individuals who were not readmitted into the hospital”. I found that in the article the information was not very clear to depict what the graph was showing. There should be a caption underneath the graph to explain the......

Words: 476 - Pages: 2