DATA STRUCTURES (4/2 Credits)

Learning Outcomes:

On successful completion of this course, student will be able to: Explain the concept of data structure and its usage in application; Apply data structure in application; Illustrate the usage of data structure in application.

Topics:

Pointer, Array and Introduction to Data Structure; Pointer, Array, and Introduction to Data Structure; Introduction to Linked List; Linked List I; Linked List II; Linked List Implementation I; Linked List Implementation II; Stack and Implementation; Introduction to Tree, Binary Tree and Expression Tree; Queue and Implementation; Stack and Implementation; Tree & Binary Tree; Binary Search Tree; Queue and Implementation; AVL Tree; Introduction to Binary Search Tree and Threaded Binary Tree; Heap; Material Review 1.1; Material Review 1.2; Tries & Hashing; Graph I; Quiz I; Quiz I Review; Binary Search Tree; 2-3 Tree and B Tree; 2-3 Tree; B Tree I; Balanced Binary Search Tree; Heap, Tries & Hashing; Red Black Tree I; Red Black Tree II; Graph; Heap; Material Review 2.1; Material Review 2.2; Quiz 2; Quiz 2 Review