Is it Nations or State that fail? Provide examples

to be submitted on Thursday, 5 December 2019

For each assigned book, you’ll have the option of writing one Reading Journal entry of two full pages (2 pages = onto page 3) that critically engages with some aspect of the text, and formulates a brief literary argument. You will be required to turn in FOUR Reading Journals for the EIGHT books that we read, so it is up to you which four you respond to. Reading Journal entries must be posted to your Reading Journal page on the class Canvas page any time before the start of class on the day they are due. If some part of one of our readings speaks to you or you think of something interesting in chapter two, feel free to post your journal in advance of the deadline. Please see the Course Schedule for due dates. Each of the four journals will be worth 25 points, totaling 100 points. No extra credit will be given for additional reading journals turned in beyond four.

Requirements

The primary goal of this assignment is for you to critically (and rather briefly) engage with some aspect of the text, and turn in a reflection in which you analyze some aspect of the text and formulate a brief literary argument. Perhaps you think that Arlen’s search for his father is truly what’s driving his exploration of his heritage, or perhaps you see the character of Arlen’s wife making a distinct difference in the outcome of his search—make a brief case for whatever one argument it is that you want to reflect on, and make at least three textual connections to the readings to support that main argument.

Five points each (totaling 20 points):

• Formulate a clear central argument
• Make at least three textual connections
• Cite any time that you quote
• Follow the below specifics

Assignment Specifics (5 points):

• 2-3 full pages (2 full = onto pg. 3), double-spaced, 12-point standard font.
• Turn in on Canvas before class.
• Number your pages (top right) and type your name in front of the number in the header.
• Make sure you select the entire document and check the “Don’t add space between paragraphs of the same style” box in Microsoft Word.
• Use APA, MLA, or Chicago style for page layout and citation style (depending on what’s most familiar to you from your major).

• create a minimum of one FTA for one of your JSA topics
  • Must have at least 3 levels
  • Calculate Probability (Use your best guess for initial values)
• Use any of the methods from lecture to analyze another hazard listed in your JSAs ( PHA, FTA, FMEA, Bow Tie )

For FTA please follow the same procedure in the file that I have attached ( week 11) see slide 23
The other file that I have attached (ggggg) will have the 5 JSA (tasks)

The general topic is: cleaning high-rise buildings windows

I am applying for my master’s in Engineering Management. Therefore, I need a Statement of Purpose in order to get accepted in the program.

This assignment builds on the solution that you submitted for Lab #11 and uses the same friend network, but this time the friend relationships (edges) have weights, forming a directed, weighted graph.

The new data file is in the module here: fb_weighted.csv

Assignment

Write a program that prompts the user for two people as before, but outputs the lowest cost path between them.

The program should consider the friend edge weights between the ‘from’ person and the ‘to’ person and compute the cost of the path as well as be able to output the list of nodes and friend edges used:

The code in this file: fb_weights_starter.cpp adds some additional fields to the Person data structure starting with the example from Lab #11, and a new function dijkstra(), which implements the Dijkstra single-source shortest paths algorithm. The pseudocode for the algorithm is described on pages 653-654 of the textbook. After the function runs, two fields in the Person structure will contain current information and you can use this to output the best cost path and the edges used.

• The ‘best_parent’ field contains the string ID of the previous node used along the cheapest path to reach it (in other words, the “parent” node in the best path).
• The ‘best_weight’ field contains the cheapest cost (the sum of all the weights along this path).

The algorithm should stop when it locates the lowest path to the destination node.

After calulcating the best path, to complete the assignment add the remaining code in main() which should output the edges used in order — starting from the ‘from’ person and ending with the ‘to’ person.

Hint: if you start with the end node, you can rebuild the path backwards following each ‘best_parent’, then use a stack to reverse the output.

What to Submit

Submit only your .cpp file for the solution.

Example Input/Output

The output does not need to match exactly the example below, but should include at least the cost of the path and a list of the nodes used. Here are a few examples. Note that even though two people may have a direct connection (be friends), the cheapest path may take a different route. Here, Umar and Lema have a direct connection of weight 7, but the cheapest path is weight 4 and traverses 4 nodes.

Enter the starting name (X to quit): Umar

Enter the ending name (X to quit): Lema
The best path between these two people is: 
	Umar
	Saim Shah Hamdani
	Arwen
	Sara
	Lema
The cost of this path is: 4

Enter the starting name (X to quit): Tommy

Enter the ending name (X to quit): Amir
The best path between these two people is: 
	Tommy
	Mohsin Khan
	Dennis
	Umar Patek
	Amir
The cost of this path is: 5

Enter the starting name (X to quit): Gabriel

Enter the ending name (X to quit): Varga Melinda
There is NOT a path between these two people.

Enter the starting name (X to quit): X

Exiting...