Algorithms
| Description: | This lectures will provide a rigorous introduction to the design and analysis of algorithms. Here we discuss classic problems (e.g., sorting, traveling salesman problem), classic algorithm design strategies (e.g., divide-and-conquer, greedy approaches), and classic algorithms and data structures (e.g., hash tables, Dijkstra's algorithm). We will also analyze algorithm complexity throughout, and touch on issues of tractibility such as "NP-Completeness". |
| Texts: |
Required:
Introduction to Algorithms (Second Edition) by Cormen, Leiserson,
Rivest, and Stein, McGraw-Hill (2001).
This book is similar to the first edition, so you could probably get by with only the first edition. However, all homework problems assigned from the book will be referenced from the second edition; it is your responsibility to find a way to look them up. I strongly recommend that you buy the text rather than borrow it; this is one of only two text books that I still use on a regular basis. It is an indispensable reference. |
| Lectures: | A tentative schedule of lecture topics is given below. The "CULTURE" topics
represent interesting but non-essential material from fields such as computational geometry and
computer graphics; they add some variety to the schedule but also give us some
slack if we get behind schedule. If we cover a "culture" topic
in class, you will be tested on it.
Algorithm notes ppt ( lectures powerpoint slides ). It is a collection of lectures notes not ours. Plese Click bellow to download ppt slides/ pdf notes. If you face any problem in downloading then give your suggetion as comment by clicking on comment link bellow the post (bottom of page) or email us in this address |
No comments:
Post a Comment