Foundations II: Data Structures and Algorithms

CSE 2331, Spring, 2019


Course Summary

Design/analysis of algorithms and data structures; divide-and-conquer; sorting and selection, search trees, hashing, graph algorithms, string matching; probabilistic analysis; randomized algorithms; NP-completeness.


Course Information


Instructor: Dr. R. Wenger
Office hours: See my office hours.
Text: "Introduction to Algorithms," Third Edition, by Corman, Leiserson, Rivest and Stein.
Syllabus: Download syllabus.

Enrolled students should see carmen for more information.



Course notes (Lectures 1): Asymptotic notation.
Course notes (Lecture 2): Analysis of for/while loops.
Course notes (Lectures 3): Analysis of recursive algorithms and recurrence relations.


Homework 1: Due Mon, Jan 14. Please hand in the homework at the beginning of class.



Modulo arithmetic calculator: http://ptrow.com/perl/calculator.pl


Last Updated by R. Wenger :  Jan 6, 2019