Decidable Vs Undecidable Problem

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/toc-compiler/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. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, 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. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: 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, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. 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, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
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…