CSE4/529: Algorithms for Modern Computing Systems
Fall 2016
Prof. Russ Miller
338F Davis Hall
716.645.4737 (rarely, if ever, answered)
Read this before sending e-mail to miller@buffalo.edu
Overview:
This course is concerned with the design, analysis, and implementation
of algorithms for sequential and parallel models of computation. Traditional
algorithmic techniques, including divide-and-conquer, dynamic programming,
and greedy algorithms will be discussed. Models of computation include the
traditional RAM, as well as standard parallel models, such as the
PRAM, array, ring, mesh, hypercube, and pyramid.
We also consider innovative
parallel models that involve dynamic reconfiguration.
In addition, we discuss algorithmic strategies for Network of Workstations, clusters, grids, and clouds.
Problem domains include computational geometry, graph theory, image analysis, sorting, and searching.
Time, space, and processor complexity of solutions to problems are a critical component to the course.
Lecture: TTh, 2:00p-3:20p, Hoch 114
Recitation: Tuesdays, 4:00-4:50p, Baldy 126 (for CSE429), TA will vary from week to week.
Important Dates
- No Class: Tuesday, November 22
- Last Day to Add/Drop Classes: Tuesday, September 6
- Exam I: Thursday, October 13
- Last Day to Resign Classes: Friday, November 11
- Exam II: Thursday, November 17
- Last Day of Classes: Friday, December 9
- Final Exam: Tuesday, December 13, 3:30p-6:30p; Hochstetter 114
Important Information
- Plagiarism in any way, shape, or form, including obtaining an unauthorized copy of the book, will earn you an F in the course.
In addition, other sanctions may be sought, including, but not limited to,
being dismissed from the university.
Feel free to review the departmental policy and university policy on plagiarism and academic integrity.
- Lectures may not be recorded. This includes, but is not limited to, video and audio recording.
- Recitation: There will be recitations this semester only for
undergraduate students (CSE429). It is the policy of the CSE department
that recitations do not meeting during the first week of a semester.
- CSE4/529 will be taught as a graduate-level course in algorithms for modern computing systems.
- There will be no programming projects in this class.
- Class attendance is optional, with the exception of exams, when it is required.
- There will be no makeup exams.
- If you have a medical issue, documentation is required.
- If you have a conflict with the final exam, you must handle the situation in terms of making arrangements in your other class(es).
- This will be a paper and pencil course. There will be
no programming assignments.
- Introduction to Asymptotic Notation
- Learning Outcome (Middle States Accreditation): Ability to understand the fundamental principles of the field of
Analysis of Algorithms.
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.
- Note that this is the 3rd Edition of the book.
Do not purchase or gain access to, either legally or illegally,
the first or second edition of the book.
Do not steal (illegally obtain) the third edition of the book.
Obtaining any edition of the book without purchase through proper channels is illegal and there are consquences to such actions.
- Additional material and citations to relevant material will be made available via this Web site.
Grading Policy:
-
CSE 4/529 is a graduate-level course in Algorithms. CSE 429 students
will be graded separately and on a different scale from CSE 529 students.
- 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.
- 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.
- Final Grades (CSE 429)
- A: 75+
- B: 60+
- C: 50+
- D: 35+
- F: <35
- Final Grades (CSE529)
- A: 85+
- B: 75+
- C: 60+
- D: 50+
- F: <50
- Sample Exams (Midterms only)
- Personnel
- Dr. Russ Miller
- Office Hours: TTh, after class, hallway outside Hoch 114 & by appointment
- T.A.: Jeremy Topolski (jetpolos@buffalo.edu)
- Office Hours (and by appointment)
- Monday: 3:00-5:00p
- Wednesday: 3:00-5:00p
- Friday: 3:00-5:00p
- Office: Davis 301 (TA Lounge)
- T.A.: Frank Schoeneman (fvschoen@buffalo.edu)
- Office Hours (and by appointment)
- Tuesday: 12:00N-2:00p
- Thursday: 12:00N-2:00p
- Office: Davis 301 (TA Lounge)
Disclaimer: I reserve the right to change any part of this
tentative syllabus at any time.
Copyright © 2016 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.