[[courses:cs211:winter2011:journals:camille:chapter1]]
Trace: • chapter3 • 5.3_counting_inversions
Show page
Recent ChangesSitemap

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
courses:cs211:winter2011:journals:camille:chapter1 [2011/01/18 16:30] – cobbccourses:cs211:winter2011:journals:camille:chapter1 [2011/01/31 02:47] (current) – [Section 2: Five Representative Problems] cobbc
Line 1: Line 1:
-====== Chapter 1 ======+====== Chapter 1: Introduction ======
  
 ===== Section 1: Stable Matching ===== ===== Section 1: Stable Matching =====
Line 11: Line 11:
     * **Readability:**      * **Readability:** 
 I found this section very readable. I used the presentation, analysis and proof of the G-S Algorithm as a review rather than trying to understand it based soley on what's written in the book and it worked well for that (I'm not sure how I would have felt about the book's presentation of the algorithm without the priming of our class, though). For me, the most useful part of this section was the more detailed real-life examples of situations in which this algorithm applies and, particularly, how unstable pairings could create problems.  I found this section very readable. I used the presentation, analysis and proof of the G-S Algorithm as a review rather than trying to understand it based soley on what's written in the book and it worked well for that (I'm not sure how I would have felt about the book's presentation of the algorithm without the priming of our class, though). For me, the most useful part of this section was the more detailed real-life examples of situations in which this algorithm applies and, particularly, how unstable pairings could create problems. 
 +
 +    * **Sara Says:**
 +A difference with graduate school admissions (and maybe this is true in undergraduate 
 +admissions) is that there is a date that is the earliest that schools can ask for a 
 +response/acceptance.  I think it's April 15.  This date protects students and colleges.
 +
 +I think this works with medical school because, like you said, there is centralized 
 +knowledge, e.g., it's known which schools the applicants are most interested in.
 ===== Section 2: Five Representative Problems ===== ===== Section 2: Five Representative Problems =====
  
Line 21: Line 29:
     * **Readability:**      * **Readability:** 
 This section was also very readable. I am glad that they didn't go any farther into the algorithms that could solve these problems (yet) because I would have been lost. The description of the graph math is the only part I found really confusing/difficult to read. It was too symbol-heavy without enough explanation of what the symbols meant. More labels on Figure 1.13 that explained those symbols would have made it a lot easier to read.  This section was also very readable. I am glad that they didn't go any farther into the algorithms that could solve these problems (yet) because I would have been lost. The description of the graph math is the only part I found really confusing/difficult to read. It was too symbol-heavy without enough explanation of what the symbols meant. More labels on Figure 1.13 that explained those symbols would have made it a lot easier to read. 
 +
 +    * **Sara Says:** 
 +"I'm also not sure that I understand how the graphs in Figure 1.13 are (necessarily) 
 +bipartite graphs." --> We'll be talking more about bipartite graphs soon.
 +
 +Yeah, the Five Representative Problems section was hard to read--getting into more than we 
 +need to right now.  It'll be a good review closer to the end of the semester.
courses/cs211/winter2011/journals/camille/chapter1.1295368259.txt.gz · Last modified: by cobbc
Show pageOld revisions
Media ManagerBack to top
CC Attribution-Noncommercial-Share Alike 4.0 International
Driven by DokuWiki Recent changes RSS feed Valid CSS Valid XHTML 1.0