Decidable Vs Undecidable Problem

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/part-3-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 the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | 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, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full 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…