Gate Smashers · Transcript · · Updated
Lec-1: Syllabus of TOC(Theory of Computation) for GATE | UGC NTA NET | Imp Points – Transcript
Video by Gate Smashers · Watch the original on YouTube
Summary
AI-generated from the transcript. Verify details against the source video.
- The speaker divides the Theory of Computation syllabus into four portions, giving the most weightage of 80% to Regular Language and Finite Automata.
- Context-Free Language and Push-Down Automata as well as Recursive Language and Recursive Annumerable Language are each given a weightage of 10%.
- Closer Properties and Undecidability, language identification, and machine acceptance are highlighted as the main portions and types of questions in TOC.
Use this video with Pro
Reading, copying and transcript downloads are free. Create saved AI results for this video with a signed-in Pro account ($9/month).
Transcript
Search ignores accents. All transcript text stays visible.
और चक इosospeen नबे नफना है। Sayb skip और ह्र more तुछ you यो रेच द्र सेवााँत ठुा 6й लाप इ eating उसरा. इच्ामziękuję ज™ प्रफरंखोय सबम क stuffed
even if you are talking about university level exam, then there is no important point which you have to do or any important topic which you have to do. These are all the points which I am going to discuss in this video. Now look at the syllabus which will be available in many places.
But what is the important topic? Before the exam which is the topic which is mandatory for you? Means you have to do which topic you should focus on the most. What is the topic which you can focus on the least? Even then you can take good marks in competitive exams or even in college or university exams.
So these are all the points which I am going to discuss in this video. So here I will start the syllabus. I have divided the syllabus into four portions. The first portion is Regular Language and Finite Automata. And I will give this weightage 80%. Yes, the most weightage of this topic is Regular Language and Finite Automata.
I will give you a little overview of Theory of Computation's three main pillars. Means all the discussions are on three things. That is language in which we talk about the formal language. Grammar and apart from grammar we talk about Automata.
That is your machine. Where we talk about hardware or machine. So these are the three pillars of Automata. So in all the syllabus of Automata you will get a topic on Language, Grammar and Automata.
So your first and very important topic is Regular Language and Finite Automata. And how much weightage I have given? 80%. Now in this the main portions are like Minimization of Finite Automata. Apart from this if we talk about here we have Meela machine, Mure machine and DFA.
On NFA you get the most questions. Apart from this Pumping Lemma Theorem comes the question on it. This is an important topic that is Regular Language and Finite Automata. Then I will come to Context-Free Language and Push-Down Automata.
I will give this 10%. Means next important topic that is Context-Free Language and Push-Down Automata. This is Language. This is Machine. Automata which accepts this Language. Although after introduction, after discussing this Labels I will introduce one by one and will bring videos here.
In which I will cover all the basic points of TOC. Even from the point of view of competitive exams. Even from the point of view of your university level exams. But this video will help you a lot. How you have to prepare for the exam. Which topics you have to give the most emphasis on.
So here next we come to Recursive Language and Recursive Annumerable Language. And to accept them we have a Turing Machine. I will also give this 10%. And here the topics are mostly theoretical questions. And even if theoretical questions are not there.
So which type of questions do you have? I am going to tell you next here. Next is Closer Properties and Undecidability. This is the most important topic. That is Closer Property and Undecidability. In which here you have table.
First I will tell you why this is most important. Because in every exam, every time you will get questions on this. In which we will talk about table which you have to remember. Table based on the Closer Property and Undecidability is also a table.
Decidable and Undecidability is a table. And it is not like this. You feel that 100% is covered. So in which this will come? This is actually in all. Means in regular language there is also Closer Property. In Context-Free Grammar also we have Closer Property.
In Recursive and Recursive Annumerable CSL also we have Closer Properties. And this is like this. Decidable and Undecidable also we have a full-fledged table. On which you will get questions every time. The most important topic is this.
There are tables on which you should know that which questions are possible on these. That is Closer Property and Undecidability. Second I will tell you that that is identification. Means you will get language. And you have to identify that this language is in regular language, in CFL, in CSL, in Recursive.
Which language comes. So identifying it is the second type of question. The third type of question comes here. On Machine or Automata you can say that this Automata or this machine accepts this particular language or not.
It accepts this particular string or not. On this you get the most questions. So here at first I was telling you Closer Property and Undecidability on which you will definitely get questions. Second is language identification. On which you will identify the language.
That which language comes. And third is the acceptance of the machine. On which machine accepts the language. It will accept it or not. It will hang it or it will accept it. Means all these questions you get on Automata. So this is the main portion of TOC on which you will get the most questions. So we will cover all these topics slowly and in one video I will bring next. Thank you.