This is an old revision of the document!


Chapter 1

This chapter discusses one problem in details and introduces 5 types of problems of distinct complexities.

Section 1: Stable Matching

This section talks about the stable matching problem. It first introduces the problem and the associated history. Then a solution is given in details. Next, the solution algorithm is analyzed. Last, the book states some properties of the algorithm and gives out proofs. 

Most and the most core materials in this section are covered in class. Thus the reading is relatively less interesting. But it helps organize the lecture materials well. The readable score is 2.

1.2: 5 Representative Problems

Summarize the section, issues, what you figured out, readability, …


courses/cs211/winter2011/journals/wendy/chapter1.1295448691.txt.gz · Last modified: 2011/01/19 14:51 by shangw
CC Attribution-Noncommercial-Share Alike 4.0 International
Driven by DokuWiki Recent changes RSS feed Valid CSS Valid XHTML 1.0