Description

Data Structures is an essential area of study for computer scientists and for anyone who will ever undertake any serious programming task. This course deals with the fundamentals of organizing and manipulating data efficiently using clean conceptual models. Students study many of the important conceptual data types, their implementation, and analysis of their efficiency. Topics will cover algorithm analysis, lists, trees, priority queues, dictionaries (hash tables, balanced search trees), graphs, strings (tries, pattern matching), and sorting.

Topics 

1. Introduction to Data Structure [slide]

2. C++ Review [slide]

3. Algorithm and Time Complexity [slide]

4. List, Stack, Queue [slide]

5. Tree (1) [slide]

6. Tree (2) [slide]

7. Priority Queue, Heap [slide]

8. Sorting [slide]

9. Binary Search Tree [slide]

10. AVL Tree [slide]

11. B Tree [slide]

12. Dictionary and Hashing [slide]

13. Graph Representation [slide]

14. Graph Traversals [slide]

15. Shortest Path Finding [slide]

16. Minimum Spanning Tree [slide]

17. String [slide]

18. Regular Expression [slide]