This is a collection of lectures notes . My subjective is to help
students to find all engineering notes with different lectures slides in
power point, pdf or html file at one place. Because we always
face that we lose much time by searching in Google or yahoo like search
engines to find or downloading a good lecture notes in our subject area. Also it is difficult to find popular authoress or books slides with free of cost.
If you have any good class notes/lecture slides in ppt or pdf or html format then please you upload these files to rapidshare.com and send me links or all files by my email address girdhar.gopal@gmail.com.
Lecture
|
Content
|
Reading
|
Slides
|
1
|
Amortized complexity.
|
Web resource.
| |
2
|
Amortized Complexity.
|
Web resource.
| |
3
|
Introduction to external sorting.
|
Section 7.10.1.
| |
4
|
Introduction to external sorting.
|
Section 7.10.1.
| |
5
|
Selection trees & k-way merging.
|
Sections 5.8 and 7.10.2.
| |
6
|
Run generation.
|
Section 7.10.4.
| |
7
|
Optimal merging of runs.
|
Section 7.10.5.
| |
8
|
Buffering.
|
Sections 7.10.3.
| |
9
|
Double-ended priority queues. General methods.
|
Sections 9.6, 9.7, and Web resource.
| |
10
|
Double-ended priority queues. Interval heaps.
|
Sections 9.6, 9.7, and Web resource.
| |
11
|
Leftist trees.
|
Section 9.2.
| |
12
|
Binomial heaps.
|
Section 9.3.
| |
13
|
Binomial heaps.
|
Section 9.3.
| |
14
|
Fibonacci heaps.
|
Section 9.4.
| |
15
|
Pairing heaps.
|
Section 9.5.
| |
16
|
Dictionaries.
|
Section 5.7.
| |
17
|
Optimal binary search trees.
|
Section 10.1.
| |
18
|
AVL trees.
|
Section 10.2.
| |
19
|
AVL trees.
|
Section 10.2.
| |
20
|
Red-black trees.
|
Section 10.3.
| |
21
|
Red-black trees
|
Section 10.3.
| |
22
|
B-trees.
|
Section 11.2.
| |
23
|
B-trees.
|
Section 11.2.
| |
24
|
B+ and B*-trees.
|
Section 10.3.
| |
25
|
Splay trees.
|
Section 10.4.
| |
26
|
Splay trees.
|
Section 10.4.
| |
27
|
Binary tries.
|
Sections 12.1 and 12.2
| |
28
|
Compressed binary tries.
|
Section 12.2.2.
| |
29
|
Higher order tries.
|
Section 12.3 and Web resource.
| |
30
|
Tries and packet forwarding.
|
Section 12.5.
| |
31
|
Suffix Trees.
|
Section 12.4 and Web resource.
| |
32
|
Bloom Filters.
|
Section 8.4.
| |
33
|
Segment Trees.
| ||
34
|
Interval Trees.
| ||
35
|
Priority Search Trees.
|
References.
| |
36
|
Priority Search Trees.
|
References.
| |
37
|
Multidimensional Search Trees.
|
References.
| |
38
|
Quad Trees.
|
References.
| |
39
|
BSP Trees.
| ||
40
|
R-trees.
|
No comments:
Post a Comment