Scribd
Upload
17 views3 pages

Dsa Roadmap

Uploaded by

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

Dsa Roadmap

Uploaded by

bajajkeshav861
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

General Weekly Study Routine

1. Attend Classes: Pay attention during lectures and take notes.


2. Revise Lecture Notes: Spend 1–2 hours revising the topics discussed during the
week.
3. Practice Coding: Dedicate 2–3 hours every week practicing related problems on
platforms like LeetCode, GeeksforGeeks, or HackerRank.
4. Weekly Assessments: Solve 3–5 problems related to the week’s topics.
5. Lab Experiments: Complete and revise lab experiments thoroughly.

Study Plan

January

 Week 1 (06 Jan – 10 Jan):


o Topics: Data types, Abstraction, ADT, Data Structures, Algorithms,
Pseudocode, Algorithm Analysis.
o Plan:
 Learn basic concepts of ADT and operations on data structures.
 Practice writing pseudocode and analyzing time/space complexity.
 Solve basic problems on algorithm analysis (e.g., time complexity of
loops).
 Week 2 (13 Jan – 17 Jan):
o Topics: Complexity of algorithms, Linear and Binary Search.
o Plan:
 Understand linear and binary search algorithms with complexity
analysis.
 Implement both algorithms in a program.
 Solve problems like finding the first occurrence, last occurrence, and
total count of a number.
 Week 3 (20 Jan – 24 Jan):
o Topics: Arrays and their operations, Stacks.
o Plan:
 Revise array operations (traverse, insert, delete).
 Implement a stack using an array.
 Practice stack problems like finding the nearest greater element.

February

 Week 4 (27 Jan – 31 Jan):


o Topics: Applications of Stacks, Queues.
o Plan:
 Learn infix-to-postfix conversion and postfix evaluation.
 Practice problems involving stack applications.
 Implement a queue using arrays.
 Week 5 (03 Feb – 07 Feb):
o Topics: Applications of Queues, Types of Queues.
o Plan:
 Learn circular queues and priority queues.
 Practice coding problems on queues (e.g., implement a task scheduler).
 Week 6 (10 Feb – 14 Feb):
o Topics: Linked Lists (Single, Double, Circular).
o Plan:
 Learn operations on linked lists (insert, delete, traverse).
 Solve problems on reversing a linked list and merging two sorted
linked lists.
 Week 7 (17 Feb – 21 Feb):
o Topics: Applications of Linked Lists (Stack and Queue implementation).
o Plan:
 Implement stacks and queues using linked lists.
 Practice linked list problems like detecting loops.

March

 Week 8 (24 Feb – 07 Mar):


o Mid-Term Exam Preparation:
 Revise all topics from January and February.
 Solve previous year’s papers or sample questions.
 Week 9 (10 Mar – 14 Mar):
o Topics: Trees (Binary Trees, Binary Search Trees).
o Plan:
 Learn tree terminology and operations.
 Implement binary tree traversal algorithms (inorder, preorder,
postorder).
 Solve problems on binary search trees (e.g., insertion and deletion).
 Week 10–11 (17 Mar – 21 Mar):
o Topics: AVL Tree, B-Tree, Heaps.
o Plan:
 Understand AVL tree rotations (single and double rotations).
 Learn applications of heaps (e.g., heap sort, priority queues).
 Practice problems on tree balancing.

April

 Week 12 (24 Mar – 28 Mar):


o Topics: Graphs (Representations, Traversal Algorithms).
o Plan:
 Learn BFS and DFS traversal.
 Solve graph problems like finding connected components and cycle
detection.
 Week 13 (31 Mar – 04 Apr):
o Topics: Shortest Path Algorithms.
o Plan:
 Understand Dijkstra’s and Bellman-Ford algorithms.
 Solve problems on finding shortest paths and minimum spanning trees.
 Week 14 (07 Apr – 11 Apr):
o Topics: Sorting Algorithms.
o Plan:
 Practice and compare sorting algorithms (Quick Sort, Merge Sort,
Heap Sort).
 Solve problems to identify the best sorting technique for different
scenarios.
 Week 15 (14 Apr – 18 Apr):
o Topics: Hashing.
o Plan:
 Learn different hashing techniques and collision resolution strategies.
 Implement hash tables and solve problems involving hashmaps.
 Week 16 (21 Apr – 25 Apr):
o Revision Week:
 Revise all units thoroughly.
 Solve mock tests and sample problems.

End-Term Preparation (28 Apr – 16 May)

1. Review Notes and Past Papers: Focus on weak areas.


2. Solve Programming Problems: Cover all data structures topics.
3. Time Management: Divide time equally for theory and coding practice.

Resources for Programming and Problem Solving

1. Books:
o“Introduction to Algorithms” by Cormen.
o“Data Structures and Algorithm Analysis” by Mark Allen Weiss.
2. Online Platforms:
o GeeksforGeeks
o LeetCode
o HackerRank
3. YouTube Channels:
o FreeCodeCamp.org
o CodeWithHarry
o Abdul Bari (for algorithms and data structures).

This plan balances learning, coding, and revision to help you excel in your semester. Let me
know if you'd like specific weekly coding challenges! 😊

You might also like