http://servo.ad.wlu.edu/dokuwiki/ 2026-04-16T17:34:19+00:00 http://servo.ad.wlu.edu/dokuwiki/ http://servo.ad.wlu.edu/dokuwiki/lib/exe/fetch.php/wiki/dokuwiki-128.png text/html 2012-01-19T19:38:11+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/carrie/ch1?rev=1327001891&do=diff Chapter 1 1.1: Stable Matching Problem I read the chapter before we worked on this problem in class and it made everything so simple and easy to understand. I am also in the middle of sorority recruitment and so it seemed very relevant. Since as a member of a sorority we have preferences and the freshman have preferences and this whole week is based on matching the sorority with a pledge class. What is actually really interesting about recruitment that most people don't know is that a computer… text/html 2012-01-23T14:08:11+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/carrie/ch2?rev=1327327691&do=diff Chapter 2 2.1: Computational Tractability The goal of this course is to write correct and efficient algorithms and this sections goes through how we define efficiency. Intial attempt at defining efficiancy: “An algorithm is efficient if when, when implemented, it runs quickly on real input instances text/html 2012-02-14T18:01:46+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/carrie/ch3?rev=1329242506&do=diff Chapter 3 3.1 Basic Definitions and Applications Definitions, definitions and more definitions all about graphs. I know what a graph is, but just to review - edges E, and vertices (u,v) in V make up a graph. e connects from u to v. A graph can be: text/html 2012-03-02T16:51:02+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/carrie/ch4?rev=1330707062&do=diff Chapter 4 Greedy Algorithms “Greed... is good. Greed is right. Greed works” - Wall Street. Greed algorithm definition: * Hard to define * builds up a solution in small steps. * need to prove the greedy algorithm is optimal. Two methods of proof text/html 2012-03-11T22:10:41+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/carrie/ch5?rev=1331503841&do=diff Chapter 5 Divide and conquer * analyzing involves a “recurrence relation” 5.1 A first Recurrence: The Mergesort Algorithm * We've seen mergesort before. Basic example for divide and conquer * divide the input into two pieces of equal size and solve the two subprobles with recursion. text/html 2012-04-02T01:38:03+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/carrie/ch6?rev=1333330683&do=diff Chapter 6 Dynamic Programming divide and conquer - use sub problems and build up to correct sultion. 6.1 Weighted Interval Scheduling A Recursive Prosedure Designing a Recursive Algorithm * need a base case * then a step that makes it smaller, then you call the algorithm again. text/html 2012-04-02T02:06:11+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/carrie/ch7?rev=1333332371&do=diff Chapter 7 7.1 The maximum - flow problem and the ford - fulkerson Algorithm * want to model a flow network * associated with edges are capacity, which is non negative * single source node s * single sink node t * Need to define flow * text/html 2012-04-02T01:39:12+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/carrie/home?rev=1333330752&do=diff Carrie's Journal * Prelude * Chapter 1 * Chapter 2 * Chapter 3 * Chapter 4 * Chapter 5 * Chapter 6 * Chapter 7 text/html 2012-01-11T18:29:06+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/carrie/prelude?rev=1326306546&do=diff Hello! Welcome to my journal. Read the preface to our text: Algorithm Design by Kleinberg and Tardos. It looks like it will be intresting, easy to read and effective. I like that there are solved problems to learn from and the lay out of their text. Pretty excited for a more math based computer science class. text/html 2012-04-02T01:38:40+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2012/journals/carrie/sidebar?rev=1333330720&do=diff * Prelude * Chapter 1 * Chapter 2 * Chapter 3 * Chapter 4 * Chapter 5 * Chapter 6 * Chapter 7 <-Course Wiki Page