![]() | Name | Last modified | Size | Description |
---|---|---|---|---|
![]() | Parent Directory | - | ||
![]() | 01 - About the Course [Part I Review - Optional] (17 min)/ | 2013-12-16 14:53 | - | |
![]() | 02 - Why Study Algorithms [Part I Review - Optional] (19 min)/ | 2013-12-16 14:53 | - | |
![]() | 03 - Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min)/ | 2013-12-16 14:53 | - | |
![]() | 04 - Big-Oh Notation [Part I Review - Optional] (4 min)/ | 2013-12-16 14:53 | - | |
![]() | 05 - Graph Representations [Part I Review - Optional] (14 min)/ | 2013-12-16 14:53 | - | |
![]() | 06 - Graph Search - Overview [Part I Review - Optional] (23 min)/ | 2013-12-16 14:54 | - | |
![]() | 07 - Dijkstras Shortest-Path Algorithm [Part I Review - Optional] (21 min)/ | 2013-12-16 14:54 | - | |
![]() | 08 - Data Structures Overview [Part I Review - Optional] (5)/ | 2013-12-16 14:54 | - | |
![]() | 09 - Heaps Operations and Applications [Part I Review - Optional] (18)/ | 2013-12-16 14:54 | - | |