The document provides an overview of various concepts related to artificial intelligence (AI), including definitions of AI, neural networks, search algorithms, logic systems, and decision trees. It discusses key methodologies and algorithms such as A*, ID3, and genetic algorithms, highlighting their applications and differences. Additionally, it outlines the installation of Python and its libraries for AI projects, emphasizing reinforcement learning and Bayesian networks.

2. 1. What is Artificial Intelligence?
Artificial Intelligence is an area of computer
science that emphasizes the creation of
intelligent machine that work and reacts
like Huma

3. 2. What is an artificial intelligence Neural Networks?
Artificial intelligence Neural Networks can model
mathematically the way biological brain works,
allowing the machine to think and learn the same
way the humans do- making them capable of
recognizing things like speech, objects and animals
like we do

4. 3. What are the various areas where AI (Artificial
Intelligence) can be used?
Artificial Intelligence can be used in many areas like
Computing, Speech recognition, Bio-informatics,
Humanoid robot, Computer software, Space and
Aeronautics‟s etc.

5. 4. Which is not commonly used programming
language for AI?
Perl language is not commonly used
programming language for AI.

6. 5. What do you mean by Searching Algorithm?
A search algorithm is the step-by-step procedure
used to locate specific data among a collection of
data. It is considered a fundamental procedure in
computing. In computer science, when searching
for data, the difference between a fast application
and a slower one often lies in the use of the
proper search algorithm

7. 6. What is BFS, DFS, A* IDA* and SMA* Algorithm?
BFS=Breadth first search is a graph traversal
algorithm that starts traversing the graph from root
node and explores all the neighbouring nodes.
Then, it selects the nearest node and explore all the
unexplored nodes. The algorithm follows the same
process for each of the nearest node until it finds
the goal..

8. DFS=Depth first search (DFS) algorithm starts with
the initial node of the graph G, and then goes to
deeper and deeper until we find the goal node or
the node which has no children. The algorithm,
then backtracks from the dead end towards the
most recent node that is yet to be completely
unexplored.

9. A*=A* Search algorithm is one of the best
and popular technique used in path-finding
and graph traversals.

10. IDA*=Iterative deepening A* (IDA*) is a graph
traversal and path search algorithm that can find
the shortest path between a designated start
node and any member of a set of goal nodes in a
weighted graph. ... Unlike A*, IDA* does not
utilize dynamic programming and therefore
often ends up exploring the same nodes many
times.

11. SMA*=SMA* or Simplified Memory Bounded
A* is a shortest path algorithm based on the
A* algorithm. The main advantage of SMA* is
that it uses a bounded memory, while the A*
algorithm might need exponential memory. All
other characteristics of SMA* are inherited
from A*.

12. 7. What do you mean by propositional logic?
A propositional is classified as a declarative
sentence which is either true or false.

13. 8. What do you mean by first order periodic logic?
First-order logic is symbolized reasoning in which
each sentence, or statement, is broken down into a
subject and a predicate. The predicate modifies or
defines the properties of the subject. ... First-order
logic is also known as first-order predicate calculus
or first-order functional calculus.

14. 9. What do you mean by baysian rule?
In probability theory and
statistics, Bayes' theorem(alternatively Baye
s' law or Bayes' rule) describes the
probability of an event, based on prior
knowledge of conditions that might be
related to the event

15. 10. Define Decision tree?
A decision tree is a graphical representation of
specific decision situations that are used when
complex branching occurs in a structured decision
process. A decision tree is a predictive model
based on a branching series of Boolean tests that
use specific facts to make more generalized
conclusions.

16. 11. What do you mean by ID3, Cart and 4.5 algorithm?
ID3, or Iternative Dichotomizer, was the first of three Decision Tree
implementations developed by Ross Quinlan (Quinlan, J. R.
1986. Induction of Decision Trees. Mach. Learn. 1, 1 (Mar. 1986), 81-106.)
CART, or Classification And Regression Trees is often used as a generic
acronym for the term Decision Tree, though it apparently has a
more specific meaning.
C4.5, Quinlan's next iteration. The new features (versus ID3) are: (i)
accepts both continuous and discrete features; (ii) handles incomplete
data points; (iii) solves over-fitting problem by (very clever) bottom-up
technique usually known as "pruning";

17. 12. Installing Python
Python distribution is available for a large number of platforms. You
need to download only the binary code applicable for your platform
and install Python.
Open a Web browser and go to https://www.python.org/downloads
Follow the link for the Windows installer python-XYZ.msi file where
XYZ is the version you need to install. To use this installer python-
XYZ.msi, the Windows system must support Microsoft Installer 2.0.
Save the installer file to your local machine and then run it to find out
if your machine supports MSI. Run the downloaded file. This brings
up the Python install wizard, which is really easy to use. Just accept
the default settings and wait until the install is finished

18. 13. Setting up PATH
To add the Python directory to the path for a
particular session in Windows −
At the command prompt − type path
%path%;C:Python and press Enter.
Note − C:Python is the path of the Python
directory

19. 14. Which is the best way to go for Game playing
problem?
Heuristic approach is the best way to go for game
playing problem, as it will use the technique
based on intelligent guesswork. For example,
Chess between humans and computers as it will
use brute force computation, looking at hundreds
of thousands of positions

20. 15. A* algorithm is based on which search method?
A* algorithm is based on best first search method,
as it gives an idea of optimization and quick choose
of path, and all characteristics lie in A* algorithm

21. 16. What is agent in artificial intelligence?
Anything perceives its environment by sensors
and acts upon an environment by effectors are
known as Agent. Agent includes Robots,
Programs, and Humans et.

22. 17. What is a heuristic function?
A heuristic function ranks alternatives, in
search algorithms, at each branching step
based on the available information to
decide which branch to follow.

23. 18. Mention the difference between breadth first
search and best first search in artificial
intelligence?
These are the two strategies which are quite
similar. In best first search, we expand the nodes
in accordance with the evaluation function.
While, in breadth first search a node is expanded
in accordance to the cost function of the parent
node.

24. 19. What is FOPL stands for and explain its role in
Artificial Intelligence?
FOPL stands for First Order Predicate Logic, Predicate
Logic provides
a)A language to express assertions about certain
“World”
b)An inference system to deductive apparatus
whereby we may draw conclusions from such
assertion
c)A semantic based on set theory

25. 20. Which search algorithm will use a limited
amount of memory in online search?
RBFE and SMA* will solve any kind of problem that
A* can‟t by using a limited amount of memory.

26. 21. In ‘Artificial Intelligence’ where you can use
the Bayes rule?
In Artificial Intelligence to answer the
probabilistic queries conditioned on one piece of
evidence, Bayes rule can be used

27. 22. For building a Bayes model how many
terms are required?
For building a Bayes model in AI, three terms
are required; they are one conditional
probability and two unconditional probability

28. 23. To answer any query how the Bayesian
network can be used?
If a Bayesian Network is a representative of
the joint distribution, then by summing all
the relevant joint entries, it can solve any
query.

29. 24. What is fuzzy logic?
Fuzzy logic is the subset of AI, it is a way of
encoding human learning for artificial
processing. It is a form of many-valued logic.
It is represented as IF-THEN rules.

30. 25. What are Genetic Algorithms With Python?
Genetic Algorithm (GA) is a metaheuristic inspired by
natural selection and is a part of the class of
Evolutionary Algorithms (EA). We use these to
generate high-quality solutions to optimization and
search problems, for which, these use bio-inspired
operators like mutation, crossover, and selection. In
other words, using these, we hope to achieve optimal
or near-optimal solutions to difficult problems. Such
algorithms simulate natural selection

31. 26. What is NLP?
NLP is a way for computers to analyze human
language and derive useful meaning from it. It lets
you organize and structure knowledge to let you
perform the following tasks-
a) Automatic Summarization b) Translation c)
Named Entity Recognition d) Relationship
Extraction e) Sentiment Analysis f) Speech
Recognition g) Topic Segmentation

32. 27. Python Inbuilt libraries for AI projects
A major advantage for using Python for AI is that it comes with inbuilt
libraries. Python has libraries for almost all kinds of AI projects. For
example, NumPy, SciPy, matplotlib, nltk, SimpleAI are some the
important inbuilt libraries of Python.
1) Open source − Python is an open source programming language. This
makes it widely popular in the community.
2) Can be used for broad range of programming − Python can be used for
a broad range of programming tasks like small shell script to enterprise
web applications. This is another reason Python is suitable for AI projects

33. 28. Do you know about AI Algorithms
One difference to humans is that AI does not
possess the features of human commonsense
reasoning and folk psychology. This makes it end
up making different mistakes than a human
would

34. 29. What is Reinforcement learning?
Reinforcement Learning is a type of Machine
Learning, and thereby also a branch of Artificial
Intelligence. It allows machines and software
agents to automatically determine the ideal
behaviour within a specific context, in order to
maximize its performance

35. Thank You…