Planning and Scheduling Analysis

Consider Assumptions and Goals  on pg. 77

–    Were they all met in the work you are reviewing?

–    Does the schedule you are viewing make sense in accordance to the digraph? If not, write your version of what would be correct.

–    Define what an optimal schedule entails.

–    Is the schedule you are viewing optimal?

–    What are the ways your book suggest making the completion time earlier? (p. 83)0

–    How might you make the completion time earlier?

Important Terms – Add more…

Processors

Task Ready

Idle

Important Ideas – Add your own!

2.5 Discussion Link

https://docs.google.com/document/d/1QXyz-gSVmjyWh4n4PDo_3dsdYkkhkWW8wF2xVim1dF8/edit

Hamblin Math's Channel

This youtube math teacher offers some clear concise versions of almost all of the subjects chapter 2 covered. I highly recommend checking him out, remarkably helpful.

http://www.youtube.com/user/HamblinMath?feature=watch

Helful Video on Eulerian Circuits

Good stuff starts at 3:00 in first video

Koenigsberg Bridge Problem

Vocabulary: (9:00)

Definition of Eulerian Tour - different from Circuit! (11:30)

 

The answer for question 10a on homework 1: 

Can you draw a graph where every vertex has valence of at least 3 but where removing a single edge disconnects the graph?

To make the graph not connected you have to make it so that they do not touch at all. The two squares are like separate islands. Each vertex has a valence of at least three. 

--Isabel