I am a self motivated person with a positive attitude towards life and work. My dream is to work in a professional environment.

Shivam Pandey

In theoretical computer science and mathematics, the theory of computation is the branch that deals with how efficiently problems can be solved on a model of computation, using an algorithm. In this course, Shivam will discuss PDA and Turing machine and will solve some questions on it.

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE & ESE

Hindi

(Hindi) Theory of Computation - Push Down Automata (PDA)

GATE (Graduate Aptitude Test In Engineering) Preparation

Turing Machine

Theory of Computation

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

In this lesson, we will learn what is PDA(PUSH DOWN AUTOMATA).

Introduction to PDA in TOC (in Hindi)

In this lesson, we have solved questions on PUSH DOWN AUTOMATA (PDA).

Push Down Automata (PDA): Example 1 (in Hindi)

Push Down Automata (PDA): Example 2 (in Hindi)

Push Down Automata (PDA): Example 3 (in Hindi)

Push Down Automata (PDA): Example 4 (in Hindi)

Push Down Automata (PDA): Example 5 (in Hindi)

Push Down Automata (PDA): Example 6 (in Hindi)

Push Down Automata (PDA): Example 7 (in Hindi)

Push Down Automata (PDA): Example 8 (in Hindi)

Push Down Automata (PDA): Example 9 (in Hindi)

Push Down Automata (PDA): Example 10 (in Hindi)

In this lesson, we have solved questions on NON-DETERMINISTIC PUSH DOWN AUTOMATA(PDA).

Push Down Automata (PDA): Example 11 (in Hindi)

Push Down Automata (PDA): Example 12 (in Hindi)

Mentored 81,000+ Students | My Multiple Students secured AIR Below 100 in GATE | Joined top IISc, IITs & NITs | Joined PSUs | 5+ Years Exp.

Sweta Kumari

This course will cover Turing Machine, undecidability concepts and previous year questions asked in GATE from this topic. The course will be beneficial for GATE Aspirants.

(Hindi) Turing Machine - Undecidability Concepts and PYQ's: GATE (CS and IT)

A Turing machine is a mathematical model of computation that defines an abstract machine which manipulates symbols on a strip of tape according to a table of rules. In this course, Shivam will discuss Turing Machine and will solve some questions on it.

(Hindi) Theory of Computation - Turing Machine

Hello !myself shubham vijay kogade, studying  computer engineering at sinhgad institute pune, Educator in Unacademy..

Shubham Kogade

This course is related about Turing machine and examples.

(Hindi) Turing Machine with Examples

In this course, Sweta Kumari discusses some key concepts of Theory of Computation with Short Tricks. The course will be beneficial for GATE aspirants.

(Hindi) Short Tricks for Theory of computation for GATE 2018

Pawan Singh

MATLAB is a multi-paradigm numerical computing environment and proprietary programming language developed by MathWorks.  This course we would be knowing about MATLAB and its basic syntax like how to do basic arithmetic operations in MATLAB and then we will covering trignometric functions ,uses of variables and then the vectors and arrays and how to do different operations on them.we will be doing less theory and the syntax and results will shared by me will be screenshot of MATLAB itself to be more clear how to do that.

(Hindi) Matlab


I have got an  NPTEL elite certificate in Data structure using C and also gold medalist in Joy of computing with python. 


Alok Dixit

In this Course we learn how we construct such machines which gives output. In this we learn how the machine run with associated output for Gate exam Aspirants.

Lessons

13 lessons • 2h 12m