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
- Introduction to Data Structure
- Linked List
- Linked List II
- Stack & Queue
- Hashing and Hash Tables
- Trees & Binary Tree
- Binary Search Tree
- AVL Tree
- B-Tree
- Red Black Tree
- Heaps & Tries
- Disjoint Sets
- Graphs
- Review
- Pointer, Array, and Struct
- Single Linked List & Stack
- Doubly Linked List & Queue
- Hash Table
- Binary Search Tree I
- Binary Search Tree II
- Quiz
- AVL Tree I
- AVL Tree II
- Heap
- Disjoint Sets
SOCIAL MEDIA
Let’s relentlessly connected and get caught up each other.
Looking for tweets ...