Computer Panthulu

11:36

TOC(FLAT) in Telugu || Design a Turing Machine for Multiplication of 2 unary numbers

07:32

TOC(FLAT) in Telugu || Chomsky Normal Form || Converting CFG to CNF || Theory of Computation

09:50

TOC(FLAT) In Telugu || Turing Machine for Subtraction of 2 numbers || Unary | integers

06:01

06:44

TOC(FLAT) in Telugu | Turing Machine for Addition of 2 numbers | Unary | Implement function F(A+B)=C

08:54

TOC(FLAT) in Telugu | Design Turing Machine for 1's Complement and 2's Complement | Automata Theory

15:02

TOC in Telugu|Turing Machine for Even Palindrome(ww^r) |Odd Palindrome(wawr or wbwr)|All palindromes

14:22

DMS in Telugu | Hasse Diagram | Procedure | How to Draw | Hasse Diagram in Discrete Mathematics

07:56

TOC(FLAT) in Telugu || Turing Machine for a^n b^2n || Design || Construct || Automata Theory

07:06

TOC(FLAT) In Telugu | Turing Machine for a^2n b^n | Design | Construct | Automata Theory in Telugu

08:23

TOC(FLAT) in Telugu || Turing Machine for a^n b^n c^n || Design || Construct | Theory of computation

08:54

TOC(FLAT) in Telugu || Turing Machine for a^n b^n || Design || Construct || Theory of Computation

10:15

TOC(FLAT) in Telugu | CFG to PDA Conversion|Construction of PDA from CFG |Equivalence of CFG and PDA

07:48

TOC(FLAT) in Telugu || Two Stack PDA | 2 stack PDA for a^n b^n c^n

07:36

TOC(FLAT) in Telugu || Design PDA for Balanced Parentheses || Push down Automata Example

13:51

TOC(FLAT) in Telugu | pda for na(w)=nb(w) || Equal number of a's and b's | greater than || less than

15:36

TOC(FLAT) in Telugu || Construct PDA for the language L={WW^r} || What is NPDA || Non Deterministic

09:47

TOC(FLAT) in Telugu || Construct PDA for the language L={WcW^r} || Pushdown Automata

10:35

TOC(FLAT) in Telugu || Construct PDA for the language L={a^2n b^n} || Pushdown Automata

09:01

TOC(FLAT) in Telugu || Construct PDA for the language L={a^n b^2n} || Pushdown Automata

17:36

TOC(FLAT) in Telugu || Construct PDA for the language L={a^n b^n} || Pushdown Automata

09:16

TOC(FLAT) in Telugu || Chomsky Normal Form in Telugu || Converting CFG to CNF in Telugu

24:43

DMS(DMGT) in Telugu || Conjunctive Normal Form || CNF|| 8 Examples || Procedure to obtain CNF

16:24

TOC in Telugu || Greibach Normal Form in Telugu || Converting CFG to GNF in Telugu

20:37

TOC(FLAT) in Telugu | Minimization of DFA(Finite Automata) using Myhill Nerode Theorem-Table Filling

13:10

TOC(FLAT) in Telugu | Regular Expression Examples | Theory of Computation | Automata Theory | Telugu

05:13

TOC(FLAT) in Telugu || Design a Moore Machine to find 1's Complement of a Binary number in Telugu

15:11

TOC(FLAT) in Telugu |Minimization of DFA(Finite Automata) in Telugu| Equivalence or Partition method

15:31

DMS in Telugu || Logical Equivalence using laws of logic or equivalent formulas in Telugu

17:43

TOC(FLAT) in Telugu || Minimization of Finite Automata in Telugu || Equivalence or Partition method

10:31

TOC(FLAT) in Telugu || convert nfa with epsilon to nfa without epsilon || Example 2

17:33

TOC(FLAT) IN TELUGU || CONVERSION OF NFA WITH EPSILON TO NFA WITHOUT EPSILON IN TELUGU

16:11

TOC(FLAT) in Telugu || Converting NFA to DFA || 2 Examples || Equivalence of DFA and NFA ||In Telugu

14:25

DMS in Telugu || Logical Equivalence using equivalent formulas or laws of logic || 3 examples

13:08

DMS in Telugu | Equivalent Formulas | Laws of logic | Logical Equivalences | Equivalence of Formulas

06:51

TOC(FLAT) in Telugu || DFA for 3(Three) Consecutive 0's || Without 3 Consecutive 0's || a's || b's

11:14

Truth Tables in Telugu || Discrete Mathematics in Telugu || 4 Examples || Truth Table Construction

07:45

15:07

TOC(FLAT) in Telugu || DFA Substring Problems || 4 Examples || ab || bab || 00 || 0 || as substring

13:14

DAA in Telugu | Multistage Graph in Telugu || Ex2 | Forward Approach || Dynamic Programming | Telugu

15:15

DAA in Telugu | Multistage Graph in Telugu | Backward Approach | Ex1 | Dynamic Programming in Telugu

13:58

OS in Telugu || SCAN & CSCAN Disk Scheduling Algorithms in Telugu || Operating System in Telugu

30:36

DAA in Telugu | Multistage Graph in Telugu || Ex1 | Forward Approach || Dynamic Programming | Telugu

22:05

DAA In Telugu || Strassen's Matrix Multiplication in Telugu - Concept, Algorithm, Time Complexity

06:06

OS in Telugu || SSTF Disk Scheduling Algorithm || Operating Systems in Telugu || Shortest Seek Time

06:29

OS in Telugu | Base and Limit Registers | Hardware Address Protection in Memory Management in Telugu

05:44

OS in Telugu || FCFS Disk Scheduling Algorithm in Telugu || Operating Systems in Telugu

18:58

DAA in Telugu || Binary Search using Divide and Conquer in Telugu || Algorithm || Program || Example

06:09

OS In Telugu || LRU(LEAST RECENTLY USED) PAGE REPLACEMENT ALGORITHM in Telugu || OPERATING SYSTEMS

16:37

DAA in Telugu || 0/1 Knapsack Problem Using Backtracking || Backtracking Algorithm || DAA

07:51

OS in Telugu || Optimal Page Replacement algorithm(OPT) in Telugu | Operating Systems in Telugu

10:20

OS in Telugu || Belady's Anomaly in FIFO page Replacement in Telugu || Operating System in Telugu

10:47

OS in Telugu || FIFO Page Replacement Algorithm in Telugu || Operating Systems in Telugu

01:28:38

OS in Telugu || Methods for Handling Deadlocks || Prevention || Avoidance || Detection || Recovery

04:54

OS in Telugu || Deadlock Recovery in Telugu || Deadlocks in Telugu || Operating Systems in Telugu

07:42

DAA in Telugu | Introduction to Greedy Method | General Method | Control Abstraction | Applications

06:13

DAA in Telugu || Introduction to Divide and Conquer Algorithm | General Method | Control Abstraction

38:22

DAA in Telugu || Travelling Salesman Problem using Least Cost Branch and Bound (LCBB) in Telugu

29:50

DAA in Telugu || 0/1 Knapsack Problem using FIFO Branch and Bound in Telugu

24:43

DAA in Telugu || 0/1 Knapsack Problem using Least Cost Branch and Bound(LCBB) in Telugu