Course Description

Fall, 2009


Department and Course Number:

SYCS 306-470

Course Title:

Analysis of Algorithms

Course Coordinator:

Dr. Mugizi Robert Rwebangira

Total Credits:


Email Address:

Class Time:

M-W-F 1:10 – 2:00


LKD 2006

Web Site:


1.0 General Course Information


1.1 Current Catalog Description:

Techniques for designing efficient algorithms, analyzing their complexity and applying these algorithms to a broad range of application settings. Methods for recognizing and dealing with hard problems are studied.


1.2 Prerequisites by Topic:

  • SYCS 135: Introductory Programming
  • SYCS 136: Elementary Data Structures
  • SYCS 354: Advanced Data Structures
  • MATH 189: Probability and Statistics
  • MATH 181: Discrete Structures



1.3 Course Staff


Instructor: Dr. Mugizi Robert Rwebangira.

Office:  E-mail me to set up a meeting

Phone: 412-965 6778

Contact Email:

Office Hours: M 5:00pm – 6:00 pm  W, F 2:00pm – 3:00 pm


Teaching Assistants: None


2.0 Learning Resources  


2.1 Required Text

Jeffrey McConnell. Analysis of Algorithms: An Active Learning Approach. Jones & Bartlett. 3rd Edition, 2007.

2.2 Other References:

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. Introduction to Algorithms. McGraw Hill, 2nd edition, 2001.



2.3   Department Resources

Laboratories:  (obtain account logins from Mr. Derssie Mebratu –

  • W. D. Craven Lab (2117 Downing Hall)
  • Sun/HPC Lab (B32-C Mackey Building)



3.0 Aims, Objectives, Program Outcomes                  


3.1 Course Aims

This course introduces the concept of analyzing and comparing algorithms relative to their efficiency in both time and space. Where other courses treat algorithms as either working or non-working, this course considers how well algorithms work based on the size and nature of the problem.

4.0 Assessment

4.1 Assessment Summary

Assessment Task

Due Date


Initial Assessment Exam

First day of class


Homework Assignment 1

September 4th


Homework Assignment 2

September 18th


Homework Assignment 3

October 2nd


Mid Term Exam

October 16th


Homework Assignment 4

October 30th


Homework Assignment 5

November 13th


Final Exam

Examination Period




5.2 Course Grading

Class attendance and participation 15%

5 homework problems 50%

Mid-term exam 15%

1 final exam 20 %

>= 90%                         A

<90% and >= 80%         B

<80% and >= 70%         C

<70% and >= 60%         D

<60%                            F


5. 3 Policy on late projects, research papers, and make-up exams


Late assignments will be deducted 10% per day for each day late. NO make-up exams will be given unless there is a bona fide written doctor’s excuse. In the event that such an excuse is accepted, the deadline will be extended the number of days specified in the excuse.



5.4 Plagiarism Policy


Howard University has adopted a new policy on plagiarism and cheating. In short, all instances of plagiarism will be resolved by an office of the administration, which will conduct the appropriate hearings. See the section entitled "ACADEMIC CODE OF STUDENT CONDUCT" on pages 26-27 of the "Student Reference Manual and Directory of Classes."


5.5 Notices


The Americans with Disabilities Act requires institutions to accommodate the needs of persons with disabilities. If you need special arrangements such as sign language interpreters or audiotapes of lectures, please make an appointment to see me.