CSE 2331 - Spring 2016
Foundations II: Data Structures and Algorithms
Announcements:
The first CSE 2331 review session, on the analysis of for/while loops,
will be in 436 Bolz, Tue. Jan. 19th, 6-7 p.m, by Prof. Rephael Wenger.
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:
Algorithms .
by S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani (free draft
available).
Syllabus:
PDF Office hours:
By grader: Dachuan Huang,huangda@cse.ohio-state.edu ,
Slides:
Asymptotic Notation and Analysis of For/While
Loops Recursive Algorithms and Recurrence Relations Probabilistic Algorithms and Analysis Heaps and Data Structure Analysis Binary Search Trees Red Black Trees Graph Algorithms Min Spanning Tree and Shortest Path Max Flow NP Completeness
Problem Sets:
PS1 (due beginning of lecture on January 19th).PS2 (due beginning of lecture on January 26th).PS3 (due beginning of lecture on February 4th).
(extended deadline)PS4 (due time of midterm exam on February 16th)PS5 (due beginning of lecture on February 25th).Carmen .Review Sessions
Loop Analysis
(Part I) Loop Analysis
(Part II) Recursion (Part I) Recursion (Part
II) Review Session -
Sept. 17, 2014 (Part I) Review Session -
Sept. 17, 2014 (Part II) Review Session -
Sept. 24, 2014 (Part I) Review Session -
Sept. 24, 2014 (Part II)
