GATE & ESE - ME, CH & XE

GATE, ESE and SSC JE

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 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 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

In this course, educator will be teaching about
Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on more mathematical topics of computing and includes the theory of computation. It is difficult to circumscribe the theoretical areas precisely.

Theory of Computer Science - GATE (CS and IT)

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 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