Channel Avatar

Shivam Sir @UCIJtRZqmVSIrtJgHbss2zEg@youtube.com

439 subscribers - no pronouns :c

Ambalika Institute Of Management And Technology Campus, Luck

Videos
Recently Uploaded Popular Oldest
41:51
Shivam&Gauri-Shadi Clip-3
02:33
Shivam&Gauri-Shadi Clip-2
04:25
Shivam&Gauri-Shadi Clip1
01:25
Shivam and Gauri Anniversary Celebration 🎊 5th-1
01:29
Shivam and Gauri 5th Anniversary Celebration 🎊 🎉
01:20
Dwija Gift 🎁 mausiji and mausa ji
01:21
Dwija Gift 🎁 Pihu Aarav
01:28
Dwija Birthday 2024
01:25
Dwija Trip 2
01:31
dwija - trip 1
01:30
20 May 2024
00:14
L2
00:32
L1
03:22
“Education is the most powerful weapon which you can use to change the world.”
05:00
Lec- 35 | PCP has no Solution.
07:31
L-34 | Post Correspondence Problem | List1 "0,01000,01" List 2 " 000,01,1"
06:19
L-33 | PCP | POST CORRESPONDENCE PROBLEM | INTRO|
12:45
L-32 | Palindrome | Table | Turing Machine
12:09
L-31 | Odd Palindrome | Turing Machine |
10:06
L-30 | a2n bn | n greater than equal to zero | Turing Machine
09:53
L-29 | Turing Machine | bn cn n greater than equal to zero
14:56
L-28 | Even Palindrome | Turing Machine
13:05
L-27 | Transition Table | an bn cn & an bn | Turing Machine
11:44
L-26 | Turing Machine | an bn cn | n is greater than equal to one
08:32
L -25 | an bn | n is greater than equal to one part -2
07:51
L-24 | an bn | n is greater than one | Turing Machine
11:57
L-23 | Turing Machine | Tuples | Tape ,Tape Head, Finite Control
06:30
L-22 | Turing Machine - Models and Notations
06:02
L-21 | Two Stack PDA Part -2
06:20
L-20 | Two Stack PDA
09:53
L-19 | Equivalence b/w CFG TO PDA
08:31
L-18 | DPDA | Deterministic PDA
09:56
L-17 | Even Palindrome | PDA |
05:04
L-16 | am bn cm | m, n greater than equal to one| PDA
09:26
L-15 | Build a PDA that accept the language odd Palindrome
08:02
L-14 |an bm an | m,n greater than equal to one | PDA
06:48
L-13 | an Plus 2 and bn | n greater then zero can be Accepted by PDA
08:11
L-12 | PDA no. Of a's is greater than no. Of b's
09:11
L-11 | Can be Accepted by A PDA
07:12
L-10 | PDA | an bm n greater than m
07:06
L-9 |An Empty Stack PDA Part -2 |Representation of instruction
05:18
L-8 Empty Stack PDA |an bn n greater than equal to zero
05:03
L-7 |Non-Deterministic Pushdown Automata | NPDA
05:57
L-6 | Representation of Instruction in a PPD
03:22
L-5 | How to solve PDA | step by step
05:14
L-4 | PDA | an bn n greater than equal to zero |Acceptance By Final State
06:27
L-3 | Operation In PDA | Pushdown Automata
01:55
L-2 | Tuples | PDA
02:18
L-1 | Pushdown Automata (PDA) | introduction