Lecture Notes For All: Data Structures and Algorithms Notes

GoDaddy

$3 .COM at GoDaddy.com! Expires 4/16/13. ...................

Thursday, March 11, 2010

Data Structures and Algorithms Notes

Data Structures and Algorithms


Course Descriptions
Asymptotic notations. Performance measurement. Sorting and searching: algorithms and lower bound. Abstract data types and classes. Data structures: heaps, search trees, tries, and hashing. Graphs: representation, depth-first-search, and breadth-first-search. Exclusions: COMP171H, ISMT227 (prior to 2000-01).
Data Structures and Algorithms notes ppt ( lectures powerpoint slides ). It is a collection of lectures notes not ours. Plese Click bellow to download ppt slides/ pdf notes. If you face any problem in downloading then give your suggetion as comment by clicking on comment link bellow the post (bottom of page) or email us in this address . I will must consider your comments only in 1-2 days. Thank you very much for visit our site



Text book


Data Structures and Algorithm Analysis in C++ (Third Edition)by Mark Allen Weiss
Published by Addison-Wesley, 2007

Source Code


Topics L1 slides L2/L3 slides
Introduction

1 in 1,
6 in 1,
9 in 1,


intro.ppt ,

paradigm.ppt

oop.ppt

listADT.ppt


dynamicObject.ppt


C++ Review

1 in 1,
6 in 1,
9 in 1,

Pointers and Dynamic Objects
1 in 1,
6 in 1,
9 in 1,
Recursion


1 in 1,
6 in 1,
9 in 1,


2. Lists, Stacks, and Queues (Week 4-5)



Linked Lists
1 in 1,
6 in 1,
9 in 1,


dynamicList.ppt

(linkedListAlgorithm.cpp)

dynamicClass.ppt



doublyLinkedList.ppt


stackQueue.ppt



Stacks and Queues
1 in 1,
6 in 1,
9 in 1,




3. Algorithm Analysis (Week 5-6)





Algorithm Analysis


1 in 1,
6 in 1,
9 in 1,





analysis.ppt


summaryAnalysis.ppt





4. Sorting (Week 6-7)


Insertion Sort and Mergesort

1 in 1,
6 in 1,
9 in 1,



insertionMergesort.ppt

quicksort.ppt

radixsort.ppt


heapsort.ppt


Quicksort

1 in 1,
6 in 1,
9 in 1,

Heaps and Heapsort

1 in 1,
6 in 1,
9 in 1,

Lower Bound of Sorting and Radix Sort


1 in 1,
6 in 1,
9 in 1,



5. Trees (Week 7-10)



Binary Trees and Binary Search Trees

1 in 1,
6 in 1,
9 in 1,



bst.ppt

avl1.ppt

avl2.ppt

btree1.ppt

btree2.ppt


AVL Trees

1 in 1,
6 in 1,
9 in 1,

B+ Trees



1 in 1,
6 in 1,
9 in 1,



6. Graph Algorithms (Week 10-12)



Graphs and Breadth-First Search


1 in 1,
6 in 1,
9 in 1,




graphBfs1.ppt

bfs2

dfs.ppt

directed_graph.ppt


Depth-First Search

1 in 1,
6 in 1,
9 in 1,

Connected Components, Directed Graphs, Topological Sort

1 in 1,
6 in 1,
9 in 1,




7. Hashing and Pattern Matching



Hashing


1 in 1,
1 in 6,
1 in 9



hashing.ppt
patternMatching.ppt
Pattern Matching


1 in 1,
1 in 6,
1 in 9



8. Review for final examination



Additional Review


Past final - 2008 |
Past final - 2007


Slides for review



Slides for review







Chapter summary




TopicsSummary
Recursion, List, Stack and Queue Download
Algorithm analysis


Download
Insert, Merge and Quick Sort


Download
Heap, HeapSort, Lower Bound on
Sorting, Counting and Radix Sorting

Download

Tree, Binary Search Tree and AVL

Download

B+ tree

Download

Graph

Download

BFS and DFS algorithms

Download

Connected Components, Directed Graphs and Topological Sort Algorithm

Download

Hashing

Download




Tutorials




Schedule Topic Slides TA

Tutorial 1 (Week2) C++ and OOP Review Slides Victor
Tutorial 2 (Week3) Recursion and math Slides Victor
Tutorial 3 (Week4) Linked-list, stack and queues Slides Peter
Tutorial 4 (Week5) Analysis of algorithms Slides Peter
Tutorial 5 (Week6) Insert and Merge Sort Slides Dai Jie
Tutorial 6 (Week7) Quick and Heap Sort Slides Zhong Lili
(Week 8 - No tutorial) - 23-27,March
Tutorial 7 (Week9) Binary tree Slides Sun Ye
Tutorial 8 (Week10) AVL tree Slides Tang Chun Ki
Tutorial 9 (Week11) B+ tree Slides Zhang Honghui
Tutorial 10 (Week12) Graph, BFS/DFS Slides Bo Zhang
Tutorial 11 (Week13) Direct graph, topological sort Slides Zhang Dian
Tutorial 12 (Week14) Hashing and pattern matching Slides Liu Siyuan Alex

No comments:

Post a Comment