Administrivia
Lecture: TTh, 2:00p-3:20p, Knox 110
Recitation: Tuesdays, 4:00-4:50p, NSC 210 (for CSE429), Ladman Golshanara
- No Class: Thursday, November 26
- Exam I: Thursday, October 15
- Last Day to Drop Classes: TBA
- Exam II: Thursday, November 19
- Last Day of Classes: Friday, December 4
- Final Exam: Tuesday, December 15, 3:30-6:30p, Hoch 114
Recitation: It appears that there will be recitations this semester for
undergraduate students. It is the policy of the CSE department that recitations
do not meeting during the first week of a semester.
Dr. Russ Miller
- Office Hours: TTh, 3:30-4:30p
T.A.: Ladan Golshanara
- Office Hours
- Monday: 9:00-10:50a
- Thursday: 10:00-11:50a
- Friday: 9:00-10:50a
- Office: Davis 338Y-Software Lab
T.A.: Jiang Jialiang
- Office Hours
- Monday: 1:00-3:50p
- Tuesday: 10:00-11:50a
- Wednesday: 1:00-3:50p
- Thursday: 1:00-1:50p
- Office: Davis 302
Preamble:
-
CSE 4/529 is a graduate-level course in Algorithms. Undergraduates will be
graded separately and on a different scale from graduate students.
Prerequisites:
-
Calculus I, Calculus II, and a course in Advanced Data Structures.
- Students should know, and are responsible for,
the material in chapters 1-13 of Introduction to Algorithms,
by Cormen, Leiserson, and Rivest. In addition,
students are also responsible for material on balanced trees
(e.g., AVL, Red/Black, B-trees).
Reading Material:
- Algorithms Sequential & Parallel (Third Edition), R. Miller and L. Boxer, Cengage Learning, 2013.
- Additional material and citations to relevant material will be made available via this Web site.
Grading Policy:
- The first midterm exam will count for 30% of your grade.
- The second midterm exam will count for 30% of your grade.
- The comprehensive final exam will count for 40% of your grade.
- Due to the ratio of students:staff, the grading will NOT be performed by
Dr. Miller. Rather, the grading will be performed by the Teaching Assistants.
- NB: In addition, resources are not currently available to
efficiently/effectively grade homeworks, programming
projects, or other materials, including additional exams/quizzes.
My apologies.
Notes:
- This will be a paper and pencil course. There will be
no programming assignments.
- Plagiarism:
Any plagiarism will earn you an
F in the course. Further, you should be aware that the Department of
Computer Science and Engineering has taken a serious stance in such instances
and may bring you up on charges of academic dishonesty and attempt to
have you expelled from the University.
Please make sure you are aware of both the
CSE and the UB policies on pliagarism and academic integrity.
- Learning Outcome (Middle States Accreditation): Ability to understand the fundamental principles of the field of
Analysis of Algorithms.
Disclaimer: I reserve the right to change any part of this
tentative syllabus at any time.
Copyright © 2015 by Russ Miller.
All rights reserved. No part of this document may be used
in any form by any electronic or mechanical means without permission
in writing by the author.