DSA with Python – Syllabus (Print-Ready)
1. Python Basics (Foundation)
• Variables, Data Types, Operators
• Conditional Statements: if, if-else, nested if
• Loops: for, while, nested loops
• Functions: definition, arguments, return values, recursion
• Built-in Functions & Modules
2. Data Structures
Linear Data Structures
• Arrays / Lists: Operations (insert, delete, search, traverse)
• Strings: Manipulation, slicing, pattern problems
• Stacks: Implementation using list / deque, Applications (expression evaluation, parentheses
matching)
• Queues: Simple queue, Circular queue, Priority queue
• Linked Lists: Singly, Doubly, Circular; basic operations
Non-linear Data Structures
• Trees: Binary Tree, Binary Search Tree (BST), Tree Traversals (Inorder, Preorder, Postorder)
• Heaps: Min Heap, Max Heap, Heap operations
• Graphs: Representation (Adjacency List/Matrix), BFS, DFS, Shortest Path (Dijkstra, Bellman-Ford)
3. Algorithms
• Sorting: Bubble, Selection, Insertion, Merge, Quick, Heap Sort
• Searching: Linear, Binary Search
• Recursion: Factorial, Fibonacci, Backtracking
• Greedy Algorithms: Activity Selection, Coin Change
• Dynamic Programming: Knapsack, LCS, Matrix Chain Multiplication
• Graph Algorithms: BFS, DFS, Dijkstra, Bellman-Ford, MST (Prim, Kruskal)
4. Complexity Analysis
• Time Complexity (Big O, Big Theta, Big Omega)
• Space Complexity
• Analysis of Recursive Algorithms
5. Problem Solving & Practice
• Python-specific tricks: List comprehension, Dictionaries, Sets, Tuples
1
• Competitive Programming style questions
• Previous Year GATE / Placement / Coding Test questions
✅ Recommended: Focus on Arrays, Strings, Recursion, Trees, Graphs, DP, Sorting/Search algorithms for
both GATE & interviews.
