Decidable Vs Undecidable Problem

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-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. Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  2. Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
  4. Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  5. Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  6. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  7. Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
  8. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  9. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  10. Database Management Systems: 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, ORDBMS, NoSQL
  11. Computer Networks: Introduction to CN, Data Communication, 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, Hardware basics, Network Security
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…