(Latest Revision: Sat Mar 21 13:54:45 PDT 2020 )
cs4440q1Recap.txt
cs4440q1Recap.txt
Section 001 Quiz #1 Answer Information
What you needed to know for each question
- the definition of an instability
- how to carry out the Gale-Shapley algorithm (GSA)
- that the GSA always works, no matter what the input; that the GSA will
produce the same solution regardless of which free man is chosen to propose
next, that the GSA will terminate on any possible input with all men and women
matched; and that there may be stable matchings for a given input that are
different from the matching produced by the GSA.
- the Big-O and Big-Theta of the algorithm for the Interval Scheduling
problem
- how to carry out the algorithm for the Interval Scheduling problem
- the definition of the depth of an Interval Partitioning problem
- the big-O and Big-Theta of the two phases of the algorithm for
the Interval Partitioning problem
- with regard to the Scheduling to Minimize Lateness problem,
that there is an optimal schedule with no idle time;
the definition of an inversion; that an optimal solution
has no inversions; that swapping two adjacent jobs
that are inverted will not increase the maximum lateness of the
schedule; and that a schedule is optimal if it has no inversions
and no idle time.
- the big-O and Big-Theta of the two phases of the algorithm
for the Scheduling to Minimize Lateness problem
- the big-O and Big-Theta of the two versions of Dijkstra's algorithm
that we studied
- how to carry out Dijkstra's algorithm in the manner illustrated
in this example.
Section 002 Quiz #1 Answer Information
What you needed to know for each question
- the definition of an instability
- how to carry out the Gale-Shapley algorithm (GSA)
- that during the execution of the GSA, once a woman becomes engaged,
she never becomes free again, but that men can be rejected and
become free after being engaged; that women 'trade up'
- The overall Big-O and Big-Theta of the algorithm for the
Interval Scheduling problem
- how to carry out the algorithm for the Interval Scheduling problem
- the definition of the depth of an Interval Partitioning problem
- the big-O and Big-Theta of the two phases of the algorithm
for the Interval Partitioning problem
- with regard to the Scheduling to Minimize Lateness problem,
that there is an optimal schedule with no idle time; the
definition of an inversion; that an optimal solution has no
inversions; that swapping two adjacent jobs that are inverted
will not increase the maximum lateness of the schedule; and
that a schedule is optimal if it has no inversions
and no idle time.
- the big-O and Big-Theta of the two phases of the algorithm
for the Scheduling to Minimize Lateness problem
- the big-O and Big-Theta of the two versions of Dijkstra's algorithm
we studied.
- how to carry out Dijkstra's algorithm in the manner illustrated
in this example.