Scribd
Upload
14 views

DSA Revision Time Table

Uploaded by

maysb062003
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
14 views

DSA Revision Time Table

Uploaded by

maysb062003
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Day Topic

1 Arrays (Basic Operations)


2 Arrays (Advanced)
3 Linked Lists (Singly Linked List)
4 Linked Lists (Doubly Linked List)
5 Linked Lists (Circular Linked List)
6-7 Stacks & Queues (Implementation using Arrays & Linked Lists)
8-9 Trees (Binary Trees)
10-11 Trees (Binary Search Trees)
12-13 Trees (Heaps)
14-15 Hash Tables
16-17 Sorting Algorithms (Bubble Sort, Selection Sort)
18-19 Sorting Algorithms (Insertion Sort, Merge Sort)
20-21 Sorting Algorithms (Quick Sort, Heap Sort)
22-23 Searching Algorithms (Linear Search, Binary Search)
24-25 Graphs (Introduction, Representations - Adjacency Matrix, Adjacency List)
26-27 Graphs (Shortest Path Algorithms - Dijkstra's, Bellman-Ford)
28-29 Graphs (Minimum Spanning Tree Algorithms - Prim's, Kruskal's)
30-31 Dynamic Programming (Introduction, Memoization)
32-33 Dynamic Programming (Examples - Fibonacci, Rod Cutting)
34-35 Backtracking (Introduction, Examples - N-Queens Problem)
36-37 Greedy Algorithms (Introduction, Examples - Fractional Knapsack)
38-39 Bit Manipulation (Basics, Bitwise Operators)
40-41 Recursion (Concepts, Examples)
42-43 Space & Time Complexity Analysis (Big O Notation)
44 Practice Problems (Mix of Topics)
45 Mock Tests/Interviews (Optional)
Resources (Search Online) Focus
GeeksForGeeks, HackerRank Traversal, Searching, Insertion, Deletion
Tutorialspoint, LeetCode 2D Arrays, Multidimensional Arrays, Operations
Programiz, MIT OpenCourseware Creation, Traversal, Insertion, Deletion
InterviewCake, Coursera Creation, Traversal, Insertion, Deletion
Codecademy, edX Creation, Traversal, Insertion, Deletion
Aditya Verma (YouTube), NPTEL Array & Linked List Implementations, Operations (Push, Po
MIT OpenCourseware, GeeksForGeeks Traversals (Inorder, Preorder, Postorder), Operations (Inse
HackerRank, LeetCode Search, Insertion, Deletion, Balancing (AVL Trees)
Programiz, InterviewCake Min/Max Heaps, Implementations, Operations (Insert, Dele
Tutorialspoint, Codecademy Hash Functions, Collision Resolution Techniques
Visualgo (sorting visualizations), GeeksForGeeks Time & Space Complexity Analysis
Aditya Verma (YouTube), HackerRank Time & Space Complexity Analysis, Implementation
Coursera, edX Time & Space Complexity Analysis, Implementation (Partit
MIT OpenCourseware, Programiz Time & Space Complexity Analysis
GeeksForGeeks, Tutorialspoint Graph Terminology, Traversals (DFS, BFS)
LeetCode, InterviewCake Implementation, Time & Space Complexity
HackerRank, Visualgo (graph algorithms visualizations) Implementation, Time & Space Complexity
Aditya Verma (YouTube), MIT OpenCourseware Breaking Down Problems, Memoization Technique
GeeksForGeeks, HackerRank Solving problems using DP Approach
Programiz, LeetCode Backtracking Algorithm, Solving Maze Problems
Tutorialspoint, Coursera Greedy Approach, Solving Scheduling Problems
GeeksForGeeks, HackerRank Bitwise AND, OR, XOR, Left/Right Shift
Codecademy, edX Base Cases, Recursive Calls, Understanding Recursion S
Visualgo (Big O Notation visualizations), MIT OpenCour Understanding O(), Ω(), Θ() Notations, Analyzing Algorithm
LeetCode, HackerRank Practice previously learned concepts
InterviewCake, Pramp Simulate interview environment, Test your knowledge
ays, Operations

tions, Operations (Push, Pop, Enqueue, Dequeue)


ostorder), Operations (Insertion, Deletion)
ancing (AVL Trees)
ns, Operations (Insert, Delete, Heapify)
ution Techniques

ysis, Implementation
ysis, Implementation (Partitioning in Quick Sort)

(DFS, BFS)

oization Technique

Maze Problems
eduling Problems

Understanding Recursion Stack


ations, Analyzing Algorithms

, Test your knowledge

You might also like