GATE Questions | TOC Questions | Automata Theory GATE Based Questions

Regular Language | Finite State Machine | DFA NFA | TOC | GATE PYQs | DADA Ji’s पाठशाला

CFG | TOC | GATE PYQs | Automata Theory

Basic Logic Gates | OR AND XOR NOT NOR NAND Gates | What is Universal Gates?

Top 20 questions of the compiler design ll GATE Compiler design ll GATE PYQs || DADA Ji’s पाठशाला

Compiler design concepts in brief | Gate Questions and its replica | DADA Ji’s पाठशाला

Phases of Compiler Design | Compiler Design Gate questions | Concepts of Compiler Design

Overview of Compiler Design and GATE questions | GATE PYQs | DADA Ji’s पाठशाला | Free Education

Important basic questions of Theory of Computation for ISRO, NIELIT, GATE

Part-III Regular Expression GATE Questions | State Diagram | TOC | Dada Ji's Pathshala

Part-I: Regular Expression | Theory of Computation TOC | GATE Questions | DADA Ji’s पाठशाला

Part-II: Regular Expression | Theory of Computation TOC | GATE Questions | DADA Ji’s पाठशाला

Concepts of Array | Why do we use Array ?

Concept of Pointer in C | Pointer concept with examples for beginners

C and DSA: Questions Based on Ternary Operator and Control Statement | Dada Ji's पाठशाला

Nested for loop questions | Nested Loop in Python | Code for pyramids, patterns & Pascal triangle

Nested for loop with examples | Loop in Python | Code for pyramids, patterns & Pascal triangle

Concept of for loop in Python with examples | Break and Continue Statement

For loop | while loop | range function | Programming Questions | Python List tuple set & dictionary

Program to display first positive 10 odd integers | Print numbers from 50 to 100 with a gap of 5

Python Program to print sum of natural numbers| Sum of Natural Number | For Loop and While Loop

Program to print first 10 positive integers | For Loop and While Loop in Python | Looping statement

For Loop and While Loop in Python | Looping statement: C Programming Vs Python Programming

What is Algorithm and its properties | Component of Algorithm | Design, Validate, Analyse and Test

Lec 28: Simplification of context free grammar | Unit production, Null production & Useless product

Longest Increasing Sequence | Gate Problem | Data structure and Algorithm

Longest Common Subsequence Problems | LCS | Longest Increasing Subsequence | CS Gate Problems

Computer Network: Network Layer, Cipher Text and RSA Problem | Gate Preparation Video Set- III

Computer Networks: Data Link based problems | Gate preparation video- II | CRC, Sliding window

Computer Networks: IP address Problems | Previous year gate questions set- I | GATE BARC ISRO NET

Identify lexical errors | What is lexical errors ? | Types of errors in programming

How to find token in compiler design ? | Token in compiler design | Lexical Analysis | Gate Problems

What is Token, Identifier, and Lexemes | What is Lexical Errors | Lexical Analysis | Compiler Design

Advanced Graph Theory week 7 assignment 7 | Swayam Nptel

Introduction to Automata, Languages and Computation week 11 assignment 11

advanced graph theory assignment 6 week 6 | swayam nptel

Introduction to Automata, Languages and Computation Assignment 9 week 9 | Assignment 9 week 9

Introduction to Automata, Languages and Computation Assignment 10 week 10 | Week 10 Assignment 10

Introduction to Automata, Languages and Computation week 7 assignment 7 | swayam nptel

Introduction to Automata, Languages and Computation Week 8 Assignment 8 | swayam nptel

Axis Transformation using Excel | how to change axis of XY- plot in excel | Multiple columns axis

TOC GATE LECTURE PART-II | Automata Theory | CFG, PDA, Turing Machine, Recursive enumerable language

Theory of Computation Gate Lecture: Part-I | DFA, NFA, CFG, TYPE-3, TYPE-2, TYPE-1 & TYPE-0 GRAMMAR

How to Find inverse modulo in cryptography | Numerical to find inverse modulo | {HINDI}

RGB Color Model and CMY Color Model with example

Lec-26: Homomorphism & inverse homomorphism | Closure properties of regular language

Simplification of context free grammar (Example)

Context free grammar for language L= a^nb^m, where 'n' greater than 'm'

Context free grammar for CFL L = a^nb^mc^n

Lec-25:Closure Properties of Regular Sets | Regular language closed under union, intersection, Compl

Ambiguous Grammar Example || Ambiguity in Context Free Grammar || CFG

Ambiguous Grammar || Derivation Tree || Parse Tree || LMD & RMD || Context Free Grammar

Lec-19: Direct and Indirect recursion | Factorial using recursion LIFO| Recursion in data structure

Context free grammar for language L = a^nb^n-3

Apache web server | Linux Networking

Context Free Grammar for Given Context Free Language | CFL TO CFG

Mealy and Moore machine | Conversion Mealy to Moore model | Moore to Mealy model

Lec-00: NFA for beginners | NFA Vs DFA |Conversion NFA to DFA | Non Deterministic Finite Automata

Lec-00: DFA for beginners | Deterministic Finite Automata | Mealy and Moore Machine | NFA

First order predicate logic | Knowledge Representation | Resolution & Refutation | FOPL | AI