ADVANCED DATA STRUCTURES - SARTAJ SAHNI- Lecture notes and ppt

Free Download Here

Lecture	Content	Reading	Slides
1	Amortized complexity.	Web resource.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
2	Amortized Complexity.	Web resource.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
3	Introduction to external sorting.	Section 7.10.1.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
4	Introduction to external sorting.	Section 7.10.1.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
5	Selection trees & k-way merging.	Sections 5.8 and 7.10.2.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
6	Run generation.	Section 7.10.4.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
7	Optimal merging of runs.	Section 7.10.5.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
8	Buffering.	Sections 7.10.3.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
9	Double-ended priority queues. General methods.	Sections 9.6, 9.7, and Web resource.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
10	Double-ended priority queues. Interval heaps.	Sections 9.6, 9.7, and Web resource.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
11	Leftist trees.	Section 9.2.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
12	Binomial heaps.	Section 9.3.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
13	Binomial heaps.	Section 9.3.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
14	Fibonacci heaps.	Section 9.4.	Postscript2 Postscript4 Postscript6 PostscriptAnalysis2 PostscriptAnalysis4 PostscriptAnalysis6 pdf2 pdf4 pdf6 PdfAnalysis2 PdfAnalysis 4 PdfAnalysis6
15	Pairing heaps.	Section 9.5.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
16	Dictionaries.	Section 5.7.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
17	Optimal binary search trees.	Section 10.1.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
18	AVL trees.	Section 10.2.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
19	AVL trees.	Section 10.2.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
20	Red-black trees.	Section 10.3.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
21	Red-black trees	Section 10.3.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
22	B-trees.	Section 11.2.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
23	B-trees.	Section 11.2.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
24	B+ and B*-trees.	Section 10.3.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
25	Splay trees.	Section 10.4.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
26	Splay trees.	Section 10.4.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
27	Binary tries.	Sections 12.1 and 12.2	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
28	Compressed binary tries.	Section 12.2.2.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
29	Higher order tries.	Section 12.3 and Web resource.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
30	Tries and packet forwarding.	Section 12.5.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
31	Suffix Trees.	Section 12.4 and Web resource.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
32	Bloom Filters.	Section 8.4.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
33	Segment Trees.		Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
34	Interval Trees.		Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
35	Priority Search Trees.	References.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
36	Priority Search Trees.	References.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
37	Multidimensional Search Trees.	References.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
38	Quad Trees.	References.	Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
39	BSP Trees.		Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6
40	R-trees.		Postscript2 Postscript4 Postscript6 pdf2 pdf4pdf6