Title: | Analysis and Design of Algorithms | |
Instructor: | Cezar Câmpeanu | |
Email: | ccampeanu < at > upei < dot > ca | |
Office: | CASS 408 | |
Tel: | (902)566-0485 | |
Textbook: |
Introduction to The Design and Analysis of Algorithms by Anany Levitin Addison-Wesley, 3nd Edition, 2012, ISBN-10: 0-13-231681-1 ISBN-13: 978-13-231681-1 |
|
Course web site: |
Go To: http://www.smcs.upei.ca/~ccampeanu, |
|
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. | |
PREREQUISITE: | CS 261 and Math 242 | |
Essential to review: | elementary symbolic computation(logarithms, trigonomery, polynomials, matrices, exponentials), induction, derivatives, order relations, comparing real valued functions, graph theory. | |
Time and Location: | Tuesday and Thursday 1:00-2:15, CSH 104 | |
Office Hours: | Thursday 11:30-12:30, or anytime by appointment (please send email) | |
Class Meeting: |
Cass 104 on December 4, 2018 from 10:00am to 3 pm
|
|
Midterm: |
Thursday, November 1, 2018
|
|
Final Exam: |
Tuesday, December 11 at 2:00 pm, SDMB 213
|
|
Final MARKS: |
Everything marked. |
|
Please check all your marks. They will be submitted to Registar's Office soon, if no objections are received.
|
||
Merry Christmas and a A Happy New Year!
|
||
ACADEMIC HONESTY: | This course is committed to the principle of academic integrity. Submitted work is expected to reflect an individual effort. Copying or cheating on assignments or tests will be dealt with harshly. Students should read Academic Regulation 20 in the UPEI Calendar at page 104 (http://files.upei.ca/calendar.pdf). | |
Avoiding Plagiarism: | The following link will help you identify and. avoid plagiarism http://resources.library.upei.ca/plagiarism/index.htm. | |
Individual Work Expectations: | You are expected to write your own code, your own proofs, your own examples, and so on. Unless explicitly specified in the assignment's text, the submitted work should be all yours. | |
Grading scheme: |
|
||||||
Course Resources: | |||||||
Important Notices: | Please, check course web site periodically for updates. For any problems concerning the CS361 pages, please contact me. | ||||||