DATA STRUCTURES (4/2 Credits)

Learning Outcomes:

1. Explain the concept of data structures and its usage in Computer Science
2. Illustrate any learned data structures and its usage in application
3. 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. Introduction to Data Structure
17. Linked List
18. Stack and Queue
19. Hashing and Hash Tables
20. Trees and Binary Tree
21. Binary Search Tree
22. Tries and Review I
23. AVL Tree
24. Graphs and Review II
25. Red Black Tree
26. Heaps
27. Disjoint Sets
28. Introduction to Data Structure
29. Linked List
30. Stack & Queue
31. Hash Table
32. Trees & Binary Tree
33. Binary Search Tree
34. Tries
35. AVL Tree
36. B-Tree
37. Red Black Tree
38. Heap
39. Disjoint set
40. Graphs
41. Quiz