CSE431/531: Algorithm Analysis and Design

Course Information

• Lecture: F 5:00-7:50 PM, 215 NSC.
• Registration Numbers: 284104 (431R1),188970(431R2), 271961(431R3), 027658 (531R1), 276820 (531R2), 270700 (531R3)
• Recitations: Friday 11:00 - 11:50 (431R1, 531R1), Wednesday 15:00 - 15:50 (431R2, 531R2), Monday 9:00 - 9:50 (431R3, 531R3)
• Instructor: Ashim Garg
  Office: Room 238, Bell Hall
  Email:agarg@cse.buffalo.edu
  Office Hours: T,W 12:00-1:00 PM

• Teaching Assistants:
  • Tatiana Mihaylova
    Office: Bell 236
    Office Hours: M,W,F 10:00-11:00 AM
    Email:tmihaylo@cse.buffalo.edu
  • Yuanyuan Jia
    Office: Trailer A Desk 6
    Office Hours: M 2:00-4:00 PM, F 2:00-3:00 PM
    Email:yjia@cse.buffalo.edu

• Newsgroup: sunyab.cse.531 Please post in this newsgroup even if you are in CSE431.

• Tentative Course Syllabus (lectures do not necessary follow the order of topics given in the syllabus)

• Required Textbook:
  • "Algorithms Sequential and Parallel: A Unified Approach" by Russ Miller and Laurence Boxer. Publisher: Prentice Hall.
• Recommended Textbook:
  • "Introduction to Algorithms" by Thomas Cormen, Charles Leiserson, and Ronald Rivest, Publisher: McGraw Hill.

• Grading Policy:
  • 2 Exams (50% Exam1, 50% Exam2): Both exams will be closed book. Final grades will be based on your overall exam performance.
  • Homeworks: You must also pass homeworks, i.e., should overall score 60% points. Late homeworks will not be accepted. Written homeworks are due in the beginning of the class on the due date.
  Grading will be based on curve.

  Collaboration and cheating on exams and homeworks will result in an `F'. See the CSE Academic Integrity policy.

• Overall Grades Distribution for the whole course, only for CSE531. Students in CSE431 may see the instructor individually to discuss their performances.

• Midterm Grades Distribution only for CSE531. Students in CSE431 should see the instructor individually to discuss their performances.

• Lecture Slides