CSE4/529: Algorithms for Modern Computing Systems
Fall 2019
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, will be discussed.
Models of computation include the
traditional RAM, as well as standard parallel models, including the shared-memory PRAM, as well as networked models configured as arrays, rings, meshes, hypercubes, and pyramids.
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.
Prerequisites:
- Undergraduate Students: 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. This includes asymptotic notation,
recurrence equations, and quicksort. In addition,
students are also responsible for material on balanced trees
(e.g., AVL, Red/Black, B-trees).
- Graduate Students: An undergraduate course in data structures and/or algorithms. That is, you should have seen selection sort, mergesort, quicksort, and O-notational analysis. You should be comfortable with pointers, lists, stacks, queues, and binary trees.
Lecture: TTh, 2:00p-3:20p, Davis 101
Recitations: As of Fall, 2019, recitations are no longer provided as part of this course. This was a departmental decision.
Important University Information:
Important Dates
- Exam I (in class): Thursday, October 10
- Exam II (in class): Thursday, November 14
- No Class: Tuesday, November 26
- Last Day of Classes: Dec 5
- Final Exam: Tuesday, December 10, 3:30p - 6:30p, Davis 101
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.
- 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 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.
Required 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 conesquences to such actions.
- Additional material and citations to relevant material will be made available via this Web site.
Projected Order of Material:
- NB: Students responsible for Chapts 1-3
- Asymptotic Analysis
- Divide-and-Conquer (Chapt 9)
- Intro to Parallel Algorithms and Architectures (Chapt 4)
- Combinational Circuits and Sorting Networks (Chapt 5)
- Matrix Multiplication (Chapt 6)
- Parallel Prefix (Chapt 7)
- Computational Geometry (Chapt 10)
- Image Processing (Chapt 11)
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.
- Graded Materials
- CSE429
- A maximum of 1 point per week (10 points maximum) for attending
a TAs office hour and having a significant discussion with the TA on
CSE429 material: 10% of your grade.
- Midterm I: 25% of your grade.
- Midterm II: 30% of your grade.
- Final Exam: 35% of your grade.
- Extra Credit: Minimum of 6 points, presented in no guaranteed distribution, over the exams.
- CSE529
- Midterm I: 30% of your grade.
- Midterm II: 30% of your grade.
- Final Exam: 40% of your grade.
- Extra Credit: Minimum of 6 points, presented in no guaranteed distribution, over the exams.
- Course Grades
- CSE 429 Final Letter Grades. These are the final "curved" grades.
These numbers include the additional bonus points (i.e., there will be more
than 100 points available in the course).
There will be "+"s and "-"s that will be determined after the numeric
grading for the semester is complete.
- A: 75+
- B: 60+
- C: 50+
- D: 35+
- F: <35
- CSE 529 Final Letter Grades. These are the final "curved" grades.
These numbers include the additional bonus points (i.e., there will be more
than 100 points available in the course).
There will be "+"s and "-"s that will be determined after the numeric
grading for the semester is complete.
- A: 85+
- B: 75+
- C: 60+
- D: 50+
- F: <50
- Sample Exams (Midterms only)
- Personnel
- Dr. Russ Miller
- Office Hours: TTh, after class & by appointment
- T.A.: Chen Yuan (chyuan@buffalo.edu)
- Office Hours (and by appointment)
- Mondays, 9:00am - 12:00Noon
- Thursdays, 9:00am - 12:00Noon
- Fridays, 1:00pm - 5:00pm
- Office: Davis 301 C
- T.A.: Jiyang Li (jiyangli@buffalo.edu)
- Office Hours (and by appointment)
- Tuesdays, 9:00am - 12:00Noon
- Tuesdays, 3:30pm - 5:30pm
- Wednesdays, 9:00am - 12:00Noon
- Wednesdays, 3:30pm - 5:30pm
- Office: Davis 301 B
- T.A.: Deen Dayal Mohan (dmohan@buffalo.edu)
- Office Hours (and by appointment)
- Mondays, 2:00pm - 5:00pm
- Fridays, 10:00am - 1:00pm
- Office: Davis 113 V
Disclaimer: I reserve the right to change any part of this
tentative syllabus at any time.
Copyright © 2019 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.