Course module

Design & Analysis of Algorithms — DSSSB TGT Computer Science 2026 Section B

Explore the module outline and lessons below. Enroll free to begin studying here.

Lessons: 163
Duration: 25 hr 57 min
PYQs: 58
Practice: 80

Exam importance: 2.1% of the exam, based on section capacity, PYQ history and paper recency.

Syllabus index

Lessons in this module

163 linked lessons

Algorithm Analysis

Algo Basics & Analysis

Asymptotic Notations

Growth Rate Comparisons

Time Complexity Analysis

Sorting Algorithms

Introduction to Sorting

Selection Sort

Bubble Sort

Insertion Sort

Merge Sort

Heap Sort

Quick Sort

Radix & Counting Sort

Comparisons & Searching

Greedy Algorithms

Greedy Basics & Huffman

Optimal Merge Pattern

Fractional Knapsack

Job & Activity Selection

Dynamic Programming

Introduction to DP

LCS & Subsequences

Matrix Chain Order

Floyd & Subset Sum

Minimum Spanning Trees

MST & Kruskal's Algo

MST & Prim's Algo

Shortest Path Algos

Dijkstra’s Algorithm

Bellman-Ford Algo

Advanced Algorithms

Backtracking Technique

Branch and Bound

String Matching Algorithms – Pattern Searching and Text Processing Techniques

Theory of NP-Completeness

Approximation Algorithms

Randomized Algorithms

Algebraic Computation

Module lessons

Lessons

DSSSB - Unit Test - Design & Analysis of AlgorithmsTest

Previous-year questions