Scribd
Upload
13 views3 pages

DSA Weekly Plan

The document outlines a 10-week curriculum covering various computer science topics including mathematics, recursion, data structures (arrays, matrices, strings, linked lists, stacks, queues, trees, heaps, graphs), and algorithms (searching, sorting, dynamic programming). Each week focuses on specific concepts and techniques, providing a structured approach to learning. Key areas include advanced data structures like tries and segment trees, as well as graph algorithms and backtracking.

Uploaded by

Yogesh Baghel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views3 pages

DSA Weekly Plan

The document outlines a 10-week curriculum covering various computer science topics including mathematics, recursion, data structures (arrays, matrices, strings, linked lists, stacks, queues, trees, heaps, graphs), and algorithms (searching, sorting, dynamic programming). Each week focuses on specific concepts and techniques, providing a structured approach to learning. Key areas include advanced data structures like tries and segment trees, as well as graph algorithms and backtracking.

Uploaded by

Yogesh Baghel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

●​ Week 1

○​ Mathematics
○​ Basic Recursion
○​ Arrays: Searching, Sorting, Deleting, Shift, Rotation, Prefix
Sum...

●​ Week 2:
○​ Bit Magic
○​ Matrix: Search, Delete, Insert, Rotate...
○​ Searching: Linear Search, Binary Search, Two pointer
approach…

●​ Week 3:
○​ Sorting: QuickSort and its variation, Mergesort, Counting sort,
Insertion Sort, Heap Sort, Comparator
○​ Hashing: Different Types of Hashing Techniques, Collision
resolution Techniques, Hashing Questions

●​ Week 4:
○​ Strings: Basic Operations, Naive Pattern Search, Other
searching algorithms.
○​ Linked Lists: Singly Linked List, Doubly Linked Lists, Circular
Linked List, Skip List, Doubly Circular

●​ Week 5:
○​ Stacks: Stack Operations, Implementation, Different Questions
○​ Queues: Queue Operations, Implementation, Different
Questions, Deque Operations, Implementation, Different
Questions.

●​ Week 6:
○​ Tree: Binary Tree, Tree Traversal
○​ Binary Search Tree: Search, Insert, Delete and other important
questions, AVL (Basic Introduction)

●​ Week 7:
○​ Heaps: Binary Heap, Questions based on heaps.
○​ Graphs: Types of Graphs, BFS, DFS, Cycle Detection,
Connected Components, Bipartite Graph

●​ Week 8:
○​ Recursion and Backtracking: Backtracking questions, n queen,
rat, knight etc.
○​ Dynamic Programming: Properties (Top Down, Bottom Up,
Optimal Substructures, Overlapping Subproblems).

●​ Week 9:
○​ Graph Algorithms
■​ Shortest Path Algorithms
■​ Connected Components
■​ Bridges
●​ Week 10:
○​ Trie
○​ Segment Tree
○​ Disjoint Set

You might also like