Dr. Hriday

5.91K subscribers

282 videos

This channel is an attempt to help our student and aspirant to find smart and high-quality contents for various examinations (AKTU Lucknow -Semester Exam, GA...

Latest Videos

Just practicing...

Construction of Strict Full Binary Tree using Preorder and Postorder Only

From Hearts to Heart- 2024

Om Jai Jagdish Hare...

Stack based Question.

Part-1 Address Calculation in 1 Dimensional Array

DFA No. of 1`s in String

DFA Multiple of 3 Divisible by 3

Epsilon NFA to NFA T-T Method

DFA Minimization

DFA Starts with Anything over given Alphabet Trick

DFA Contains any substring Over given alphabet Trick

DFA ends with any Substring over Alphabet Trick

epsilon NFA to DFA Coversion Steps of TT Method

epsilon NFA to DFA Exaomple-2

epsilon NFA to DFA TT Method

NFA to DFA Conversion Example-2

NFA to DFA Coversion Steps

NFA to DFA Conversion

Numerical problem to compute time complexity.

Digital-Sums Competitive Coding

B Tree Construction - Example-1

PDF to Word Offline without external software

Chomsky Hierarchy Definition of All Grammars

Church Thesis Automata

Post Correspondence Problem(PCP) Modified Post Correspondence Problem(MPCP)

Turing machine for Palindrome String Even length Odd Length

Universal Turing Machine

Variantsmodification of Turing machine

Recursive and Recursive Enumerable Language.