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
  • Important Information


    1. Calculus I, Calculus II, and a course in Advanced Data Structures.
    2. 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:

    Grading Policy:

    1. 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.
    2. The first midterm exam will count for 30% of your grade.
    3. The second midterm exam will count for 30% of your grade.
    4. The comprehensive final exam will count for 40% of your grade.
    5. Grading will be performed by the Teaching Assistants.
    6. NB: In addition, resources are not currently available to efficiently/effectively grade homeworks, programming projects, or other materials, including additional exams/quizzes. My apologies.
    7. Final Grades (CSE 429)
      • A: 75+
      • B: 60+
      • C: 50+
      • D: 35+
      • F: <35
    8. Final Grades (CSE529)
      • A: 85+
      • B: 75+
      • C: 60+
      • D: 50+
      • F: <50
    9. Sample Exams (Midterms only)

    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.