Powered by Blogger.

ADVANCED DATA STRUCTURES USING JAVA ( univ of florida )

LECTURE NOTES FOR THE STUDENTS IN PDF AND PPT FORMAT

Lecture

Content
Slides
1
Amortized complexity.

2
Amortized Complexity.

3
Introduction to external sorting.
4
Introduction to external sorting.
5
Selection trees & k-way merging.
6
Run generation.
7
Optimal merging of runs.
8
Buffering.
9
Double-ended priority queues. General methods.
10
Double-ended priority queues. Interval heaps.

11
Leftist trees.
12
Binomial heaps.
13
Binomial heaps.
14
Fibonacci heaps.
15
Pairing heaps.
16
Dictionaries.

17
Optimal Binary Search Trees.
18
AVL trees.
19
AVL trees.
20
Red-black trees
21
Red-black trees.
22
B-trees.
23
B-trees.
24
B+ and B*-trees.
25
Splay trees.
26
Splay Trees.
27
Binary Tries.
28
Compressed Binary Tries.
29
Tries and Packet Forwarding.
30
High-order Tries.
31
Suffix Trees.

32
Bloom Filters.
33
Segment Trees.
34
Interval Trees.
35
Priority Search Trees.
36
Priority Search Trees.
37
Multidimensional Search Trees.
38
Quad Trees.

39
BSP Trees.
40
R-Trees.

Share on Google Plus

About rajasekhar reddy

Author is a Tech savvy and Web Enthusiast by nature and really love to help users by providing how-to posts and tech tutorials. He is a founder and author of technolamp.co.in and programming9.com. YouTube Channel to SUBSCRIBE:
    https://www.youtube.com/user/nvrajasekhar
Available: info@programming9.com
Post a Comment