Solvable Vs Unsolvable Problem Part-2

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/theory-of-computation/regular-language-properties/decidability-basics/asset-solvable-vs-unsolvable-problem-part-2 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Database Management System: 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
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. Theory Of Computation: 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
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video lecture introduces the classification of computational problems using a hierarchical flowchart, distinguishing between solvable and unsolvable problems. The instructor, Sanchit Jain, uses the Konigsberg Bridge Problem as a concrete example to illustrate unsolvability. He demonstrates how to model the physical problem as a graph, calculate vertex degrees, and apply Euler's criterion to prove that no solution exists. The lecture connects this historical problem back to the theoretical framework of decidable and undecidable problems.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a structured flowchart displayed on the screen, serving as the central visual aid for the lecture. The diagram is titled with the branding "KNOWLEDGE GATE EDUCATOR" and identifies the instructor as "Sanchit Jain Sir." The flowchart categorizes computational problems starting from the top node labeled "PROBLEM." This root node branches into two primary categories: "SOLVABLE" and "UNSOLVABLE." The "SOLVABLE" branch is further subdivided into "DECIDABLE" and "UNDECIDABLE," which then split into "P TYPE" and "NP TYPE" at the bottom level. The instructor uses this structure to introduce the theoretical framework of computability. He explains that not all problems can be solved by algorithms, setting the stage for distinguishing between solvable and unsolvable problems. The visual hierarchy helps students understand the relationship between these concepts, positioning "P TYPE" and "NP TYPE" as subsets of decidable problems, while "UNDECIDABLE" sits alongside "UNSOLVABLE" in the broader context of problem classification. The blue and white color scheme of the boxes helps distinguish the different levels of the hierarchy clearly. The instructor likely discusses the definitions of these terms, emphasizing that "Decidable" means a solution can be found in finite time, while "Undecidable" implies no algorithm exists. He gestures towards the diagram to guide the viewer's attention through the levels.

  2. 2:00 – 5:00 02:00-05:00

    The lecture transitions to a concrete historical example known as the "Konigsberg Bridge Problem." A diagram appears showing a river with two islands and two mainland sections, labeled A, B, C, and D. Seven bridges are depicted connecting these landmasses as white rectangles crossing blue river lines. The instructor begins the process of mathematical abstraction, converting the physical map into a graph theory model. He draws nodes to represent the landmasses and edges to represent the bridges. This transformation is critical because it allows the application of graph theory rules to determine solvability. He carefully sketches the connections, ensuring the graph mirrors the physical layout where landmass A is connected to the others via multiple bridges. The instructor emphasizes the importance of this modeling step, showing how real-world problems can be translated into mathematical structures to analyze their properties. The visual shift from the hierarchy to the map marks a transition from theory to application. He likely explains that the goal is to find a path that crosses every bridge exactly once without retracing steps. He uses a digital pen to draw the graph on the right side of the screen, creating a clear visual representation of the problem.

  3. 5:00 – 9:07 05:00-09:07

    The instructor analyzes the graph derived from the Konigsberg map to determine if a path exists that crosses every bridge exactly once. He calculates the degree of each vertex, which corresponds to the number of bridges connected to each landmass. He identifies that landmass A has a degree of 5, while landmasses B, C, and D each have a degree of 3. He explains Euler's criterion for an Eulerian path: a graph allows such a path if and only if it has zero or exactly two vertices with an odd degree. Since all four vertices in the Konigsberg graph have odd degrees (5, 3, 3, 3), he concludes that the problem is unsolvable. He then returns to the initial hierarchy diagram, circling "UNSOLVABLE" and "UNDECIDABLE" in red ink to categorize the Konigsberg problem within this framework. He writes "P -> S" and "P -> S?" to symbolize the search for a solution, reinforcing that for this specific problem, the answer is definitively "no solution." This connects the abstract hierarchy back to the concrete example, solidifying the concept of unsolvability. The use of red ink for annotations highlights the key conclusions drawn from the analysis. He likely emphasizes that this is a classic example of an unsolvable problem in the history of mathematics. He points to the specific nodes in the graph to illustrate the odd degrees.

The lecture effectively bridges theoretical computer science concepts with a classic mathematical puzzle. By starting with a hierarchy of problems, the instructor establishes a framework for understanding solvability. The Konigsberg Bridge Problem serves as a practical application, demonstrating how graph theory can be used to prove unsolvability. The visual transition from the abstract flowchart to the concrete map and back again reinforces the connection between theory and practice, helping students grasp the significance of undecidable problems.

Loading lesson…