Advanced Data Structures

CSE 100

Instructor: Diba Mirza

Email: dimirza@eng.ucsd.edu
Office hours: M 3p-4p, F 11a-noon or by appointment in EBU3b 2124

Teaching Assistants:

Narendran Thangarajan
Ning Liu
Peter Spragins
Vidya Kirupanidhi
Vineel Konduru

Lecture:

Section A: MWF 10a-10:50a, CENTR 115
Section B: MWF 2p-2:50p, PCYNH 106

Discussion sections:

Section A: M 2:00p-2:50, WLH 2005
Section B: W 4:00p-4:50, CENTR 119

Forum: Piazza

Course Links:


Course Summary:


CSE 100 is a course in advanced data structure design, analysis, and implementation. We will study such data structures and applications as balanced trees, tries, graphs, hashing, disjoint subsets and union-find, skiplists, treaps, random number generation, memory management, indexing, and compression. CSE 100 is a prerequisite for all other upper-division programming courses in the CSE major at UCSD.

This web page contains links to the latest information for CSE 100, Fall 2014. You are responsible for knowing this information, so read these links. (When revisiting a link, use the "reload" button on your browser to make sure you have the latest version of a page, and aren't just rereading the old page from your browser cache.)