Computer Science 361
Analysis and Design of Algorithms
September 2017

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
Textbook web site:
Course web site:  

Go To:,
Then follow the links: Faculty, Cezar Campeanu, Personal webpage, Teaching, and CS361 under September 2017.

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, Friday 11:30-12:30, or anytime by appointment (please send email)
Thursday, November 2, 2017
Final Exam:  
Tuesday, December 12, 2017 2:00 PM - 5:00 PM Health Sciences Bldg, 105
Final MARKS:  
Everything Marked
Please check all your marks. They will be submitted to Registar's Office soon, if no objections are received (you have Monday December 18 and Tuesday December 19 for this).
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 (
Avoiding Plagiarism:   The following link will help you identify and. avoid plagiarism
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:
Assignments Midterm Examination Final Examination
36% 30% 34%
Course Resources:
  1. Assignments
  2. Handouts
  3. Moodle login
  4. Assignment Policy
  5. Tentative Schedule
Important Notices: Please, check course web site periodically for updates. For any problems concerning the CS361 pages, please contact me.
To make sure you are viewing the most recent version of this page,press the shift key while clicking on the Reload button.
It is your responsibility to check this page for updates.

Last modified:Wednesday February 14, 2018 at 10:12 pm AST
Cezar Câmpeanu