W&L Computer Science Wiki - courses:cs211:winter2012:journals:richard

chap1

Anonymous (anonymous@undisclosed.example.com) — 2012-01-24T14:21:46+00:00

Chapter 1 The authors introduce the Stable Matching Problem. They explain a more complicated instance of the SMP first, involving companies with many slots seeking interns. This is to illustrate the potential real-life usefulness of a solution to the problem, I guess.

chap2

Anonymous (anonymous@undisclosed.example.com) — 2012-02-01T02:56:16+00:00

Chapter 2 2.1 The authors start by talking about how, in designing algorithms, efficiency is key. But what exactly does efficiency mean? Well, that is not an easy question. In fact, it's so difficult a question to answer that it took the authors of this book

chap3

Anonymous (anonymous@undisclosed.example.com) — 2012-02-10T18:17:18+00:00

3.1 This section defines graphs, their components, some special types of graphs, and illuminates many of their properties. It talks about some of the applications of graphs and some of the real-world concepts they can model: transportation, communication, information, social, and dependency networks. It defines

chap4

Anonymous (anonymous@undisclosed.example.com) — 2012-03-01T06:04:47+00:00

4 4.1 (and introductory material) The introduction talked about the sort of hazy nature of the definition of what precisely a “greedy algorithm” is--but it defined greedy algorithms as “builds up a solution in small steps, choosing a decision at each step myopically to optimize some underlying criterion.

chap5

Anonymous (anonymous@undisclosed.example.com) — 2012-03-15T03:58:12+00:00

Chapter 5 5.1 This section introduces the idea of Divide and Conquer, and recurrence relations. Divide and Conquer algorithms generally reduce existing polynomial time algorithms to better polynomial time. Mergesort is an example of divide and conquer, it's recurrence relation is T(n)

chap6

Anonymous (anonymous@undisclosed.example.com) — 2012-03-28T03:22:31+00:00

Chapter 6 Intro Describes dynamic programming as “operating dangerously close to brute force...systematically working through the exponentially large set of possible solutions to the problem...without ever examining them all explicitly.” If there were a Hollywood movie

home

Anonymous (anonymous@undisclosed.example.com) — 2012-03-28T00:01:56+00:00

Richard's Journal * First Two Pages of Preface * Chapter 1 * Chapter 2 * Chapter 3 * Chapter 4 * Chapter 5 * Chapter 6

preface

Anonymous (anonymous@undisclosed.example.com) — 2012-01-24T06:20:24+00:00

First Two Pages of Preface The authors explain the importance of algorithms–and moreover, algorithmic thinking. They break down “the algorithmic enterprise” into two steps: “getting to the mathematically clean core”, and identifying appropriate “algorithm design techniques,” whatever those are. They explain that their approach in the book is to present algorithm design as more of a thought process, rather than taking “the most direct route from problem statement to algorithm.”

sidebar

Anonymous (anonymous@undisclosed.example.com) — 2012-04-04T02:40:18+00:00

Richard's Journal Entries * First Two Pages of Preface * Chapter 1 * Chapter 2 * Chapter 3 * Chapter 4 * Chapter 5 * Chapter 6 * Chapter 7 <-Course Wiki Page

trembleinfearmortal

Anonymous (anonymous@undisclosed.example.com) — 2012-04-04T04:02:44+00:00

Chapter 7 Introduction A little overview of bipartite matching and some of the previous applications that were provided in the textbook, and some definitions. A matching is “a set of edges with the property that each node appears in at most one edge.