| Title: | Analysis and Design of Algorithms | |
| Instructor: | Cezar Câmpeanu | |
| Email: | ccampeanu < at > upei < dot > ca | |
| Office: | CASS 405 | |
| Tel: | (902)566-0485 | |
| Textbook: |
Algorithms: Sequential, Parallel, and Distributed by Keneth A. Berman and Jerome L. Paul, Publisher: Thomson 2005 ISBN 0-534-42057-5 |
|
|
||
| Textbook web site: | http://www.course.com/catalog/product.cfm?isbn=978-0-534-42057-4 | |
| Course web site: |
Go To: http://www.csit.upei.ca, Then follow the links: Faculty and Staff, Cezar Campeanu, Teaching, Winter 2007, CS361 |
|
| General description: | The course will discuss several methods for analyzing time and space complexity of algorithms, algorithm design techniques, including divide and conquer, greedy, dynamic programming, and efficient algorithms for several common computer science problems. Other topics include graph algorithms, searching and sorting algorithms merging and hashing algorithms; and NP-completeness. | |
| Time and Location: | Tuesday and Thursday: 10:00-11:15, CASS 301 | |
| Office Hours: | Tuesday and Thursday 11:30-12:45, 2:30-3:30 | |
|
Midterm March 6, 2007
|
||
|
Final Exam Wednesday, April 11 at 2:00 pm, CASS 301 |
||
| Grading scheme: |
|
||||||||
| Course Resources: | |||||||||
| Important Notices: | Please, check course web site periodically for updates. To view ps documents, you can download Aladdin Ghostview or another free viewer. To view PDF documents,you can download Adobe Acrobat Reader from Adobe site. For operating system like Linux, the viewers are included into the distribution (everything is free and very reliable - for pdf files, please use gv or acroread, rather than xpdf). On Solaris workstation, you can download the files and view them with acroread (pdf) or ghostview (ps). To view them in your browser, you must enable the plug-in (Edit - Preferences - Navigator - Applications, select Portable Document Format (Postscript Document), Edit, click Application, and choose Acrobat, then click ok, and ok). For any problems concerning the CS361 pages, please contact me. | ||||||||
| Note: | Second year students and up that are interested in marking, please check with Michelle McKearney. They must fill out an application. | ||||||||