Artificial Intelligence Syllabus Discussion and Analysis for NTA UGC NET
In today 's video we are going to see Syllabus of artificial intelligence. We are discussing this
specially for NTA and NET exam. The syllabus if Artificial intelligence is mostly same only But if
we talk about NTA or NET exam Then they have already given syllabus of Artificial Syllabi on
their website. The first topic is approach to AI Approach to artificial intelligence I have added this
broad topics according to their syllabus only And if you also follow the book of Rich and Knight
Or of Soraj Kaushik Then in that also you will get the topics like this unit wise only So if we talk
about approach to. AI So this is the most important Why am I telling this most important
Because every time you. will get question from this unit And which is the topic The first. topic is
heuristic search Over here in heuristic. search we will talk about A * , AO * * , Best first We talk
specially about this algorithm After that we talk over here about game playing This is the most
important topic in the artificial intelligence 2nd most topic over here is Fuzzy set I will this also 3
start Because you will get questions from this also every year And questions are of same
pattern only Either it is AO * or it is best first Or you'll get questions on DFS and BFS. Then I
want to give neural network 2 stars over here.
What is Artificial Intelligence | Learn AI with Real Life Examples | Can Machine Think??
Gate Smashers is going to discuss Introduction to Artificial Intelligence. We want to make such
machines which can behave like humans Can think like humans And work like humans. On this
intelligent machines only our whole future depends on intelligent systems. We are still finding
the answer of this question And actually what we want to do. We want to put decision making
powers in machines We want that machines should take decisions by themselves And artificial
intelligence is working over here only The barrier of intelligence between humans and robots is
trying to break that So behind that there are many learning algorithms Searching, sorting
algorithms are there Reasoning algorithms are working behind it I want to give you one more
simple example. Artificial intelligence is the basic definition of artificial intelligence It is that we
want to make such machine Which should behave like human behavior. We want machines also
to think on their end And on that basis it should do decision making Then perception Then
learning Learning means as human being learn something We learn things from our experience
And we use those things in future.
What is State Space Search | Introduction to Problem Solving in Artificial Intelligence
Gate Smashers is going to discuss State space searching It is one of the major application of
artificial intelligence. Problem solving That is how to solve a particular problem And if we talk
about era of 1960-1970 At that time the major research that was done in artificial intelligence
That is done on problem solving And in which we talk related to game Like tic tac toe game is
there. In 8 puzzle problem that we have a board of 3 * 3, we have 9 spaces and 9 places In
which we have 8 tiles which are numbered. I have random tiles numberd 1,2,3,4,5,6,7,8 I have
numbered tiles And I have one empty space Now over here first of all I have to represent the
problem precisely That I have. I know that this is my start state Now I want goal state Where I
want to reach Otherwise you will keep on searching. You are starting to explore your searching
, And these are different branches These different branches are getting formed. If we keep the
space on left side Then this will be formed over here like this If I do it on left then 5 will come
here. If you move it left side then the next state That will be one of my resultant state Then
comes cost We measure it in cost What is the meaning of cost?
Uninformed Vs Informed Search in Artificial Intelligence with Example
Gate Smashers are going to discuss Difference between uninformed and informed searching. In
informed searching we are using information And we tell that information Heuristic This is very
important point I will explain you with a simple example Let 's say travelling salesman problem If
we talk about TSP problem there will be ( n-1 ) ! Possibilities How much will be a searching
space (n-1) If you have 5 number of cities That is value of n Then (5-1 - 4) ! That is 4 ! We
generally call as NP problem NP problem, which means non polynomial problem. To solve non
polynomial problem, we use heuristic method. Heuristic method helps you like in travelling
salesman problem. In 24 puzzle problem you might have to go up to 10^24 states which is
practically impossible A very big value. Depth first search is time consuming and this is a quick
solution Hand over here if we talk about the real life example Or if I talk on its bases Which are
the popular algorithms that is depth first search Breadth first search. In informed A * algorithm is
very important Heuristic DFS is there Or heuristic BFS can also be there Best first search
method is there.
Breadth First Search with example | Uninformed Search | Artificial Intelligence
Gate Smashers are going to discuss Breadth search technique in artificial intelligence. In this
video we discuss all the key points and important points regarding it regarding it. These all
points will be very much helpful to you even if you are studying artificial intelligence in university
or college level exam. A is taking us ahead at how many places From A where all we can go ?
First we have added those elements over here So which are the elements ? B , C and D You
can write this in any order It is not necessary that you write B. C can take us to G and H So we
inserted G & H from tail So in this way we just have to keep on going Then we removed D from
here The meaning of removing D is Where is D taking us It is taking them on I. This knowledge
is the most important key point In BFS And this is only asked the most. level. level That means
instead of going in deep It completes the shallowest node the nearest node. In this will move
ahead level wise level wise. level that means. Instead of going deep, it completes shallowest
nodes the nearest nodes. level and moves level by level only.
Depth First Search (DFS) with example | Uninformed Search | Artificial Intelligence
Gate Smashers discuss DFS that is Depth First Search algorithm in artificial intelligence. In this
video you will come to know about all the important points and keyword about DFS. In
competitive exams like NTA NET or even if you preparing for college or university level exam
For artificial intelligence Then all the points will be clear over here. DFS sequence is one of the
possible DFS sequences you can follow in anyway. If we talk in this from A either I can put B &
C first In this way you can following any Let 's say if I follow this Then last in first out So which
In today 's video we are going to see Syllabus of artificial intelligence. We are discussing this
specially for NTA and NET exam. The syllabus if Artificial intelligence is mostly same only But if
we talk about NTA or NET exam Then they have already given syllabus of Artificial Syllabi on
their website. The first topic is approach to AI Approach to artificial intelligence I have added this
broad topics according to their syllabus only And if you also follow the book of Rich and Knight
Or of Soraj Kaushik Then in that also you will get the topics like this unit wise only So if we talk
about approach to. AI So this is the most important Why am I telling this most important
Because every time you. will get question from this unit And which is the topic The first. topic is
heuristic search Over here in heuristic. search we will talk about A * , AO * * , Best first We talk
specially about this algorithm After that we talk over here about game playing This is the most
important topic in the artificial intelligence 2nd most topic over here is Fuzzy set I will this also 3
start Because you will get questions from this also every year And questions are of same
pattern only Either it is AO * or it is best first Or you'll get questions on DFS and BFS. Then I
want to give neural network 2 stars over here.
What is Artificial Intelligence | Learn AI with Real Life Examples | Can Machine Think??
Gate Smashers is going to discuss Introduction to Artificial Intelligence. We want to make such
machines which can behave like humans Can think like humans And work like humans. On this
intelligent machines only our whole future depends on intelligent systems. We are still finding
the answer of this question And actually what we want to do. We want to put decision making
powers in machines We want that machines should take decisions by themselves And artificial
intelligence is working over here only The barrier of intelligence between humans and robots is
trying to break that So behind that there are many learning algorithms Searching, sorting
algorithms are there Reasoning algorithms are working behind it I want to give you one more
simple example. Artificial intelligence is the basic definition of artificial intelligence It is that we
want to make such machine Which should behave like human behavior. We want machines also
to think on their end And on that basis it should do decision making Then perception Then
learning Learning means as human being learn something We learn things from our experience
And we use those things in future.
What is State Space Search | Introduction to Problem Solving in Artificial Intelligence
Gate Smashers is going to discuss State space searching It is one of the major application of
artificial intelligence. Problem solving That is how to solve a particular problem And if we talk
about era of 1960-1970 At that time the major research that was done in artificial intelligence
That is done on problem solving And in which we talk related to game Like tic tac toe game is
there. In 8 puzzle problem that we have a board of 3 * 3, we have 9 spaces and 9 places In
which we have 8 tiles which are numbered. I have random tiles numberd 1,2,3,4,5,6,7,8 I have
numbered tiles And I have one empty space Now over here first of all I have to represent the
problem precisely That I have. I know that this is my start state Now I want goal state Where I
want to reach Otherwise you will keep on searching. You are starting to explore your searching
, And these are different branches These different branches are getting formed. If we keep the
space on left side Then this will be formed over here like this If I do it on left then 5 will come
here. If you move it left side then the next state That will be one of my resultant state Then
comes cost We measure it in cost What is the meaning of cost?
Uninformed Vs Informed Search in Artificial Intelligence with Example
Gate Smashers are going to discuss Difference between uninformed and informed searching. In
informed searching we are using information And we tell that information Heuristic This is very
important point I will explain you with a simple example Let 's say travelling salesman problem If
we talk about TSP problem there will be ( n-1 ) ! Possibilities How much will be a searching
space (n-1) If you have 5 number of cities That is value of n Then (5-1 - 4) ! That is 4 ! We
generally call as NP problem NP problem, which means non polynomial problem. To solve non
polynomial problem, we use heuristic method. Heuristic method helps you like in travelling
salesman problem. In 24 puzzle problem you might have to go up to 10^24 states which is
practically impossible A very big value. Depth first search is time consuming and this is a quick
solution Hand over here if we talk about the real life example Or if I talk on its bases Which are
the popular algorithms that is depth first search Breadth first search. In informed A * algorithm is
very important Heuristic DFS is there Or heuristic BFS can also be there Best first search
method is there.
Breadth First Search with example | Uninformed Search | Artificial Intelligence
Gate Smashers are going to discuss Breadth search technique in artificial intelligence. In this
video we discuss all the key points and important points regarding it regarding it. These all
points will be very much helpful to you even if you are studying artificial intelligence in university
or college level exam. A is taking us ahead at how many places From A where all we can go ?
First we have added those elements over here So which are the elements ? B , C and D You
can write this in any order It is not necessary that you write B. C can take us to G and H So we
inserted G & H from tail So in this way we just have to keep on going Then we removed D from
here The meaning of removing D is Where is D taking us It is taking them on I. This knowledge
is the most important key point In BFS And this is only asked the most. level. level That means
instead of going in deep It completes the shallowest node the nearest node. In this will move
ahead level wise level wise. level that means. Instead of going deep, it completes shallowest
nodes the nearest nodes. level and moves level by level only.
Depth First Search (DFS) with example | Uninformed Search | Artificial Intelligence
Gate Smashers discuss DFS that is Depth First Search algorithm in artificial intelligence. In this
video you will come to know about all the important points and keyword about DFS. In
competitive exams like NTA NET or even if you preparing for college or university level exam
For artificial intelligence Then all the points will be clear over here. DFS sequence is one of the
possible DFS sequences you can follow in anyway. If we talk in this from A either I can put B &
C first In this way you can following any Let 's say if I follow this Then last in first out So which
