## Fall, 2010

 Department and Course Number: SYCS 306-470 Course Title: Fundamentals of Algorithms Course Coordinator: Dr. Mugizi Robert Rwebangira Total Credits: 3 Email Address: Class Time: M-W 2:10 – 3:30 Classroom: 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:  LKD 2112C

Phone: 412-965 6778

Contact Email: mugizi@gmail.com

Office Hours: Wed. 6pm

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

• 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

Daily Quiz 40%

Homework 20%

Exams 40%

>= 80%                         A

<80% and >= 70%         B

<70% and >= 60%         C

<60% and >= 50%         D

<50%                            F

4.3 Policy on late projects, research papers, and make-up exams

Late assignments will be given ZERO credit. 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. A penalty of 1% of the final grade will be assessed for each unexcused absence.

4.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.0 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.