CSE 2331 - Fall 2014

Foundations II: Data Structures and Algorithms

Announcements:

The first CSE 2331 review session, on the analysis of for/while loops, will be in 255 Townshend, Wed, Sept. 3, 5-6 p.m, by Prof. Rephael Wenger. Here is the list of problems with solutions:
Exercises about loop analysis. Solutions.
The second CSE 2331 review session, on the analysis recursive algorithms, will be Wed, Sept 10, 5-6 p.m. 255 Townshend, by Prof. Rephael Wenger and Thurs, Sept 11, 5-6 p.m. 177 Caldwell, by Prof. Rademacher. Here is the list of problems with solutions:
Exercises about recursive algorithms. Solutions.
3rd review session, loops and recursive algorithms: Wed, Sept 17, 5-6 p.m. 255 Townshend, by Prof. Rephael Wenger.
Exercises about randomized algorithms. Solutions. From Wed September 24nd (not on CARMEN).
Review problems from session on Wed Oct 22nd, for some of the topics of midterm 2.

Some Pseudocode

Thought provoking links:

Bentley's chapter on maximum sum subarray
15 Sorting Algorithms in 6 Minutes

Textbook:

Introduction to Algorithms, Second or Third Edition by Cormen, Leiserson, Rivest and Stein.

Recommended reading:

Syllabus:

PDF

Office hours:

By grader: Sanchuan Chen

chen.4825@buckeyemail.osu.edu

Tuesday 4-6pm in Caldwell Lab 420.

By instructor: MWF 2:45-3:45pm in Dreese Labs 495.

Problem Sets:

PS1 (due beginning of lecture on September 12th). Solutions.
PS2 (due beginning of lecture on September 24th). Solutions.
PS3 (due beginning of lecture on October 8th). Solutions.
PS4 (due beginning of lecture on October 15th). Solutions.
PS5 (due beginning of lecture on October 22nd). Solutions.
PS6 (due beginning of lecture on November 17th). Solutions.
PS7 (due beginning of lecture on December 1st). Solutions.
PS8 (due beginning of lecture on December 8st). Solutions (graph corrected on Dec. 9th).

Topics by lecture (tentative)