CSG113 M Algorithms

Homepage

Created: Wed 5 July 2006
Last modified: 

You have reached the homepage for the Northeastern University, College of Computer and Information Science, Fall 2008 session of Algorithms (Master Level) , also known as 'CSG113'.Topics covered include Analysis of Algorithnms, Divede and Conquer, Greedy, Dynamic Programming, Amortised Analysis, Graph Algorithms, and other advanced topics. To take the course, students are expected to have a basic background in math (linear algebra, probabilities, calculus), some familiarity with algorithm design (sorting, greedy, graphs) and  a basic background in programming.

This document, and all documents on this website, may be modified from time to time; be sure to reload documents on occasion and check the "last modified" date against any printed version you may have.

New

• We plan to have final grades available Monday April 27th morning, and send them to the registrar at 2PM. Students can (and should) stop by between 12-2PM on Monday for a final look at the grades, before we send them.
• HW8 and HW9 graded and ready for pick up.

• Final Exam: Friday April 24th, starts at 3PM, ends at 11PM. Room: 105 Shillman. Open notes, no electronic devices except for handheld calculators. Please return the midterms.

• All Extra Credit up to HW 10 due on April 8.
• Midterm : Thursday Feb 26th 6PM, (open notes, open time, no electronic devices except handheld calculators) Room : 135SH
• Please submit electronically the student information

Course Information

• Basic course information

• Office Hours

  • Virgil : Mondays 4 - 6PM, WVH room 250 or appoinment via email
  • Zhifeng: Fridays, 3:30 - 5PM WVH room 266
  • Kewei:

• Syllabus (subject to change)

Course Work

• Homeworks

• Midterm
• Final Exam

Grades

• Grades computation
• See your grades