Description

Study of fundamental algorithms, data structures, and their effective use in a variety of applications. Emphasizes importance of data structure choice and implementation for obtaining the most efficient algorithm for solving a given problem. A key component of this course is worst-case asymptotic analysis, which provides a quick and simple method for determining the scalability and effectiveness of an algorithm. Other topics covered generally include: divide-and-conquer algorithms, sorting algorithms, decision tree lower bound technique, hashing, binary heaps, skip lists, B-trees, basic graph algorithms. Prerequisites: CSE 131, CSE 240 (or some basic discrete mathematics background) is strongly recommended.

General Information

Instructor
Jeremy Buhler
Location
MW 1:00-2:30 PM, Louderman 458

Announcements

Announcements are not public for this course.
Staff Office Hours
NameOffice Hours
Richard Yu
When?
Where?
Tyler Ponder
When?
Where?
Tina Li
When?
Where?
Josh Katz
When?
Where?
Morgan Redding
When?
Where?
Daniel Margulis
When?
Where?
Christopher Ogle
When?
Where?
Hongkai Chen
When?
Where?
Xiran Liu
When?
Where?
Fernando Rojo
When?
Where?
Alan Soetikno
When?
Where?
Wei Weng
When?
Where?
Zhengdao Chen
When?
Where?
Linxuan Yang
When?
Where?
Ben Bishop
When?
Where?
Bojian Li
When?
Where?
Yinyuan Zheng
When?
Where?