Category Archives: fall 2010

(Guest post by Thirusajee Thanasinganathan) We were talking about the upcoming final exam and new grading policy at the start of the class.

(Guest post by John Montemorano) Monday, December 6 Announcements: Office-Hours-A-Thon on Friday, December 10 Atri – 2:00-3:30 in Bell 123 Jeff – 4:00-5:00 in Bell 224 Alex – 5:00-6:30 in Bell 242

(Guest post by Seon McDonald) In Friday’s (Dec 3rd) lecture, Professor briefly recapped the previous lecture and noted

(Guest post by Anthony Rocco) In Lect. 36 Prof. Rudra  introduced to us a new algorithmic technique known as dynamic programming. Dynamic programming is similar to divide and conquer in the sense that it uses recursion in order to achieve … Continue reading →

(Guest post by Sean Homan) In today’s lecture, Professor Rudra introduced a third class of general techniques for algorithms, Dynamic Programming.  We did not go heavy into the details on the specific characteristics of what a Dynamic Programming algorithm is.  But we … Continue reading →

(Guest post by Chris Fabiano) In Monday’s class, we went over a divide and conquer method for finding the closet two points on a 2 dimensinal graph, the slides of which can be found at Lecture 34.

(Guest Post by Andrew Wantuch) Atri was out of town today so Jeff Delmerico guest lectured. Jeff reminded everyone that there is only 1 more homework assignment left and the final exam so everyone should do their best for the … Continue reading →

(Guest Post by Andrew Carland) Today in lecture we continued Friday’s discussion of how to find the closest pair of points given an input in 2D of points P = {p1,…,pn}’ pi = (xi,yi)

(Guest post by Mike Garricks) Announcements: Professor Rudra will be out of town on Monday, 22nd. Jeff will be holding Monday’s lecture. Professor Rudra’s office hours will also be canceled.

(Guest post by Nick Davidson) On Friday, November 19th, we began lecture continuing with discussion of the divide and conquer approach to the counting inversions problem.