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.

Logistics

• Tuesdays and Thursdays, 9:30 AM – 10:45 AM, Engineering Building #2, Room 102.

• Course slides will be available on PLMS.

• PLMS will serve as our main communication platform.

• Questions are welcome before, during, and after lectures.

• Office hours are available by appointment via email with the instructor.

• TA Office hours are available on PLMS.

Grading

• Four assignments: 60 pts

• Midterm and final terms: 60 pts each

• Course participation: 10 pts

Pervious-semester slides

1. Introduction to Data Structure 

2. C++ Review 

3. Algorithm and Time Complexity 

4. List, Stack, Queue 

5. Tree (1) 

6. Tree (2) 

7. Priority Queue, Heap 

8. Sorting 

9. Binary Search Tree 

10. AVL Tree 

11. B Tree 

12. Dictionary and Hashing 

13. Graph Representation 

14. Graph Traversals 

15. Shortest Path Finding 

16. Minimum Spanning Tree 

17. String 

18. Regular Expression