Course module
Section 3 | Theory Of Computation & Compiler Design — BPSC TRE 4.0 PGT Computer Science (कक्षा 11–12)
Explore the module outline and lessons below. Enroll free to begin studying here.
Return to /learn/BPSC/part-3-theory-of-computation after enrolling
- Lessons
- 349
- Duration
- 25 hr 57 min
- PYQs
- 2
- Practice
- 82
0% of this course's PYQ weight is covered in this module.
Syllabus index
Lessons in this module
Introduction to TOC
Basics & String Ops
- Basics & String OpsPdf
- Introduction to TocDrm Video
- Requirement Of TOCDrm Video
- What is symbol, Alphabet, String and LanguageDrm Video
- How to represent a LanguageDrm Video
- Some basic operations on stringsDrm Video
- Reverse of a stringDrm Video
- Empty-Null StringDrm Video
- SubstringDrm Video
- PRACTICE QUESTION STRINGSDrm Video
- Prefix and suffixDrm Video
- Practice question Proper prefixesDrm Video
- Kleene ClosureDrm Video
- Practice Question StringsDrm Video
Deterministic FA (DFA)
DFA Basics & Definitions
DFA Construction & Design
- DFA Construction & DesignPdf
- DFA Designing where L={a}Drm Video
- DFA Designing where starts with substring sDrm Video
- DFA Designing where string ends with substring ‘s’Drm Video
- DFA Designing string contains sub string sDrm Video
- DFA Designing string start and end with aDrm Video
- Practice Question LanguageDrm Video
- DFA Designing string start and end with same symbolDrm Video
- DFA Designing string start and end with different symbolDrm Video
- DFA Designing where starts with s = aaa or bbbDrm Video
- DFA Designing string ends with s = aaa or bbbDrm Video
- DFA Designing sting with substring s = aaa or bbbDrm Video
- Practice Questions LanguageDrm Video
- DFA Designing sting where |w| = 3, |w| <= 3, |w| >= 3Drm Video
- DFA Designing sting where number of a = 2Drm Video
- DFA Designing sting where number of a >= 2Drm Video
- DFA Designing sting where |w|=0(mod3), |w|=1(mod4)Drm Video
- DFA Designing sting where number of a =0(mod3)Drm Video
- 720p _ 19.1 Gate 2015Drm Video
- Practice Questions DFADrm Video
- DFA Designing sting where odd occurance of subsring 'ab'Drm Video
- DFA Designing sting where even occurance of subsring 'baa'Drm Video
- How Many Different DFA's Can Be Designed Part-1Drm Video
- How Many Different DFA's Can Be Designed Part-2Drm Video
- Empty Language AcceptanceDrm Video
- Universal Language AcceptanceDrm Video
- DFA Designing where string contain b as 2nd symbol from leftDrm Video
- DFA Designing where string contain b as 2nd symbol fromRightDrm Video
- DFA Designing where string start with a and w=omod3Drm Video
- DFA Designing where string contain even number of a and bDrm Video
- |a|= 0(mod2) |b|= 0(mod3) |c|= 0(mod5)Drm Video
- DFA Design For String Has a DecimalDrm Video
- Design DFA for Language Part-1Drm Video
- Design DFA for Language Part-2Drm Video
- Design DFA for Language Part-3Drm Video
- Design DFA for Language Part-4Drm Video
Non-Deterministic FA
NFA Basics & Design
- NFA Basics & DesignPdf
- Basics of NDFADrm Video
- Important Points of NDFADrm Video
- Acceptance By NDFADrm Video
- NDFA Designing where starts with substring sDrm Video
- NDFA Designing where every string ends with substring sDrm Video
- NDFA Designing where every string contains substring sDrm Video
- NDFA Designing where every string starts and ends with sameDrm Video
- NDFA where every string starts and ends with different symboDrm Video
- NDFA where every string starts with aaa or bbbDrm Video
- NDFA where every string of length =w, <=w, >=wDrm Video
- NDFA where every string contains exactly two aDrm Video
- NDFA where 3 symbol from right end is aDrm Video
- Practice QuestionDrm Video
NFA to DFA Conversion
Epsilon NFA & Conversion
Regularity & Identification
- Regularity & IdentificationPdf
- Regular Language Indetification Part-1Drm Video
- Regular Language Indetification Part-2Drm Video
- Regular Language Indetification Part-3Drm Video
- Regular Language Indetification Part-4Drm Video
- Regular Language Indetification Part-5Drm Video
- Regular Language Indetification Part-6Drm Video
- Regular Language Indetification Part-7Drm Video
Regular Expressions
Regex Basics & Definitions
Regex Design & Algebra
- Regex Design & AlgebraPdf
- Regular Language to Regular Expression Part-1Drm Video
- Regular Language to Regular Expression Part-2Drm Video
- Regular Language to Regular Expression Part-3Drm Video
- Regular Language to Regular Expression Part-4Drm Video
- Regular Language to Regular Expression Part-5Drm Video
- Regular Language to Regular Expression Part-6Drm Video
- Regular Language to Regular Expression Part-7Drm Video
- Regular Language to Regular Expression Part-8Drm Video
- Regular Language to Regular Expression Part-9Drm Video
- Algebraic Properties of Regular ExpressionDrm Video
- Identities of Regular Expression Part-1Drm Video
- Identities of Regular Expression Part-2Drm Video
- Practice Questions_REDrm Video
- Practice Question_LanguageDrm Video
FA to Regex Conversion
Grammar
Chomsky & Basics
Grammar Design via Regex
- Grammar Design via RegexPdf
- Practice QuestionDrm Video
- Practice QuestionDrm Video
- Practice QuestionDrm Video
- Practice QuestionDrm Video
- Practice QuestionDrm Video
- Grammar Design form Regular Expression part-1Drm Video
- Grammar Design form Regular Expression part-2Drm Video
- Regular grammar to regular expressionDrm Video
- Regular grammar to regular expressionDrm Video
Regular Language Properties
Decidability & Basics
Closure Properties
Pumping Lemma
Moore & Mealy Machines
Basics & Moore Machine
Pushdown Automata & CFG
PDA Design & Basics
- PDA Design & BasicsPdf
- Fundamental of CFL and PDADrm Video
- Formal Definition of DPDADrm Video
- Push, Pop and Skip OperationsDrm Video
- PDA Design Practice Problem Part - 1Drm Video
- PDA Design Practice Problem Part-2Drm Video
- Design Practice Problem Part - 3Drm Video
- PDA Design Practice Problem Part - 4Drm Video
- PDA Design Practice Problem Part - 5Drm Video
- Practice Question - 1Drm Video
- Practice Question - 2Drm Video
- Practice Question - 3Drm Video
Context-Free Grammars
Decision Properties
Closure Properties
Turing Machines
TM Basics & Design
- TM Basics & DesignPdf
- Fundamentals of Turing MachineDrm Video
- Formal Defination of Turing machine with componentsDrm Video
- Turing Machine Design Practice Problem Part-1Drm Video
- Turing Machine Design Practice Problem Part-2Drm Video
- Turing Machine Design Practice Problem Part-3_Drm Video
- Adding Two Unary NumberDrm Video
- Converting Unary to BinaryDrm Video
- Turing Machine_Practice Questions_1Drm Video
- Halting ProblemDrm Video
TM Variations & UTM
Decision Properties
Linear Bounded Automata
Intro to Compilers
Lang Processing System
Phases of Compiler
Lexical Analysis
Grammar & CFG
Grammar Basics & Chomsky
Derivation & Recursion
Ambiguity & Inherent Amb
Left Factoring & Prefixes
Simplification of CFG
Syntax Analysis: Top-Down
Parser Basics & Top-Down
First and Follow Sets
LL(1) Parser & Table
- LL(1) Parser & TablePdf
- Basic Requirement For LL(1) ParserDrm Video
- Designing LL(1) Parser Part-1Drm Video
- Designing LL(1) Parser Part-2Drm Video
- Designing LL(1) Parser Part-3Drm Video
- Block Diagram of LL(1) ParserDrm Video
- Short Cut Techniques for LL(1) GrammarDrm Video
- Practice QuestionDrm Video
- LL(1)-Practicce questionDrm Video
- LL(1)-Practice questionDrm Video
Syntax Analysis: Bottom-Up
Intro to Bottom-Up & LR(0)
- Intro to Bottom-Up & LR(0)Pdf
- Bottom Up Parser Fundamentals Part-1Drm Video
- Bottom Up Parser Fundamentals Part-2Drm Video
- Designing LR(O) Parser Part-1Drm Video
- Designing LR(O) Parser Part-2Drm Video
- Designing LR(O) Parser Part-3Drm Video
- Designing LR(O) Parser Part-4Drm Video
- Designing LR(O) Parser Part-5Drm Video
- Practice QuestionsDrm Video
SLR(1) Parser & Conflicts
CLR(1) Parser & Items
LALR(1) Parser & Merging
Operator Precedence
Semantic Analysis & SDT
Semantic Analysis & SDT
Attributes & SDT Types
Intermediate Code Gen
3AC, Quads & Triples
- 3AC, Quads & Triples - NotesPdf
- Intermediate CodeDrm Video
- DAG Practice Question 1Drm Video
- DAG Practice Question 2Drm Video
- DAG Practice Question 3Drm Video
- DAG Practice Question 4Drm Video
- DAG Practice Question 5Drm Video
- 3 Address CodeDrm Video
- Representation of 2 Address CodeDrm Video
- Fill in BlankDrm Video
- DAG Practice QuestionsDrm Video
Code Optimization
Blocks, Loops & Methods
- Blocks, Loops & MethodsPdf
- OptimizationDrm Video
- Constant FoldingDrm Video
- Constant PropogationDrm Video
- Strength ReductionDrm Video
- Redundant Code EliminationDrm Video
- Algebraic SimplificationDrm Video
- Control Flow AnalysisDrm Video
- Loop JammingDrm Video
- Loop UnrollingDrm Video
- C programming Code MovementDrm Video
Module lessons
Previous-year questions
Explore the course
Previous moduleSection 3 | Data StructuresNext moduleSection 3 | Emerging Trends (AI, Societal Ethics & MS Office)
- About the Course
- Section 1 | Language (Hindi)
- Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित))
- Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित))
- Section 1 | Language (English)
- Section 2 | Primary Maths & Reasoning
- Section 2 | General Awareness (GK + Current Affairs)
- Section 3 | Computer System and Org. (CSO)
- Section 3 | Database Management System
- Section 3 | Operating System
- Section 3 | Computer Networks
- Section 3 | Data Structures
- Section 3 | Emerging Trends (AI, Societal Ethics & MS Office)
- Section 3 | Software Engineering
- Section 3 | C Programming
- Section 3 | OOPS, C++, JAVA, HTML
- Section 3 | Java
- Section 3 | Python
- Section 3 | Digital Electronics
- Section 3 | Multimedia
- BPSC Previous Year Papers
- BPSC Full Mock Tests