http://servo.ad.wlu.edu/dokuwiki/ 2026-05-11T23:13:50+00:00 http://servo.ad.wlu.edu/dokuwiki/ http://servo.ad.wlu.edu/dokuwiki/lib/exe/fetch.php/wiki/dokuwiki-128.png text/html 2018-01-16T01:40:45+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/hornsbym/chapter_1?rev=1516066845&do=diff Chapter 1 This chapter deals with the Stable Matching Problem. In Chapter 1.1, the authors sketch out the algorithm and prove the following: (A) The Gale-Shapely algorithm terminates after n2 iterations (B) The final matching is a perfect matching text/html 2018-01-30T04:21:22+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/hornsbym/chapter_2?rev=1517286082&do=diff Chapter 2 These two sections of chapter two deals with the efficiency of algorithms, as well as how an algorithm's running time changes as its input size changes. Both of these are important concepts, as algorithms must work quickly no matter the scale of the problem. text/html 2018-02-07T04:42:57+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/hornsbym/chapter_3?rev=1517978577&do=diff Chapter 3 Section 3.1(Basic definitions) As the title suggests, section 3.1 simply outlines the basic definitions that the book will use when discussing graphs. When we want to keep track of asymmetrical relationships in a graph, we call this a text/html 2018-03-12T02:59:45+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/hornsbym/chapter_4?rev=1520823585&do=diff Chapter 4 Section 4.1 (Interval Scheduling) This section deals with the Interval Scheduling problem, and implements a greedy algorithm to solve it. The interval scheduling problem deals with scheduling job requests. We want to schedule as many jobs as possible, but to do so we need to pick only jobs that do not overlap. Each given job has a beginning and end time. text/html 2018-02-27T02:46:32+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/hornsbym/home?rev=1519699592&do=diff Mitch's Wiki * Prelude * Chapter 1 * Chapter 2 * Chapter 3 * Chapter 4 text/html 2018-01-09T23:08:27+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/hornsbym/prelude?rev=1515539307&do=diff Prelude Algorithms, while mostly associated with computer science, compose fundamental parts of other fields as well. Jon Kleinberg and Eva Tardos cite economics and biology as fields outside of computer science that rely on algorithms. The authors also point out that algorithms very rarely appear as text/html 2018-02-27T02:45:58+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/hornsbym/sidebar?rev=1519699558&do=diff Mitch's Wiki * Prelude * Chapter 1 * Chapter 2 * Chapter 3 * Chapter 4 ---------- <- Mitch's Wiki <- CSCI 211: Algorithm Design and Analysis