GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

This course is related about Turing machine and examples.

(Hindi) Turing Machine with Examples

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.

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

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

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)

English

All questions

Turing Machine

Theory of Computation

CS & IT

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

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

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

SELF STUDY

Turing Machine

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

4.6

(Hindi) Turing Machine with Examples

4

(Hindi) Theory of Computation - Turing Machine

3.4

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

3.9