GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

This course will let you know the difference between Deterministic Finite Automata (DFA) and Non - Deterministic Finite Automata (NFA) with examples. This course also explains you some of  the key points that will helpful for your Exams.

(Hindi) Finite Automata in TOC - GATE (CS/IT)

This course is related about Turing machine and examples.

(Hindi) Turing Machine with Examples

This course discusses Right Linear Grammar and Conversion from DFA to RLG or RLG to DFA.

(Hindi) Context Free Grammars

In this course we will cover some important topics of CHOMSKY HIERARCHY and CHOMSKY NORMAL FORM.

(HINDI) Theory of Computation: Chomsky Hierarchy and Chomsky Normal Form

In this course, Shubham has discussed Theory of Computation in detail and also covered more problems on different topics of TOC. This course will help to gain knowledge of Automata Theory and increase your confidence to solve problem in real life as well as in exams.

Basics of Theory of Computation

This course will cover 100 questions with short tricks related to regular Expressions from theory of Computation targeted for GATE & UGC NET Exam.

(Hindi) 100 Questions: Regular Expressions in Theory of Computation for GATE (CS and IT)

This is the extension of Regular Expression. This video shows other alternative to show how language generates string.

(Hindi) Regular Grammar and Gate Questions on Regular Language - GATE(CS and IT)

In this course , I will cover GATE Previous Year Questions On Regular Languages & Finite Automata With Detailed Analysis.

(Hindi) GATE PYQs: Regular Languages & Finite Automata

This course is for people who want to learn MATLAB to apply it in any project and that too in a short time. The course will cover the basics of MATLAB using examples from various domains

(Hindi) Introduction to MATLAB

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)

This course will go through you some tips & tricks to Solve Regular Expression For Finite Automata. Firstly, I have discussed Regular Expression Examples , Identities & Example Problems, Arden's Theorem, NFA to Regular Expression Conversion,DFA to Regular Expression Conversion.

(Hindi) Tips & Tricks For Regular Expressions in TOC: GATE

In this course, Sweta Kumari will explain about Context-free Grammar and how to create them, Push down automata and its types and many more.

(Hindi) Context Free Grammar and Push Down Automata

This course is good for those who wants to learn matlab

Introduction for MATLAB

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

In this course Akshay Mandhare will explain about Context free grammar  how to create them,Push down automata and its types,etc

(Hindi)Theory Of Computation: Context-Free Grammar And Push Down Automata

In this course, Keerti Vishwakarma discusses Theory of Computation. The course will be beneficial for Engineering students and GATE aspirants.

Theory of Computation: GATE

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

In this course, Sweta Kumari will cover Short Tricks for Writing Regular Expressions with Master SRP.

(Hindi) Short Tricks for Writing Regular Expressions with Master SRP : GATE (CS and IT)

This course is about the Finite Automata like DFA, NFA and their conversion to one another in Theory of Computation.

Introduction to Finite Automata

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

Regular Expression

Turing Machine

Context Free Grammar

Theory of Computation

Finite Automata

Language

Recursive Language and REL

Decidability

Regular Language

CSL and Grammar

Pushdown Automata

CS & IT

Regular Grammar

Types of Finite Automata

Automaton

M.Tech @ NSIT Delhi/GATE (CS) 2017&2018 qualified ...Not a teacher but a medium of sharing my knowledge 

Akshay Mandhare

I am an undergraduate currently pursuing B.Tech in IT branch.

Ayush Garg

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

My Name is khushi. I am an engineering student. 

Khushi Sharma

I & Unacademy is here to make your GATE Preparation Easier....So Go through it and enjoy your trip toward your success..


Naman Agarwal

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

Software Developer| Share knowledge to gain knowledge




Shraddha S K

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

Shubham Kogade

Shubham Darda

A Mechanical  Engineer by profession and a Computer Science Enthusiast by heart. I love working on scientific and numerical computation.

SELF STUDY

Theory of Computation

Theory of Computation

Finite Automata

Regular Expression

Context Free Grammar

Turing Machine

Theory of Computation

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

4.3

(Hindi) Introduction to MATLAB

4.6

Introduction for MATLAB

4.5

Basics of Theory of Computation

4.4

Finite Automata

(Hindi) GATE PYQs: Regular Languages & Finite Automata

4.6

(Hindi) Finite Automata in TOC - GATE (CS/IT)

4.7

Introduction to Finite Automata

4.9

Theory of Computation: GATE

4.3

Regular Expression

(Hindi) 100 Questions: Regular Expressions in Theory of Computation for GATE (CS and IT)

4.8

(Hindi) Short Tricks for Writing Regular Expressions with Master SRP : GATE (CS and IT)

4.6

(Hindi) Tips & Tricks For Regular Expressions in TOC: GATE

4.8

(Hindi) Regular Grammar and Gate Questions on Regular Language - GATE(CS and IT)

Context Free Grammar

(Hindi) Context Free Grammar and Push Down Automata

4.6

(HINDI) Theory of Computation: Chomsky Hierarchy and Chomsky Normal Form

4.1

(Hindi) Context Free Grammars

4

(Hindi)Theory Of Computation: Context-Free Grammar And Push Down Automata

4.7

Turing Machine

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

4.6

(Hindi) Theory of Computation - Turing Machine

3.4

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

3.9

(Hindi) Turing Machine with Examples

4