W&L Computer Science Wiki - courses:cs211:winter2018:journals:shermanc

chapter1

Anonymous (anonymous@undisclosed.example.com) — 2018-01-23T00:51:59+00:00

Chapter 1: Introduction: Some Representative Problems 1.1: A First Problem: Stable Matching This section had to do with the Stable Matching problem which we had already discussed in class. It was interesting to me that this algorithm had actually already been in use by hospitals in picking residents before Shapley's formal definition of it. Also, I liked how it clarified that there can be instances where there are more than one stable matches and also how the side that does the proposing, no…

chapter2

Anonymous (anonymous@undisclosed.example.com) — 2018-01-30T02:49:24+00:00

Chapter 2: Basics of Algorithm Analysis This chapter will attempt to serve as an introduction on understanding the resources required for run times and space usage of different algorithms and how they compare to one another. This will involve discussion of basic algorithms while progressing into more complicated and useful algorithms that require the use of sophisticated data structures.

chapter3

Anonymous (anonymous@undisclosed.example.com) — 2018-02-07T04:26:22+00:00

Chapter 3: Graphs This section will focus, as the title suggests, on graphs and their uses. It will include the basic definitions about graphs and progress into algorithms where graphs “arise naturally”. It will finish off with discussion about connectivity and fundamental graph search techniques.

chapter4

Anonymous (anonymous@undisclosed.example.com) — 2018-03-20T21:30:02+00:00

Chapter 4: Greedy Algorithms This chapter is dedicated to the topic of which most of our upbringings have probably told us to avoid: greediness. But, this type of greedy is more good than bad, a paradox as to what one would normally think when hearing the word

chapter5

Anonymous (anonymous@undisclosed.example.com) — 2018-03-21T07:12:39+00:00

Chapter 5: Divide and Conquer This chapter will discuss algorithms that break down a given input into different parts and then solves the problem in each part recursively, combining each solution to each part into an overall solution. We will learn how to show and understand these

chapter6

Anonymous (anonymous@undisclosed.example.com) — 2018-03-27T05:20:07+00:00

Chapter 6: Dynamic Programming This chapter focuses on dynamic programming, which is described as “living dangerously close to the edge of brute-force search” because it works on the exponentially large set of solutions, but without ever examining each one.

chapter7

Anonymous (anonymous@undisclosed.example.com) — 2018-04-05T05:21:27+00:00

Chapter 7: Network Flow This chapter focuses on algorithms that expand on the Bipartite Matching problem. It creates a polynomial-time algorithm for a general problem, which is the Maximum-Flow Problem, and shows that this is an efficient algorithm for the Bipartite Matching as well.

home

Anonymous (anonymous@undisclosed.example.com) — 2018-04-03T08:59:51+00:00

Collin's Wiki * Preface * Chapter 1: Introduction: Some Representative Problems * Chapter 2: Basics of Algorithm Analysis * Chapter 3: Graphs * Chapter 4: Greedy Algorithms * Chapter 5: Divide and Conquer * Chapter 6: Dynamic Programming * Chapter 7: Network Flow

preface

Anonymous (anonymous@undisclosed.example.com) — 2018-01-16T05:11:56+00:00

Preface The preface held a lot of information that introduced us to the book as well as prepared us for what is to come. An interesting point was that algorithms can be found in almost any line of work, from finance to biology. The first of the topics discussed that are to come was the basic issues in algorithm design. After this, the book will deviate into some review and implementation of algorithms with the structures and previous knowledge we had learned from our introductory CS classes.…

sidebar

Anonymous (anonymous@undisclosed.example.com) — 2018-04-19T20:42:46+00:00