|
|
|
In English |
|
|
Introduction to Algorithms, Second Edition
| מחבר: Author: Автор: مؤلف: | Thomas H. Cormen (Editor), Charles E. Leiserson, Ronald L. Rivest and Cliff Stein |
| הוצאה לאור: Published by: Издательство: دار نشر: | Cambridge, Mass. : MIT Press and McGraw-Hill, c2001 |
| ISBN: | 0262032937 |
| קישור: Link: Ссылка: وصلة: | http://aleph.technion.ac.il/F/?func=item-global&doc_library=TEC01&doc_number=002232918 |
| הערות: Notes: Примечания: ملاحظات: | Topics covered in the course, sorted by the order they are covered in the lectures:
1. Growth of functions: Chapter 3 (pages 41-61)
Recurrences: Chapter 4 (pages 62-75)
Stacks and Queues: Chapter 10.1 (pages 200-203)
2. Linked Lists: Chapter 10.2 (pages 204-208)
3. Binary Search Trees: Chapter 12 (pages 253-264)
4. AVL: None.
5. B+ Trees: None.
Augmenting Data Structures: Chapter 14 (pages 302-310)
6. Skip lists: None.
Amortized analysis: Chapter 17.1 (pages 406-409)
7. Hash Tables: Chapter 11 (pages 221-244)
8. Disjoint sets: (Union Find): Chapter 21 (pages 498-508)
9. Heaps: Chapter 6 (pages 127-144)
Quicksort: Chapter 7 (pages 145-164)
10. Median and Order statistics: Chapter 9 (pages 183-196)
Sorting in linear time: Chapter 8 (pages 165-182)
11. Strings: None.
12. Representation of Graphs: Chapter 22.1 (pages 527-530)
13. Garbage Collection: None. |
Introduction to algorithms
Data structures & their algorithms
Data structures and algorithms
Fundamentals of data structures in Pascal
Algorithms on strings, trees, and sequences : computer science and computational biology
|
|
|
|
In Hebrew |
|
|
חוברות שקפים
.ניתן להשיג בבית הסטודנט חוברות מודפסות המכילות את כל חומר ההרצאות והתרגולים המופיע באתר הקורס
|
|
