[go: up one dir, main page]
Scribd
Upload
8 views2 pages

Data Structures

The document outlines a 4-week learning plan focused on Python programming, covering foundational topics, linear data structures, trees, linked lists, algorithms, and graph theory. Each week includes daily topics, practice exercises, and mini projects to reinforce learning. The final week culminates in a capstone project to apply the skills acquired throughout the course.

Uploaded by

au818218
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
8 views2 pages

Data Structures

The document outlines a 4-week learning plan focused on Python programming, covering foundational topics, linear data structures, trees, linked lists, algorithms, and graph theory. Each week includes daily topics, practice exercises, and mini projects to reinforce learning. The final week culminates in a capstone project to apply the skills acquired throughout the course.

Uploaded by

au818218
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
You are on page 1/ 2

✅ Week 1: Python Foundations & Core Structures

Day Topic Practice

1 Python basics & input/output Print, input(), basic functions

2 Lists & operations Reverse list, find min/max

3 Strings Palindrome, anagram check

4 Tuples, Sets Unique values, set ops

5 Dictionaries Word count, frequency map

6 Recap + Small Challenges HackerRank or LeetCode Easy problems

7 Mini Project Build a simple contact manager


(dict-based)

✅ Week 2: Linear DS – Stack, Queue, Recursion


Day Topic Practice

8 Stack Balanced parentheses

9 Queue & Deque Implement with collections.deque

10 Recursion Basics Factorial, Fibonacci (recursive)

11 Recursion Advanced Binary search (recursive)

12 Stack/Queue Min stack, reverse queue


problems

13 Interview Qs Practice 3–5 problems from LeetCode Easy/Medium

14 Mini Project Infix to Postfix converter (Stack)

✅ Week 3: Trees and Linked Lists


Day Topic Practice

15 Singly Linked List Implement with class


16 Linked List Problems Reverse LL, detect cycle

17 Binary Tree Basics Create & traverse


(pre/in/post-order)

18 DFS & BFS Tree traversal, level order

19 BST (Binary Search Insert, search, delete


Tree)

20 Tree Problems Symmetric tree, height of tree

21 Mini Project Family Tree Viewer (Binary Tree)

✅ Week 4: Algorithms – Sorting, Searching, DP, Graphs


Day Topic Practice

22 Sorting (Bubble, Selection, Merge) Implement each

23 Searching (Binary Search) Find first/last occurrence

24 Greedy Algorithms Activity selection, coin change

25 Dynamic Programming Intro Fibonacci, Climbing stairs

26 DP Advanced 0/1 Knapsack, Longest Subsequence

27 Graphs Basics BFS, DFS using adjacency list

28 Graph Problems Detect cycle, shortest path (Dijkstra)

29 Mock Interview Day Solve 2–3 LeetCode Medium

30 Capstone Project Pick 1: Maze solver, Scheduler, Route


planner

You might also like