Differences

This shows you the differences between two versions of the page.

--- courses:cs211:winter2018:journals:donohuem:home [2018/01/16 18:08] – donohuem
+++ courses:cs211:winter2018:journals:donohuem:home [2018/04/02 13:56] (current) – donohuem
@@ Line 1: / Line 1: @@
 ====== Mark's Wiki ======
-====== Week 1 ======
+  * [[preface|Preface: First two pages]]
-===== Preface =====
+  * [[chapter1|Chapter 1: Section 1.1]]
-The authors begin by stating the prevalence of algorithms and algorithmic ideas across a variety of fields, including biology, economics, and, most importantly, computer science. Although not exclusive to computer science, algorithmic problems form the heart of this field of study. Additionally, the authors explain that this core of computer science can be divided into two fundamental components: understanding the pure mathematics of a problem, and then, based on the problem, choosing the best algorithmic design for solving this problem. Finally, the authors state the objective of the book. They wish to teach not only the raw logistics of an algorithm, but also the motivations and basic design principles behind every algorithm and problem. On a scale of 1 to 10, I would give this section a 6 in terms of readability.
+  * [[chapter2|Chapter 2: Sections 2.1-2.5]]
+  * [[chapter3|Chapter 3: Sections 3.1-3.6]]
+  * [[chapter4|Chapter 4: Sections 4.1, 4.2, 4.4-4.8]]
+  * [[chapter5|Chapter 5: Sections 5.1-5.3]]
+  * [[chapter6|Chapter 6: Sections 6.1-6.3]]
+  * [[chapter7|Chapter 7: Sections 7.1-7.2, 7.5, 7.7]]