Course module
Section B: Design & Analysis of Algorithms — DSSSB TGT Computer Science 2026 — Section A + Section B
Explore the module outline and lessons below. Enroll free to begin studying here.
Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-COMPLETE-COURSE/design-analysis-of-algorithms after enrolling
- Lessons
- 163
- Duration
- 25 hr 57 min
- PYQs
- 107
- Practice
- 35
Exam importance: 1.2% of the exam, based on section capacity, PYQ history and paper recency.
Syllabus index
Lessons in this module
Algorithm Analysis
Algo Basics & Analysis
Asymptotic Notations
Growth Rate Comparisons
- Growth Rate Comparisons NotesPdf
- Practice Question 1Drm Video
- Practice Question 2Drm Video
- Log Basic PropertiesDrm Video
- Demo: Types of FunctionsStandard Video
- Decreasing FunctionsDrm Video
- Constant FunctionsDrm Video
- Logarithmic FunctionsDrm Video
- Ignore Logarithm BasesDrm Video
- Polynomial FunctionsDrm Video
- Exponential FunctionsDrm Video
- Logarithm Method - Asymptotic ComparisonDrm Video
- Practice QuestionsDrm Video
Time Complexity Analysis
Iterative Loops & Code
- Iterative Loops & Code NotesPdf
- Demo: Basics of Time ComplexityStandard Video
- Space ComplexityDrm Video
- Loops Time Complexity - 1Drm Video
- Loops Time Complexity - 2Drm Video
- Loops Time Complexity - 3Drm Video
- Loops Time Complexity - 4Drm Video
- Loops Time Complexity - 5Drm Video
- Loops Time Complexity - 6Drm Video
- Loops Time Complexity - 7Drm Video
- Loops Time Complexity - 8Drm Video
- Loops Time Complexity - 9Drm Video
- Loops Time Complexity - 10Drm Video
Sorting Algorithms
Introduction to Sorting
Bubble Sort
Insertion Sort
Merge 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
Minimum Spanning Trees
Shortest Path Algos
Dijkstra’s Algorithm
Bellman-Ford Algo
- Bellman-Ford Algo NotesPdf
- Bellman- Ford Algorithm Part-1Drm Video
- Bellman- Ford Algorithm Part-2Drm Video
- Dijakstra and bellaman ford algorithimDrm Video
- DIjakstra algorithim and bellaman ford Practice questionsDrm Video
- single source shortest path practice questionDrm Video
- Practice QuestionDrm Video
- Greedy alogrithimsDrm Video
Advanced Algorithms
Backtracking Technique
Branch and Bound
String Matching Algorithms – Pattern Searching and Text Processing Techniques
Theory of NP-Completeness
Approximation Algorithms
Randomized Algorithms
Module lessons
Previous-year questions
PYQ collectionPYQ Questions17 questionsPYQ collectionPYQ Questions4 questionsPYQ collectionPYQ Questions4 questionsPYQ collectionPYQ Questions25 questionsPYQ collectionPYQ Questions3 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions4 questionsPYQ collectionPYQ Questions3 questionsPYQ collectionPYQ Questions4 questionsPYQ collectionPYQ Questions5 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions7 questionsPYQ collectionPYQ Questions4 questionsPYQ collectionPYQ Questions9 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions11 questionsPYQ collectionPYQ Questions45 questionsPYQ collectionPYQ Questions3 questionsPYQ collectionPYQ Questions2 questionsPYQ collectionPYQ Questions5 questionsPYQ collectionPYQ Questions3 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions2 questionsPYQ collectionPYQ Questions6 questionsPYQ collectionPYQ Questions3 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions4 questionsPYQ collectionPYQ Questions4 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions5 questionsPYQ collectionPYQ Questions4 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions2 questionsPYQ collectionPYQ Questions2 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions3 questionsPYQ collectionPYQ Questions13 questionsPYQ collectionPYQ Questions107 questions
Explore the course
- About Course
- Section A: General Awareness
- Section A: General Intelligence & Reasoning ability
- Section A: Arithmetical & Numerical Ability
- Section A: English Language & Comprehension
- Section A: Hindi Language & Comprehension
- Section B: Programming, Data Structures, OOP & Java
- Section B: Computer Networks, TCP/IP & Network Security
- Section B: Teaching Methodology
- Section B: Digital Electronics / Boolean Logic
- Section B: Operating Systems & Linux
- Section B: Data Base Management System
- Section B: Internet & Web Technologies
- Section B: Computer Fundamentals, IT Basics & Architecture
- Section B: Python Language
- Section B: Software Engineering
- Section B: Mathematics
- Section B: Computer Graphics, Multimedia & Mobile Computing
- Section B: Emerging Trends
- DSSSB Previous Year Paper
- Business Studies and Management