Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| courses:cs211:winter2011:journals:david:chapter1 [2011/01/19 00:49] – [1.2 - Five Representative Problems] margoliesd | courses:cs211:winter2011:journals:david:chapter1 [2011/01/19 00:59] (current) – [1.2 - Five Representative Problems] margoliesd | ||
|---|---|---|---|
| Line 14: | Line 14: | ||
| ====1.2 - Five Representative Problems==== | ====1.2 - Five Representative Problems==== | ||
| - | We have to be mathematically precise in how we define in order to write and prove an algorithm for it. Graphs can show pairs between two sets of data. The Interval Scheduling Problem attempts to maximize the number of individuals that can use a resource when each individual requests a specific time interval (a starting and stopping time, not simply a length of time). The Weighted Interval Scheduling Problem attaches weights to each individual' | + | We have to be mathematically precise in how we define in order to write and prove an algorithm for it. Graphs can show pairs between two sets of data. The Interval Scheduling Problem attempts to maximize the number of individuals that can use a resource when each individual requests a specific time interval (a starting and stopping time, not simply a length of time). The Weighted Interval Scheduling Problem attaches weights to each individual' |
| + | |||
| + | I give this section a 7/10 for readability. | ||
