8 Weeks DSA-Python course plan
Analysis of Algorithm : Best, Average and Worst Case,
Day 1 Notation, Time and Space Complexity.
Mathematics : Sum of Natural Number, Count Digit,
Day 2,3 Palindrome, Factorial, GCD OR HCF and LCM of Two
Week 1
number , check for prime factorization, Divisor of a
Number
List in Python: Average & Mean of list, slicing,
Day 4,5,6 reverse and rotation of List.
Hashing : Hashing function, collision, chaining, set and
Day 7 dictionary in python.
Recursion : Applications, Tower of Hanoi, josephus
Day 1,2 problem
and practise available problems.
Searching : Linear & Binary search, count Occurrence
Day 3, 4 and
Week 2
Recursive binary Search.
Sorting : Bubble, Selection, Merge, Insertion, and Quick
Day 5 & 6 Sort with their analysis.
Linked List : Introduction, Application, Traversal,
Day 7 Search
Linked list: Deletion, Sorting and Reverse of linked list.
Day 1
Circular Linked List : Advantages and Disadvantages,
Week 3
Day 2,3 Traversal, Insertion and Deletion. Attempt Contest 1.
Doubly Linked List: Advantages & Disadvantages,
Day 4,5 Insertion, and Deletion.
Stack : Applications, Implementation, Infix, Prefix, &
Day 6, 7 Postfix evaluation.
Queue : Applications, Implementation, and practice
Day 1, 2 available problems
Week 4
Tree : Introduction, Application, Searching and practice
Day 3, 4, 5 available problems.
Binary Search Tree : Introduction, Application,
Day 6, 7 Searching and practice available problems.
Heap : Introduction, Implementation, Sorting and Build
Day 1, 2 Heap.
Week 5
Bit Magic: Bitwise operation in python, count set bits,
Day 3, 4 power of 2, odd occurring’s, power set using bitwise.
Advanced List : Rotation, stock buy and sell problem,
Day 5, 6, 7 rain water trapping and subarray sum problem, sliding
window and prefix sum technique.
Page | 1
Advance Recursion: rope cutting problem, subset of
Day 1 string, tower of hanoi and printing all permutations
Advanced Searching: Binary Search in python, First and
Day 2, 3 Last Occurrence in array, count 1's in sorted binary list
Week 6
Advanced Sorting: Tail call Elimination in quick sork,Kth
Day 4, 5, 6 smallest and chocolate Distribution problem,Sort Array
with 2,3 types of element, counting sort, bucket sort,radix
sort
Contest
Day 7
Matrix and Hashing : Matrix Traversal and transpose,
Day 1, 2 rotation of matrix, searching in matrix, Union and
intersection of two unsorted array, subarray with given
sum, check for palindrome, largest subarray with given
sum and n/k occurrence.
String: KMP Algorithm, anagram search, lexicographic
Day 3 rank of string, longest substring with distinct character
Stack and Queue: K stack in array, largest area in
Day 4, 5
Week 7
histogram, infix to prefix,infir to postfit ,prefit to post fit
conversion, Queue Implementation using circular list,
reverse queue, designing data structure with min/max
operations
Tree and Binary Search tree: order traversal , vertical
Day 6 traversal of Binary Tree, Binary tree to Doubly Linked
List, LCA of Binary Tree,counting nodes, finding Kth
smallest BST, pair sum with given BST.
Graph: Introduction, Representation, Application of DFS
Day 7 and BFS, solve available practice problem.
Contest
Greedy: Activity selection, Knapsack problem, Job
Day 1 Sequencing Problem:,Huffman Coding
BackTracking: solve all problem in backtracking
Day 2
Dynamic Programming: memoization and tabulation
Day 3, 4,5 methods, LCS, Coin Exchange Problem,LIS, Rope
Week 8
Cutting Problem,Knapsack,Optimal Stategy for a
game,Egg Dropping Puzzle,Palindrome partitioning,
matrix chain multiplication,
Binary Indexed Tree and Disjoint set: Construction,
Day 6 Prefix sum Implementation, find and union operation on
disjoint set, union by rank, kruskal algorithm
Contest
Day 7
**All the Best**
Page | 2
