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

ch1

Anonymous (anonymous@undisclosed.example.com) — 2018-01-17T00:21:04+00:00

Chapter 1 Section 1.1: The Stable Matching Problem The problem stems from the question that could one design a college admissions process, or a job recruiting process, that was self-enforcing, i.e. self-interest would prevent offers from being retracted and redirected, and all the offers would be stable?

ch2

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

Chapter 2 Analyzing algorithms involves thinking about how their resource requirements—the amount of time and space they use—will vary with increasing input size, N. This input size is used to describe efficiency in terms of Big-O notation (to be discussed later).

ch3

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

Chapter 3 In this chapter, we will introduce the basic definitions surrounding graphs, and list a spectrum of different algorithmic settings where graphs arise naturally. We will then discuss some basic algorithmic primitives for graphs, beginning with the problem of connectivity and developing some fundamental graph search techniques.

ch4

Anonymous (anonymous@undisclosed.example.com) — 2018-03-11T06:49:56+00:00

Chapter 4 An algorithm is greedy if it builds up a solution in small steps, choosing a decision at each step myopically to optimize some underlying criterion. One can often design many different greedy algorithms for the same problem, each one locally, incrementally optimizing some different measure on its way to a solution.

ch5

Anonymous (anonymous@undisclosed.example.com) — 2018-03-13T02:48:54+00:00

Chapter 5 Divide and conquer refers to a class of algorithmic techniques in which one breaks the input into several parts, solves the problem in each part recursively, and then combines the solutions to these subproblems into an overall solution. Analyzing the running time of a divide and conquer algorithm generally involves solving a recurrence relation that bounds the running time recursively in terms of the running time on smaller instances.

ch6

Anonymous (anonymous@undisclosed.example.com) — 2018-03-27T00:48:08+00:00

Chapter 6 Sometimes greedy algorithms do not provide fully correct solutions to a problem that we may be trying to solve. We are forced to resort to other approaches to designing algorithms--one such approach is dynamic programming. In dynamic programming, one implicitly explores the space of all possible solutions, by carefully decomposing things into a series of subproblems, and then building up correct solutions to larger and larger subproblems. We can think of dynamic programming as somewha…

ch7

Anonymous (anonymous@undisclosed.example.com) — 2018-04-02T18:49:24+00:00

Chapter 7

home

Anonymous (anonymous@undisclosed.example.com) — 2018-04-02T18:44:57+00:00

Hammad's Wiki * Preface * Chapter 1 * Chapter 2 * Chapter 3 * Chapter 4 * Chapter 5 * Chapter 6 * Chapter 7

preface

Anonymous (anonymous@undisclosed.example.com) — 2018-01-16T21:33:34+00:00

Algorithms have many applications—algorithms are a powerful lens through which the field of Computer Science is viewed in general. Algorithms rarely arrive as a neat, clean package—they are often bundled with messy unnecessities. In attempting to design algorithms for a problem, we must first focus on the correctness of the algorithm, i.e. does it solve the problem, before working on optimizing the algorithm for efficiency. The primary goal of the book is to offer advice on how to identify clean…

sidebar

Anonymous (anonymous@undisclosed.example.com) — 2018-04-02T18:45:12+00:00

Hammad's Wiki * Preface * Chapter 1 * Chapter 2 * Chapter 3 * Chapter 4 * Chapter 5 * Chapter 6 * Chapter 7 ---------- <- Hammad's Wiki <- CSCI 211: Algorithm Design and Analysis