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 :

Pointer and Array Review ; Pointer, Array and Struct ; Single Linked List & Stack ; Introduction to Data Structure ; Linked List I ; Double Linked List & Queue ; Hash Table ; Linked List II ; Stack & Queue ; Binary Search Tree I ; Binary Search Tree II ; Hashing and Hash Tables ; Quiz 1 ; AVL Tree I ; AVL Tree II ; Trees & Binary Tree ; Heap ; Disjoin Sets ; Binary Search Tree ; Final Exam ; Tries ; Review I ; AVL ; B-Tree ; Red Black Tree ; Heaps; Disjoint Sets ; Graphs ; Review II