| 13-3-2023 |
1.5 hours |
Course Overview, Introduction to Different Data Structures. Data Types, Primitive Data types, Non – Primitive Data Types |
|
|
|
1.5 hours |
Abstract data types, (ADT’s), Data Structures, Lists, ADT List Operations |
|
|
| 20-3-2023 |
1.5 hours |
Complexity Analysis & Big Oh Notation |
|
|
|
1.5 hours |
ADT Stacks, ADT Stack Operations, and implementation |
|
|
| 27-3-2023 |
1.5 hours |
Implementation of stack using STL library (Push, Pop, Swap) |
|
|
|
1.5 hours |
Infix, Prefix, Postfix notation, Conversions. Postfix Expression Evaluation. |
|
|
| 3-4-2023 |
1.5 hours |
Implementation of Selection sort, Bubble Sort |
|
|
|
1.5 hours |
Implementation of Insertion Sort |
|
|
| 10-4-2023 |
1.5 hours |
Implementation of List as Singly Link List |
|
|
|
1.5 hours |
Implementation of List as Singly Link List( Insertion at the start, Insertion at the end and Insertion at a specific position) |
|
|
| 17-4-2023 |
1.5 hours |
Implementation of List as Singly Link List( Deletion Searching and Display operations) |
|
|
|
1.5 hours |
Implementation of Doubly Linked List( Insertion and Deletion Operations) |
|
|
| 24-4-2023 |
1.5 hours |
Implementation of Doubly Linked List( Searching and Display Operations) |
|
|
|
1.5 hours |
Stack Operations implementation using Circular Linked List |
|
|
| 1-5-2023 |
1 Hour |
Mid Term |
|
|
| 8-5-2023 |
1.5 hours |
Stack Operations implementation using Doubly Circular Linked List |
|
|
|
1.5 hours |
Stack Operations implementation using Doubly Circular Linked List |
|
|
| 15-5-2023 |
1.5 hours |
Queue , Dequeue & its implementation using arrays |
|
|
|
1.5 hours |
Priority queues, Circular queues using arrays |
|
|
| 22-5-2023 |
1.5 hours |
Divide and conquer algorithms |
|
|
|
1.5 hours |
Binary Tree, Strictly Binary Tree, Complete Binary Tree |
|
|
| 29-5-2023 |
1.5 hours |
Divide and conquer algorithms |
|
|
|
1.5 hours |
Binary Tree, Strictly Binary Tree, Complete Binary Tree |
|
|
| 5-6-2023 |
1.5 hours |
Implementation of BST |
|
|
|
1.5 hours |
Tree Traversal: Three Tick method |
|
|
| 12-6-2023 |
1.5 hours |
AVL Trees, Operations on AVL Tree |
|
|
|
1.5 hours |
Heaps, Min Heaps, Max Heaps |
|
|
| 19-6-2023 |
1.5 hours |
Implementation of Heap sort |
|
|
|
1.5 hours |
Min Balanced BST, Max Balanced BST |
|
|
| 26-6-2023 |
1.5 hours |
Graphs, Types of Graphs |
|
|
|
1.5 hours |
Adjacency matrix and adjacency list implementations |
|
|
| 3-7-2023 |
2 Hour |
Final Term |
|
|
