SI335 - Computer Algorithms, Spring 2009
Dr. Chris Brown
- Associate Professor Christopher W. Brown,
- Introduction to Algorithms, 2nd Ed., Cormen
Leiserson, Rivest & Stein, McGraw Hill, 2001.
- Extra Instruction
- You are encouraged to come in for
extra instruction (EI) when you are having trouble. EI can be
scheduled in advance, or you can drop by and, if I am
available, I'll help you. I'm willing to try and answer
questions via e-mail, but for many problems face-to-face is
more appropriate, so my response to an e-mail question may
be "Come in and see me."
The break-down on your final grades will be:
- 25%: Final Exam The final exam will be cumulative,
but will emphasize the last 6 Weeks of the course.
- 30%: Exams 1 and 2
- 20%: Quizzes There will be approximately five
take-home quizzes. They are required to be your own
work completely - no consultation with other people.
- 15%: Projects There will be three projects,
they will be individual or group projects as assigned.
The standard CS Department policy on programming
projects will apply. Project are due by close of
business on the stated "due date", which is taken to
mean that they must be in by the time your professor
arrives on the next business day. Late projects will be
assessed a penalty of 3^n points, where n is the number of
- 10%: Homeworks Expect a small assignment after
every class. Assignments will be due at the beginning of
the class following the assignment. Homeworks will be
graded simply as 100, 50, or 0. If each problem has been
attempted in a reasonable way - i.e. not necessarily
correct but, in my estimation, attempted, and if the
homework is legibly written (better yet typed), you will
receive 100 for it.
If part of the assignment has been attempted in a
reasonable way, then you will receive a 50.
Otherwise, you'll be
given a zero.
No late submissions will be accepted without an excused
Mid-semester grades for the 6-Week and 12-Week marking
periods will be calculated by extrapolating exam, quiz
project and homework grades by the work completed up
to that point. Any changes to the grading policy will be
announced in class and be reflected by changes in this
You may collaborate as much as you like on homeworks, but
the actual pencil-to-paper or fingers-to-keyboard effort
must be your own.
All work on exams, projects and quizzes should be your own, unless
otherwise specified by me.
- Learning Objectives - Course goals
- Demonstrate an understanding of a variety of classic
standard algorithms; (maps to Program Outcome CS a)
- Employ a variety of standard techniques to devise efficient algorithms on their own; (maps to Program Outcome CS a)
- Compare and analyze the performance of
algorithms. (maps to Program Outcomes CS a and PO
- Understand the ethical issues and responsibilities of
designing an algorithm that would render modern
encryption techniques useless and its local and global
impact on society. (maps to Programs Outcomes PO e and
- Program Outcomes - Goals for the whole major
to which this course contributes
- (PO e) An understanding of professional, ethical, legal, security, and social issues and responsibilities;
- (PO f) An ability to communicate effectively (in writing) with a range of audiences.
- (PO g) An ability to analyze the local and global impact of computing on individuals, organizations and society;
- (CS a) An ability to apply mathematical foundations,
algorithmic principles, and computer science theory in
the modeling and design of computer-based systems in a
way that demonstrates comprehension of the tradeoffs
involved in design choices
- Section Leader
The duties of the section leader include:
- calling the section to attention at the beginning and end of class
reporting absences to the instructor
- contacting the department office (3-6800, Room 346) if
the instructor is more than 10 minutes late for class
- directing the class in productive work if the instructor is absent
- Classroom Decorum
Beverages are permitted in classrooms and labs provided they
are in closed containers. No food is permitted in classrooms
Christopher W. Brown