http://servo.ad.wlu.edu/dokuwiki/ 2026-05-11T23:17:27+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-16T19:02:27+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/thetfordt/chapter1?rev=1516129347&do=diff Chapter 1 1.1: A First Problem: Stable Matching The section begins by walking through the context/problem which inspired the creation of the Stable Matching problem; two mathematical economists asked whether or not someone could design a college admissions/job recruitment process which was self-enforcing. I liked that the section began comparing the algorithm to a summer internship application process, as this made the section directly relatable. text/html 2018-01-29T20:32:20+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/thetfordt/chapter2?rev=1517257940&do=diff Chapter 2 - Basics of Algorithm Analysis Section 2.1 - Computational Tractability This section begins by outlining some goals in how we will diagnose themes and design principles surrounding algorithms. However, the focus then shifts to the concept of efficiency. As 2.1 progresses, the author takes logical steps towards a working definition of efficiency. We desire it in our algorithms, and we need a careful definition of it such that we can achieve it in our problem-solving as we move forward… text/html 2018-02-05T19:37:52+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/thetfordt/chapter3?rev=1517859472&do=diff Chapter 3 - Graphs Section 3.1 - Basic Definitions and Applications This section offers a very broad introduction to graphs themselves. We are offered a definition of graphs: a collection of both edges and nodes, where the edges connect the nodes. There are also both directed and undirected graphs. In a directed graph, the edges actually have a tail and a head. The author then walks through various examples of graphs so that we can have a better sense for exactly how and what they represent. text/html 2018-03-12T00:17:56+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/thetfordt/chapter4?rev=1520813876&do=diff Chapter 4 - Greedy Algorithms Section 4.1 - Interval Scheduling: The Greedy Algorithm Stays Ahead The section begins by bringing back a problem from earlier in the text: the Interval Scheduling Problem. In this problem, we are given a set of requests with start and finish times, and we are asked to find the largest subset of requests such that none of the times overlap. We want to devise a greedy algorithm to solve this problem. text/html 2018-03-12T17:06:49+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/thetfordt/chapter5?rev=1520874409&do=diff Chapter 5 - Divide and Conquer Section 5.1 - A First Recurrence: The Mergesort Algorithm This section introduces the Divide and Conquer algorithms as a whole by starting with the MergeSort algorithm. The text first covers the logic behind the algorithm. We take an input of size n, split this input into two pieces of equal size, solve the two subproblems separately by recursion, and then combine these two solutions to form an overall solution for the initial problem. And we only spend linear ti… text/html 2018-03-26T18:32:51+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/thetfordt/chapter6?rev=1522089171&do=diff Chapter 6 - Dynamic Programming Section 6.1 - Weighted Interval Scheduling: A Recursive Procedure The section begins by outlining the problem which we are seeking to solve. It is the same interval scheduling problem from earlier in the text, except now, the intervals have weights assigned to them and we want to maximize the total weight. text/html 2018-04-02T15:53:54+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/thetfordt/chapter7?rev=1522684434&do=diff Chapter 7 - Network Flow Section 7.1 - The Maximum-Flow Problem and the Ford-Fulkerson Algorithm The section begins by defining the problem. We will be examining directed graphs with weights along the edges. These weights denote capacities of traffic that can pass through each node. The section dives into exactly what a flow network is. A flow network contains edges with a non-negative number as its capacity, a single source node s, and a single sink node t. text/html 2018-04-01T21:56:52+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/thetfordt/home?rev=1522619812&do=diff Tommy's Wiki * Preface * Chapter 1: Introduction * Chapter 2: Algorithms * Chapter 3: Graphs * Chapter 4: Greedy Algorithms * Chapter 5: Divide and Conquer * Chapter 6: Dynamic Programming * Chapter 7: Network Flow text/html 2018-01-14T17:53:24+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/thetfordt/preface?rev=1515952404&do=diff Preface (pages 1-2) This section briefly introduces the idea of Algorithms and how they play a critical role in problem-solving in today's society. By providing examples of where algorithms lie in today's society, I can relate directly to the importance and purpose of algorithms in modern-day society. The preface also challenged an idea that I held previously: that their purpose is to solve problems in an efficient and clear-cut manner. The Preface suggests that algorithms let people express th…