Differences

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

--- courses:cs211:winter2018:journals:shermanc:preface [2018/01/09 22:02] – created shermanc
+++ courses:cs211:winter2018:journals:shermanc:preface [2018/01/16 05:11] (current) – shermanc
@@ Line 1: / Line 1: @@
-====== Chapter 1: Introduction: Some Representative Problems ======
+====== Preface ======
-===== 1.1: A First Problem: Stable Matching =====
+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.  Lastly, we will get into advanced algorithm techniques, along with NP-Completeness and intractability.