| 13-3-2023 |
1.5 hours |
Course Overview, Introduction to Different Data Structures. Data Types, Primitive Data types, Non – Primitive Data Types |
Task 1 |
|
|
1.5 hours |
Abstract data types, (ADT’s), Data Structures, Lists, ADT List Operations |
Task 2 |
|
| 20-3-2023 |
1.5 hours |
Complexity Analysis & Big Oh Notation |
Task1 |
|
|
1.5 hours |
Stacks: Functions and stl |
Task2 |
|
| 27-3-2023 |
1.5 hours |
Infix, Prefix, Postfix notation, Conversions. Postfix Expression Evaluation |
Task 1 |
|
|
1.5 hours |
Recursion and analyzing recursive algorithms |
Task 2 |
|
| 3-4-2023 |
1.5 hours |
Sorting algorithms(Selection sort, bubble sort ) |
Task |
|
|
1.5 hours |
Insertion sort , Quick sort |
Task |
|
| 10-4-2023 |
1.5 hours |
Intro. & Implementation of List as Singly Link List |
Assignment 1 |
|
|
1.5 hours |
Intro. & Implementation of List as Singly Link List( Insertion and deletion function) |
Quiz |
|
| 17-4-2023 |
1.5 hours |
Solving stack problems using Link List Implementation of Queue as Singly Link List |
Task |
|
|
1.5 hours |
Intro. & Applications of Doubly Link List (DLL) |
Task |
|
| 24-4-2023 |
1.5 hours |
Queue / Stack Operations implementation using DLL |
Task |
|
|
1.5 hours |
Intro. & Applications of Circular Link List (CLL) Queue / Stack Operations implementation using CLL |
Quiz 2 |
|
| 1-5-2023 |
1 Hour |
Mid Term |
|
|
| 8-5-2023 |
1.5 hours |
Queue , Dequeue & its implementation using arrays |
Task |
|
|
1.5 hours |
Priority queues, Circular queues using arrays |
Task |
|
| 15-5-2023 |
1.5 hours |
Divide and conquer algorithms |
Assignment # 2 |
|
|
1.5 hours |
Binary Tree, Strictly Binary Tree, Complete Binary Tree |
Task |
|
| 22-5-2023 |
1.5 hours |
Divide and conquer algorithms, |
1,2,4 |
|
|
1.5 hours |
Binary Tree, Strictly Binary Tree, Complete Binary Tree |
|
|
| 29-5-2023 |
1.5 hours |
Implementation of BST |
Assignment 2 |
|
|
1.5 hours |
Tree Traversal: Three Tick method |
Task |
|
| 5-6-2023 |
1.5 hours |
AVL Trees, Operations on AVL Tree |
Assignment 3 |
|
|
1.5 hours |
Heaps, Min Heaps, Max Heaps |
Task |
|
| 12-6-2023 |
1.5 hours |
Implementation of Heap sort |
Task |
|
|
1.5 hours |
Min Balanced BST, Max Balanced BST |
Task |
|
| 19-6-2023 |
1.5 hours |
Graphs, Types of Graphs |
Quiz |
|
|
1.5 hours |
Adjacency matrix and adjacency list implementations |
Task |
|
| 26-6-2023 |
1.5 hours |
Hashing. Hashing Techniques, Collisions & Collisions Avoidance Methods |
Task |
|
|
1.5 hours |
Memory management and garbage collection |
Quiz |
|
| 3-7-2023 |
2 Hour |
Final Term |
|
|
