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