Decidable Vs Undecidable Problem

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/HPSC-PGT-COMPUTER-SCIENCE/theory-of-computation/regular-language-properties/decidability-basics/asset-decidable-vs-undecidable-problem after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. HPSC Interview Preparation: Interview Preparation
  2. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  3. Data Structure & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Sorting Algorithms, Minimum Spanning Trees, Time Complexity Analysis, Graph Theory, Shortest Path Algos
  4. Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
  5. Computer System & Organisation: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  6. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Transaction Management, Concurrency Control
  7. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling
  8. Digital Logic & Circuits: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  9. Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Pushdown Automata & CFG, Turing Machines, Moore & Mealy Machines
  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, Run Time Environment
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Data Warehousing & Mining
  12. Introduction to Emerging Trends: Emerging Tech Trends
  13. Digital Society & Cyber Law: Society, Law & Ethics
  14. HPSC PGT Previous Year Paper:
  15. HPSC Assistant Professor Previous Year Paper:
  16. Live Sessions: HPSC Live Sessions, EMRS TGT/PGT Live Class
  17. Full Mock Test:
  18. HPSC PGT - MOCK Test Series:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed introduction to the classification of computational problems within computer science, specifically focusing on decidability and complexity. The lecture begins by presenting definitions for 'Decidable' and 'Undecidable' problems on a slide, stating that a problem is decidable if a polynomial time algorithm exists, and undecidable if a non-polynomial time algorithm exists. The instructor then moves to a visual hierarchy diagram to categorize problems. The diagram starts with 'PROBLEM' at the top, splitting into 'SOLVABLE' and 'UNSOLVABLE'. The 'SOLVABLE' branch further divides into 'DECIDABLE' and 'UNDECIDABLE', and finally, 'DECIDABLE' splits into 'P TYPE' and 'NP TYPE'. The instructor uses red annotations to trace these relationships and explain the flow of logic.

Chapters

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

    The video starts with a slide displaying text definitions. The first bullet point defines 'Decidable' as a problem solvable by a polynomial time algorithm. The second defines 'Undecidable' as a problem solvable by a non-polynomial time algorithm. The instructor then transitions to a new slide titled 'What computer science deals with?'. A hierarchical tree diagram appears with 'PROBLEM' at the root. The instructor begins drawing red arrows and circles around the 'SOLVABLE' and 'UNSOLVABLE' nodes, visually mapping out the classification structure. He draws a simple arrow from a 'P' to an 'S' to represent a problem leading to a solution. He also draws a second arrow from 'P' to 'S' with a question mark, indicating uncertainty or the need for an algorithm.

  2. 2:00 – 4:58 02:00-04:58

    The instructor continues to elaborate on the hierarchy diagram using red marker. He circles the 'SOLVABLE' and 'UNSOLVABLE' boxes and draws arrows pointing downwards to the next level of classification. He connects 'SOLVABLE' to 'DECIDABLE' and 'UNDECIDABLE'. He then draws an arrow from 'DECIDABLE' down to 'P TYPE' and 'NP TYPE'. On the left side of the screen, he draws a separate diagram showing a loop from 'P' to 'S' labeled 'A' for Algorithm, and another arrow labeled 'P' for Polynomial, reinforcing the concepts of algorithmic solvability and time complexity. He underlines 'DECIDABLE' to emphasize its importance in the hierarchy. He also circles the 'UNDECIDABLE' box under 'SOLVABLE' to distinguish it from the main 'UNDECIDABLE' category at the top level.

The lecture systematically breaks down the concept of problem solvability. It moves from textual definitions to a structured visual hierarchy, helping students understand how problems are categorized based on the existence and efficiency of algorithms. The instructor's hand-drawn annotations serve to highlight the flow from a general problem to specific complexity classes like P and NP, clarifying the distinctions between solvable and unsolvable problems.

Loading lesson…