Differences
This shows you the differences between two versions of the page.
| courses:cs211:winter2011:journals:charles:preface [2011/01/27 07:01] – created gouldc | courses:cs211:winter2011:journals:charles:preface [2011/01/27 07:08] (current) – gouldc | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | PREFACE | + | ====== Preface ====== |
| Algorithms are pervasive both within and beyond computer science. Understanding algorithms gives a glimpse into the whole of computer science. Two fundamental components of algorithm analysis: determining its mathematical core, identifying an appropriate design. The book builds upon prior knowledge of data structures and programming. It is meant to be read by students who have taken introductory courses in the discipline. A good portion of the book will be dedicated to the notion of computational intractability. We will see that problems can be proved to be NP-complete, | Algorithms are pervasive both within and beyond computer science. Understanding algorithms gives a glimpse into the whole of computer science. Two fundamental components of algorithm analysis: determining its mathematical core, identifying an appropriate design. The book builds upon prior knowledge of data structures and programming. It is meant to be read by students who have taken introductory courses in the discipline. A good portion of the book will be dedicated to the notion of computational intractability. We will see that problems can be proved to be NP-complete, | ||
