DATA STRUCTURES (4/2 Credits)

Learning Outcomes:

On successful completion of this course, student will be able to: Explain the concept of data structures and its usage in Computer Science; Illustrate any learned data structures and its usage in application; Apply data structures using C.

Topics:

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