http://servo.ad.wlu.edu/dokuwiki/ 2026-04-18T06:21:11+00:00 http://servo.ad.wlu.edu/dokuwiki/ http://servo.ad.wlu.edu/dokuwiki/lib/exe/fetch.php/wiki/dokuwiki-128.png text/html 2014-01-16T07:02:06+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2014/journals/colin/chapter1?rev=1389855726&do=diff Chapter 1: Introduction 1.1 - Stable Matching The Stable Matching Problem was created by David Gale and Lloyd Shapley in 1962 based on the question: Could one design a college admissions process, or a job recruiting process, that was self-enforcing? text/html 2014-01-23T06:47:45+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2014/journals/colin/chapter2?rev=1390459665&do=diff Chapter 2: Basics of Algorithm Analysis 2.3 - Implementing the Stable Matching Algorithm Using Lists and Arrays Arrays and Lists An array is able to maintain a list of elements either sorted either numerically or alphabetically to allow for O(log n) access via binary search. Arrays are not good for maintaining dynamically changing lists. text/html 2014-02-02T23:55:05+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2014/journals/colin/chapter3?rev=1391385305&do=diff Chapter 3: Graphs 3.1 - Basic Definitions and Applications A graph is made up of nodes and edges. A directed graph consists of a set of nodes and a set of directed edges. Most graphs are undirected. Applications of graphs include transportation networks, communication networks, information networks, social networks, and dependency networks. text/html 2014-03-05T19:16:41+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2014/journals/colin/chapter4?rev=1394047001&do=diff Chapter 4: Greedy Algorithms 4.1 - Interval Scheduling: The Greedy Algorithm Stays Ahead A subset of requests is compatible if no two of them overlap in time, accepting the largest compatible subset possible. Compatible sets of maximum size are optimal. text/html 2014-03-12T05:56:01+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2014/journals/colin/chapter5?rev=1394603761&do=diff Chapter 5: Divide & Conquer Divide and conquer deals with breaking inputs into parts, solving recursively, and then combining solutions. 5.1 - A First Recurrence: The Mergesort Algorithm Mergesort sorts a given list of numbers by first dividing them into two equal halves, sorting each half separately by recursion, and then combining the results of these recursive calls using the linear-time algorithm for merging sorted lists. text/html 2014-03-26T05:09:36+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2014/journals/colin/chapter6?rev=1395810576&do=diff Chapter 6: Dynamic Programming 6.1 - Weighted Interval Scheduling: A Recursive Procedure Our Interval Scheduling algorithm from the previous chapter does not take into account weighted job values. For this problem, we use dynamic programming. Arrange the finish times of jobs in ascending order. Jobs that don’t overlap are compatible. text/html 2014-04-02T07:16:53+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2014/journals/colin/chapter7?rev=1396423013&do=diff Chapter 7: Network Flow 7.1 - The Maximum-Flow Problem and the Ford-Fulkerson Algorithm Network models have capacities along edges (how much they can carry), source nodes (sending traffic), and sink nodes (receiving traffic). Given a flow network, find a flow of maximum possible value. text/html 2014-04-02T07:06:01+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2014/journals/colin/home?rev=1396422361&do=diff Colin's Wiki Journal Chapter 1: Introduction Chapter 2: Algorithm Analysis Chapter 3: Graphs Chapter 4: Greedy Algorithms Chapter 5: Divide & Conquer Chapter 6: Dynamic Programming Chapter 7: Network Flow