Admission now open for 2026

Log In
Craw Security

Programming fundamentals

Data Structures and Algorithms with Python, Taught in Delhi

Strong DSA skills decide whether you can solve unfamiliar problems under pressure. This course starts at zero and works up to graphs and greedy algorithms, with plenty of live coding.

Python basedSaket & Laxmi NagarOnline | Offline
Need Help?
9513805401
Mode
Online | Offline, Hindi | English
Campuses
Saket, Laxmi Nagar (New Delhi)
Level
Beginner to advanced; no prior programming needed

01

Why this subject shows up in every technical interview

Companies that hire software engineers usually test how you think, not which framework you know. Data structures and algorithms give you the vocabulary for that: how to store data, how to search it quickly and how to reason about cost as inputs grow.

This course teaches those ideas in Python, so you spend your time on the logic rather than fighting syntax. Each topic is followed by problems you code yourself, which is how the patterns become automatic.

02

How the classes are run

Live coding

You write solutions alongside the instructor instead of only watching.

Doubt-clearing sessions

Stuck problems are revisited before moving to the next topic.

Projects and assignments

Real-world style exercises tie individual topics together.

Interview preparation

Simulated interviews and pattern practice for coding rounds.

Choice of mode

Join online or attend at the Saket or Laxmi Nagar branch.

03

Who benefits most

  • Beginners who want to learn programming the right way
  • College students preparing for placement tests
  • Job seekers aiming for software engineering or backend roles
  • Self-taught coders who skipped the fundamentals
  • Anyone who wants to sharpen logical thinking

04

Do I need to know programming first?

No. The course begins with fundamental ideas and builds gradually, and prior programming experience is not required. A comfortable relationship with basic school mathematics is enough to start, and the early mathematics module revisits digits, factorials, primes and exponentiation anyway.

Syllabus

What you will study, module by module

Download Syllabus
01Introduction to Data Structures & Algorithms
  • Analysis of Algorithm
  • Order of Growth
  • Asymptotic Notations
  • Big O Notation, Omega Notation, Theta Notation
  • Analysis of common loops
  • Space Complexity
02Mathematics
  • Count Digits
  • Palindrome Numbers
  • Factorial of Numbers
  • GCD (Greatest Common Divisor) & LCM
  • Check For Prime & Prime Factors
  • Computing Power (Exponentiation)
03Recursion
  • Introduction & Applications
  • Checking Palindrome (Recursive)
  • Sum of Digits
  • Tower of Hanoi Problem
  • Visualizing Recursion: Understanding the Stack Trace
04Arrays (Lists in Python)
  • Basics: Introduction, Advantages, Types, Operations (Insert, Delete, Reverse)
  • Searching Algorithms:
  • • Linear Search
  • • Data Structures & Algorithms (DSA) using Python
  • • Binary Search (Iterative & Recursive)
  • Sorting Algorithms:
  • • Bubble Sort
  • • Insertion Sort
  • • Selection Sort
  • • Merge Sort (Divide & Conquer)
  • • Quick Sort
  • • Heap Sort
  • • Counting, Radix, and Bucket Sort
05Hashing
  • Hash Functions (Working & Examples)
  • Collision Handling Techniques
  • Chaining vs. Open Addressing
  • Double Hashing
  • Python’s dict implementation (under the hood)
06Strings
  • String Data Structure in Python (Immutability)
  • Pattern Matching Algorithms:
  • • Naïve Pattern Searching
  • • Rabin Karp Algorithm
  • • KMP (Knuth-Morris-Pratt) Algorithm
07Linked Lists
  • Singly Linked List: Traversal, Insertion, Deletion
  • Doubly Linked List: Forward/Backward Traversal
  • Circular Linked List
08Stacks
  • LIFO Principle (Last In, First Out)
  • Implementation using Array vs. Linked List
  • Expression Parsing: Infix, Prefix, and Postfix
09Queues
  • FIFO Principle (First In, First Out)
  • Implementation using Array vs. Linked List
  • Priority Queue (using Heaps)
10Trees
  • Introduction to Binary Trees
  • Tree Traversals:
  • • Inorder (Left, Root, Right)
  • • Preorder (Root, Left, Right)
  • • Postorder (Left, Right, Root)
  • • Level Order Traversal (BFS)
  • Binary Search Tree (BST): Search, Insert, Delete
  • Self-Balancing Trees:
  • • AVL Tree
  • • Red Black Tree
11Graphs
  • Graph Representation (Adjacency Matrix vs. Adjacency List)
  • Traversals:
  • • Breadth-First Search (BFS)
  • • Depth-First Search (DFS)
  • Minimum Spanning Tree (MST):
  • • Prim’s Algorithm
  • • Kruskal’s Algorithm
  • Shortest Path Algorithms:
  • • Dijkstra’s Algorithm
  • • Bellman-Ford Algorithm
  • • Floyd Warshall Algorithm
12Greedy Algorithms
  • Activity Selection Problem
  • Fractional Knapsack
  • Job Sequencing Problem
  • Huffman Coding

FAQ

Questions people ask before enrolling

Is this DSA course suitable for complete beginners?

Yes. It starts with fundamentals and does not assume earlier programming experience.

Which language is used for teaching?

Python is used for the examples and exercises, including its list and dictionary internals.

Can I attend online?

Yes. Both online and offline modes are available, in Hindi and English.

Which topics are covered?

Complexity analysis, recursion, arrays, sorting and searching, hashing, strings, linked lists, stacks, queues, trees, graphs and greedy algorithms.

Does the course help with coding interviews?

It includes interview-style practice, simulated interviews and pattern-based problem solving.

Where are the classes in Delhi?

At the Saket and Laxmi Nagar branches of Craw Security.

Try a DSA demo class

Book a free demo and see how the problem-solving sessions run.