Solvable Vs Unsolvable Problem Part-1
Duration: 10 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- 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
- 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, 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
- 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
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- 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
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- 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
- 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
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- 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
- 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
- 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
- Engineering Mathematics: Calculus, Vectors
- 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 provides a foundational overview of computational problem classification and introduces the historical Konigsberg Bridge Problem. The instructor begins by presenting a hierarchical flowchart that categorizes all problems into Solvable and Unsolvable types. He further breaks down Solvable problems into Decidable and Undecidable categories, and finally into P Type and NP Type complexity classes. The lecture then transitions to graph theory, using the Konigsberg Bridge Problem as a case study. The instructor illustrates the physical layout of the city with its river and bridges, labeling landmasses A, B, C, and D. He demonstrates how to abstract this physical map into a mathematical graph, explaining the concept of traversing edges (bridges) exactly once. This segment highlights the origins of graph theory and the distinction between solvable and unsolvable problems in a practical context.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the broad classification of problems using a flowchart diagram. The top node is labeled 'PROBLEM', which branches into 'SOLVABLE' and 'UNSOLVABLE'. The instructor points to the 'PROBLEM' box and then the 'SOLVABLE' box, establishing the primary dichotomy. He explains that every problem in computer science falls into one of these two main categories. The visual aid clearly shows the hierarchy, setting the stage for a deeper dive into computability theory.
2:00 – 5:00 02:00-05:00
The lecture delves deeper into the 'SOLVABLE' branch of the flowchart. The instructor draws red arrows connecting 'PROBLEM' to 'SOLVABLE' and 'UNSOLVABLE' to emphasize the relationship. He explains that 'SOLVABLE' problems are further divided into 'DECIDABLE' and 'UNDECIDABLE'. He notes that 'DECIDABLE' problems are those for which an algorithm exists that always halts with a correct yes or no answer. The flowchart also shows 'DECIDABLE' branching into 'P TYPE' and 'NP TYPE', indicating complexity classes. The instructor uses hand gestures to trace the path from the root problem down to these specific types.
5:00 – 10:00 05:00-10:00
The topic shifts to the 'Konigsberg Bridge Problem'. The slide displays a diagram of the city with a river and seven bridges connecting four landmasses labeled A, B, C, and D. The instructor explains the challenge: to find a path that crosses every bridge exactly once. He then converts this physical map into a graph representation, drawing nodes for the landmasses and edges for the bridges. He draws the graph on the right side of the screen, showing nodes A, B, C, D connected by lines. He discusses how this problem was historically significant and led to the birth of graph theory, illustrating the concept of Eulerian paths and circuits.
10:00 – 10:02 10:00-10:02
The video concludes with the graph of the Konigsberg Bridge Problem fully displayed on the screen. The instructor is likely summarizing the key takeaway that this problem, while seemingly simple, was unsolvable in its original form, reinforcing the earlier discussion on unsolvable problems. The visual focus remains on the graph with nodes A, B, C, D and the connecting edges, serving as a final visual anchor for the lesson on graph theory and problem solvability.
The lecture effectively connects abstract computational theory with concrete historical examples. It starts by defining the landscape of problems (Solvable vs. Unsolvable) and their sub-categories (Decidable, P, NP). It then grounds these concepts in the Konigsberg Bridge Problem, showing how a real-world scenario can be modeled as a graph. This progression helps students understand not just the definitions of solvability, but also the historical context and practical application of graph theory in determining whether a problem can be solved.

