sched.w11 - 3 MidTerm #1 8 Binary Search Trees Prog 1 DUE...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Syllabus and Schedule TOPIC Handout Due Jan 4 Intro, Analysis, Max subsequence 6 Max Subsequence, Worst-case analysis Ex 1 11 Bi-Oh notation, Asymptotics 13 Sets ADT, lists, queues Ex 1 DUE 18 Hash functions, and Hashing 20 Heaps, and d-heaps Ex 2 25 ** Away at Conference -- No Lecture ** 27 leftist heaps Prog 1 Ex 2 DUE Feb 1 Review HW 1 and 2, Search Trees.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 3 MidTerm #1 8 Binary Search Trees Prog 1 DUE 10 Balanced Search Trees (AVL) Ex 3 15 Midterm Solutions. Start Splay trees. 17 Splay Trees and Analysis Prog 2 Ex 3 22 B-Trees 24 B-Trees, insert/delete Mar 1 Union Find Data structure Ex 4 Prog 2 DUE 3 Graph Algorithms 8 Graph Algorithms Ex 4 DUE 10 EXAM #2...
View Full Document

This note was uploaded on 12/27/2011 for the course CMPSC 130a taught by Professor Suri during the Fall '11 term at UCSB.

Ask a homework question - tutors are online