Advanced Data Structures, SatRaj Sahani
Powerpoint Handouts
Important Notes : -
These are the collection of lectures notes . Our 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 find any copyrighted slides or notes then please inform us immediately by comments or email as following address .I will take actions to remove it. Please click bellow to download ppt slides/ pdf notes. If you face any problem in downloading or if you find any link not correctly work or if you have any idea to improve this blog/site or if you find any written mistake or you think some subjects notes should be include then give your suggestion as comment by clicking on comment link bellow the post (bottom of page) or email us in this address engineeringppt.blogspot@gmail.com?subject=comments on engineeringppt.blogspot.com. I will must consider your comments only within 1-2 days.
If you have any good class notes/lecture slides in ppt or pdf or html format then please you upload these files to rapidshare.come and send us links or all files by our email address engineeringppt.blogspot@gmail.com?subject=comments on engineeringppt.blogspot.com.
To find your notes quickly please see the contents on the right hand side of this page which is alphabetically arranged and right click on it. After clicking immediately you find all the notes ppt / pdf / html / video of your searching subjects.
It is better to search your subject notes by clicking on search button which is present at middle of right side of this web page. Then enter your subject and press enter key then you can find all of your lectures notes and click on it.
Thank you for visiting our site.
Click here to download the files:-
The slides used in class are available in postcript and pdf formats; 2 slides per page, 4 slides per page and 6 slides per page (e.g., Postscript6 is a 6 slide per page postscript file).
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