CS5800 M Algorithms (section 1) Spring 2012
Homepage
Created: Wed 5 July 2006
Last modified:
You have reached the homepage for the
Northeastern
University, College of Computer and Information Science, Spring 2012
session of
Algorithms (Master Level) , also known
as
'CS5800'.Topics covered include Analysis
of Algorithms, Divide and Conquer, Greedy, Dynamic Programming, Amortized
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
- Sunday 4/29, 8PM: Discussing Final grading and overall course grades. "gradeNUMERIC" is an estimate for now, not necessarily the final value.
- If you have an opinion (good or bad) about the TA/grader please express it in an email to me.
I appreciate such opinions, and I will keep them confidential. This
might include grading accuracy, problem understanding/solving,
communication, office hours, schedule, etc.
- Please complete the TRACE evaluations.
- HWs
grades updated. Mon 4/23 : you can pick up HWs from CCIS room 472(ask
for Pavel). You can pick up HWs and/or see me on Tue 4/24 afternoon.
- FINAL EXAM: Wednesday 4/25 @2pm, room CH103(Churchill Hall room 103).The notes, homeworks and book are allowed for the first hour only. No
other materials, no collaborations of any kind, and no electronic
devices (music players, phones etc) are allowed. The test is designed
for three hours, but students can stay more if they choose to (probably
not later than 8PM); so you might consider bringing a beverage and/or
a sandwich.
- Tue 4/17 The topological sort example was incomplete on
purpose, to force you into thinking about that graph: what edges do we need
in it, and what edges should not be in ? I want to emphasize again that
very likely you'll see a problem like this in the final.
- NO
OFFICE HOURS ON MON 04/16. I tried to make it to school, but driving is
impossible today. Ask questions on HW by email. We can talk about
Midterms on:
- Tue 04/17 after class
- Wed 04/18 at 5PM
- Thursday 04/19 after class
- Adjusted Midterm grades are NOT FINAL. The exact adjustment will happen at the end of the term.
- Last HW (11) posted
- HW10 posted, due April 12.
- Prof.
Jay Aslam is lecturing on April 3rd; Dr. Chinmoy Dutta is lecturing on
April 5th. You should not miss to prof. Aslam's lecture; he is the
ultimate algorithms explainer.
- HW9 is up, due April 5th. There will be no office hours on Monday April 2nd (I am in Europe), but I can answer questions by email.
- HW7
slightly updated. No change in what is required, just better written.
Due to the live demo required for grading, will be a bit lenient on the
deadline; please try to see either DoHyong or Aaditya either this
week or the next. Penalties will apply on HW7 demos given after Friday
March 30th.
Grading Responsibility: Aadiyta(Problem1:Hash) Dohyong(Problem2:RedBlackTree)
Tentative schedule for grading demos:
Mar 23: 1pm-3pm(Aadiyta), 3pm - 5pm(Dohyong)
Mar 29: 1pm - 3pm(Aadiyta, Dohyong)
Mar 30: 1pm-3pm(Aadiyta), 3pm - 5pm(Dohyong)
- MIDTERM
is graded out of 180 points(not 200), since the last problem is
actually a bit harder than I thought. (Pb 6 will be graded like the
others, so it is not excluded from exam).
- HW6
posted, due in about 3 weeks, asks you to study/recap Chapter 10 of
CLRS, the introduction to data structures. It should be 100% familiar
material.
- If you happen to solve some of these problems
as preparation for Midterm, you can get Extra Credit points. However
keep in mind that there is a more than just Dynamic Programming and
Greedy for Midterm; in particular Sorting, Partition and
Recurrences.
- Monday Feb 20: Presidents Day, no office hours. I can answer questions Tuesday afternoon .
- MIDTERM: Thursday March 1st, same room as the lecture (IVR 019). Starts at 6PM, not 2:50. There will be no regular class that day at the usual time. The notes, homeworks and book are allowed for the first hour only. No
other materials, no collaborations of any kind, and no electronic
devices (music players, phones etc) are allowed. The test is designed
for three hours, but students can stay more if they choose to (probably
not later than 11PM); so you might consider bringing a beverage and/or
a sandwich.
- Week of Feb 13: This week only, Office hours will not be on Monday 5-7 PM, but on Tuesday 2:30-4PM. Thus HW4 is due Thursday Feb 16 instead.
- Do Hyong office hours are 3-5PM on Fridays.
- Recurrence notes posted (see Syllabus)
- HW1 correction: last problem is 4-3, not 4-4, CLRS 3rd edition.
- HW1 posted, due Jan 24
- Please submit electronically the student information
Course Information
-
Office Hours
- Virgil Pavlu : Mondays 5 - 7PM
WVH room 460, or appointment via email
Course Work
Grades