Decidable Vs Undecidable Problem

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/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. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | 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
  13. Paper 2 | 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
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…