DATA STRUCTURES (4/2 Credits)

Learning Outcomes:

On successful completion of this course, student will be able to: LO1 – explain the concept of data structures and its usage in Computer Science; LO2 – illustrate any learned data structures and its usage in application; LO3 – apply data structures using C.

Topics:

1. Pointer and Array Review;
2. Introduction to Data Structure;
3. Linked List I;
4. Linked List II;
5. Stack and Queue;
6. Hashing and Hash Tables;
7. Trees and Binary Tree;
8. Binary Search Tree;
9. Review I;
10. AVL Tree;
11. B-Tree;
12. Red Black Tree;
13. Disjoint Sets;
14. Review II;
15. Heaps;
16. Linked List;
17. Tries and Review I;
18. Graphs and Review II;
19. Stack & Queue;
20. Hash Table;
21. Trees & Binary Tree;
22. Tries;
23. Heap;
24. Disjoint set;
25. Graphs;
26. Quiz.