Fundamentals of Complexity Theory
Duration: 5 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics, Combinatorics
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
- C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Theory Of Computation/Automata Theory: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
- Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- DataBase Management System/DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
- Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics
- General Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement, Ratio and Proportion, Vocabulary, Averages, Mixtures and Alligation, Percentages, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Trigonometry, Simplification and Approximation, Constraint Puzzles, Numerical Reasoning, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Assembling and Grouping of Shapes, Cubes and Dice, Profit, Loss and Discount, Mensuration, Probability, Measurement and Quantity Take-Off, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Logical Deduction and Induction, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Clocks and Calendars, Time and Work, Algebra, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Calendar, Alphabet and Word Tests, Sequences and Series, Powers, Surds and Logarithms, Number System, Transformation of Shapes
- English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Verb, Articles, Adverb, Modals, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Articles and Determiners, Adjectives and Adverbs, Modals, Conditionals and Subjunctive, Voice and Reported Speech, Blood Relations, Tenses, Vocabulary
- Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
- Full Mock Test:
- Previous Year Papers:
- GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture presents a hierarchical classification of computational problems, starting with a flowchart that categorizes problems into Solvable and Unsolvable types. The instructor visually constructs this diagram, drawing red arrows to show the relationships between Problem, Solvable, Unsolvable, Decidable, Undecidable, and finally P Type and NP Type. As the lecture progresses, the instructor supplements this flowchart with a Venn diagram in the top-left corner to clarify the relationships between complexity classes P, NP, NPC, and NPH. He annotates the diagram with specific complexity notations, writing polynomial examples like n^2 and n^3 under P Type, and exponential examples like 2^n and 4^n under NP Type, providing a visual guide to understanding problem solvability and complexity classes.
Chapters
0:00 – 2:00 00:00-02:00
The video begins with a static flowchart titled 'PROBLEM' at the top. The instructor starts drawing red arrows to indicate the hierarchy. The chart shows 'PROBLEM' branching into 'SOLVABLE' and 'UNSOLVABLE'. Under 'SOLVABLE', there are branches for 'DECIDABLE' and 'UNDECIDABLE'. Under 'DECIDABLE', the chart splits into 'P TYPE' and 'NP TYPE'. The instructor draws arrows connecting these nodes, visually establishing the flow from general problems down to specific complexity types. He crosses out the word 'PROBLEM' with a red 'X' initially, possibly to signify 'Any Problem' or to clear the slate for explanation.
2:00 – 5:00 02:00-05:00
The instructor shifts focus to the top-left corner to draw a Venn diagram. He sketches a large circle labeled 'NP' and a smaller inner circle labeled 'P'. He then labels the region inside 'NP' but outside 'P' as 'NPC' (NP Complete) and the region outside 'NP' as 'NPH' (NP Hard). Returning to the main flowchart, he writes handwritten notes under the 'P TYPE' box, listing polynomial complexities like 'n^2, n^3, n^4...'. Under the 'NP TYPE' box, he writes exponential complexities like '2^n, 4^n, 4^4...'. This section connects the abstract flowchart with concrete mathematical examples of time complexity.
5:00 – 5:23 05:00-05:23
In the final segment, the instructor reviews the completed diagram. The flowchart is fully annotated with red arrows showing the path from Problem to P/NP types. The Venn diagram in the corner is complete, clearly showing the subset relationship of P within NP, and the distinct regions for NPC and NPH. The handwritten complexity examples remain visible under the P and NP type boxes. The instructor gestures towards the diagram, likely summarizing the key takeaways regarding how problems are classified based on their solvability and computational complexity.
The lecture effectively combines a hierarchical flowchart with a Venn diagram to explain the classification of computational problems. By visually mapping out the relationships between Solvable/Unsolvable and Decidable/Undecidable, and then detailing the P, NP, NPC, and NPH classes with specific complexity examples, the instructor provides a comprehensive visual aid for understanding theoretical computer science concepts.

