Professional Documents
Culture Documents
Section-A
Answer:
Definition 1:
Artificial intelligence (AI) is an area of computer science that emphasizes the creation of
intelligent machines that work and react like humans. Some of the activities computers with
artificial intelligence are designed for include:
Speech recognition
Learning
Planning
Problem solving
Definition 2:
Artificial intelligence is a branch of computer science that aims to create intelligent machines. It
has become an essential part of the technology industry.
Research associated with artificial intelligence is highly technical and specialized. The core
problems of artificial intelligence include programming computers for certain traits such as:
a) Knowledge
b) Reasoninge
c) Problem solving
d) Perception
e) Learning
f) Planning
g) Ability to manipulate and move objects
Applications of AI
Game playing
You can buy machines that can play master level chess for a few hundred dollars. There is some
AI in them, but they play well against people mainly through brute force computation--looking at
Page 1 of 25
hundreds of thousands of positions. To beat a world champion by brute force and known reliable
heuristics requires being able to look at 200 million positions per second.
Speech recognition
In the 1990s, computer speech recognition reached a practical level for limited purposes. Thus
United Airlines has replaced its keyboard tree for flight information by a system using speech
recognition of flight numbers and city names. It is quite convenient. On the the other hand, while
it is possible to instruct some computers using speech, most users have gone back to the
keyboard and the mouse as still more convenient.
Just getting a sequence of words into a computer is not enough. Parsing sentences is not enough
either. The computer has to be provided with an understanding of the domain the text is about,
and this is presently possible only for very limited domains.
Computer vision
The world is composed of three-dimensional objects, but the inputs to the human eye and
computers' TV cameras are two dimensional. Some useful programs can work solely in two
dimensions, but full computer vision requires partial three-dimensional information that is not
just a set of two-dimensional views. At present there are only limited ways of representing three-
dimensional information directly, and they are not as good as what humans evidently use.
Expert systems
A ``knowledge engineer'' interviews experts in a certain domain and tries to embody their
knowledge in a computer program for carrying out some task. How well this works depends on
whether the intellectual mechanisms required for the task are within the present state of AI.
When this turned out not to be so, there were many disappointing results. One of the first expert
systems was MYCIN in 1974, which diagnosed bacterial infections of the blood and suggested
treatments. It did better than medical students or practicing doctors, provided its limitations were
observed. Namely, its ontology included bacteria, symptoms, and treatments and did not include
patients, doctors, hospitals, death, recovery, and events occurring in time. Its interactions
depended on a single patient being considered. Since the experts consulted by the knowledge
engineers knew about patients, doctors, death, recovery, etc., it is clear that the knowledge
engineers forced what the experts told them into a predetermined framework. In the present state
of AI, this has to be true. The usefulness of current expert systems depends on their users having
common sense.
Heuristic classification
Page 2 of 25
One of the most feasible kinds of expert system given the present knowledge of AI is to put some
information in one of a fixed set of categories using several sources of information. An example
is advising whether to accept a proposed credit card purchase. Information is available about the
owner of the credit card, his record of payment and also about the item he is buying and about
the establishment from which he is buying it (e.g., about whether there have been previous credit
card frauds at this establishment).
Answer:
Expert Systems are computer programs that are derived from a branch of computer science
research called Artificial Intelligence (AI). AI's scientific goal is to understand intelligence by
building computer programs that exhibit intelligent behavior. It is concerned with the concepts
and methods of symbolic inference, or reasoning, by a computer, and how the knowledge used to
make those inferences will be represented inside the machine.
Of course, the term intelligence covers many cognitive skills, including the ability to solve
problems, learn, and understand language; AI addresses all of those. But most progress to date in
AI has been made in the area of problem solving -- concepts and methods for building programs
that reason about problems rather than calculate a solution.
AI programs that achieve expert-level competence in solving problems in task areas by bringing
to bear a body of knowledge about specific tasks are called knowledge-based or expert systems.
Often, the term expert systems is reserved for programs whose knowledge base contains the
knowledge used by human experts, in contrast to knowledge gathered from textbooks or non-
experts. More often than not, the two terms, expert systems (ES) and knowledge-based systems
(KBS), are used synonymously. Taken together, they represent the most widespread type of AI
application. The area of human intellectual endeavor to be captured in an expert system is called
the task domain
b) The performance of the task should be related to both breadth and depth of knowledge.
Page 3 of 25
a) Choose the type of inference control required.
Step 3: Acquire initial knowledge about the domain and the task
c) Obtain, record and cross-check factual knowledge from both reference material and
experts
d) Obtain and record task-related rules from the experts and confirm them as far as
possible
a) Factual knowledge
b) Inference knowledge
c) Control knowledge
Page 4 of 25
c) Augment the system with information on additional domain tasks and test again
3 .What are various heuristics search techniques? Explain how they are different from the search
techniques.
Answer:
All of the search methods in the preceding section are uninformed in that they did not take into
account the goal. They do not use any information about where they are trying to get to unless
they happen to stumble on a goal. One form of heuristic information about which nodes seem the
most promising is a heuristic function h (n), which takes a node n and returns a non-negative real
number that is an estimate of the path cost from node n to a goal node. The function h (n) is an
underestimate if h(n) is less than or equal to the actual cost of a lowest-cost path from node n to a
goal.
The heuristic function is a way to inform the search about the direction to a goal. It provides an
informed way to guess which neighbor of a node will lead to a goal.
There is nothing magical about a heuristic function. It must use only information that can be
readily obtained about a node. Typically a trade-off exists between the amount of work it takes to
derive a heuristic value for a node and how accurately the heuristic value of a node measures the
actual path cost from the node to a goal.
A standard way to derive a heuristic function is to solve a simpler problem and to use the actual
cost in the simplified problem as the heuristic function of the original problem.
Page 5 of 25
Example: For the graph of Figure 3.2, the straight-line distance in the world between the node
and the goal position can be used as the heuristic function. The examples that follow assume the
following heuristic function:
h(c3) = 12 h(storage) = 12
This h function is an underestimate because the h value is less than or equal to the exact cost of a
lowest-cost path from the node to a goal. It is the exact cost for node o123. It is very much an
underestimate for node b1, which seems to be close, but there is only a long route to the goal. It
is very misleading for c1, which also seems close to the goal, but no path exists from that node to
the goal.
Heuristic search algorithms have knowledge of where the goal or finish of the graph. For
example, in a maze, they would know which path leads in the direction of the goal. Blind search
algorithms have no knowledge of where the goal is, and wander "blindly" through the graph.
Answer:
Adequate response time: They should have the ability to respond in a reasonable amount of
time. Time is crucial especially for real time systems.
Understandable: They should not be a black box instead it should be able explain the steps of
the reasoning process. It should justify its conclusions in the same way a human expert explains
why he arrived at particular conclusion.
Page 6 of 25
Capabilities of the Expert Systems
3. Should be able to draw the conclusions from the relationships that are very complex in
the nature.
6. Is not used or tested much due to the reason which says that it is difficult to use.
7. Does not possess the ability to deal with the mixed knowledge.
a. Robotics
Answer:
The dictionary meaning of robot is a mechanical man or a more than humanly efficient
automation. It is an automatic apparatus or device that performs functions ascribed to human
Page 7 of 25
beings or operates with what appears to be almost human intelligence. But this defamation does
not give a human shape to the robot. The robot does the work of a human being.
The Robot Institute of America has given a very interesting definition on an Industrial robot.
Industrial robots are usually used at industries. "An Industrial robot is a reprogrammable,
multifunctional manipulator designed to move materials, parts, tools or special devices through
variable programmed motions for the performance of a variety of tasks".
So, a robot is capable of being reprogrammed. This characteristic distinguishes it from a fixed
automation. A fixed automation is designed to do one and only one specific task. If the
specification of task changes even slightly the fixed automation becomes incapable of
performing the task. It is designed to perform according to one fixed specification.
Applications of Robots:
Though robots are used widely in industries but they are also popular in other fields like
agriculture, nuclear energy, firefighting, mining, undersea exploration, space exploration,
medical applications etc.
(1) Industries:
Use of robots in industries are very common because they can offer reduced cost of production,
increase productivity, improve production quality, and can operate hazardous and hostile
environment. Robots, at industries are classified according to the type of work they perform like
Pick- and place robots, point-to-point robots, assembly robots etc.
(2) Agriculture:
In agriculture, robots are now successfully utilized for fruit picking, potato digging etc.
Robots can perform hazardous works like firefighting to extinguish the fire and in mining
operations.
b. Expert system
Answer:
Page 8 of 25
Expert Systems are computer programs that are derived from a branch of computer science
research called Artificial Intelligence (AI). AI's scientific goal is to understand intelligence by
building computer programs that exhibit intelligent behavior. It is concerned with the concepts
and methods of symbolic inference, or reasoning, by a computer, and how the knowledge used to
make those inferences will be represented inside the machine.
Of course, the term intelligence covers many cognitive skills, including the ability to solve
problems, learn, and understand language; AI addresses all of those. But most progress to date in
AI has been made in the area of problem solving -- concepts and methods for building programs
that reason about problems rather than calculate a solution.
AI programs that achieve expert-level competence in solving problems in task areas by bringing
to bear a body of knowledge about specific tasks are called knowledge-based or expert systems.
Often, the term expert systems is reserved for programs whose knowledge base contains the
knowledge used by human experts, in contrast to knowledge gathered from textbooks or non-
experts. More often than not, the two terms, expert systems (ES) and knowledge-based systems
(KBS), are used synonymously. Taken together, they represent the most widespread type of AI
application. The area of human intellectual endeavor to be captured in an expert system is called
the task domain
Answer:
Current approaches to NLP are based on machine learning, a type of artificial intelligence that
examines and uses patterns in data to improve a program's own understanding. Most of the
research being done on natural language processing revolves around search, especially enterprise
search.
The advantage of natural language processing can be seen when considering the following two
statements: "Cloud computing insurance should be part of every service level agreement" and "A
Page 9 of 25
good SLA ensures an easier night's sleep -- even in the cloud." If you use national language
processing for search, the program will recognize that cloud computing is an entity, that cloud is
an abbreviated form of cloud computing and that SLA is an industry acronym for service level
agreement.
Answer:
Answer:
This class comprises systems that deduce faults and suggest corrective actions for a
malfunctioning device or process. Medical diagnosis was one of the first knowledge areas to
which ES technology was applied (for example, see Shortliffe 1976), but diagnosis of engineered
systems quickly surpassed medical diagnosis. There are probably more diagnostic applications of
Page 10 of 25
ES than any other type. The diagnostic problem can be stated in the abstract as: given the
evidence presenting itself, what is the underlying problem/reason/cause?
Systems that fall into this class analyze a set of one or more potentially complex and interacting
goals in order to determine a set of actions to achieve those goals, and/or provide a detailed
temporal ordering of those actions, taking into account personnel, materiel, and other constraints.
This class has great commercial potential, which has been recognized. Examples involve airline
scheduling of flights, personnel, and gates; manufacturing job-shop scheduling; and
manufacturing process planning.
The financial services industry has been a vigorous user of expert system techniques. Advisory
programs have been created to assist bankers in determining whether to make loans to businesses
and individuals. Insurance companies have used expert systems to assess the risk presented by
the customer and to determine a price for the insurance. A typical application in the financial
markets is in foreign exchange trading.
Knowledge Publishing
This is a relatively new, but also potentially explosive area. The primary function of the expert
system is to deliver knowledge that is relevant to the user's problem, in the context of the user's
problem. The two most widely distributed expert systems in the world are in this category. The
first is an advisor which counsels a user on appropriate grammatical usage in a text. The second
is a tax advisor that accompanies a tax preparation program and advises the user on tax strategy,
tactics, and individual tax policy.
Systems falling in this class analyze real-time data from physical devices with the goal of
noticing anomalies, predicting trends, and controlling for both optimality and failure correction.
Examples of real-time systems that actively monitor processes can be found in the steel making
and oil refining industries.
Page 11 of 25
Design and Manufacturing
These systems assist in the design of physical devices and processes, ranging from high-level
conceptual design of abstract entities all the way to factory floor configuration of manufacturing
processes.
Answer:
Best first search is different from BFS and DFS by that that it uses problem specific information
to choose which node of the search tree to expand next. Best first search is informed search and
DFS and BFS are uninformed searches.
In order to use infored search algorithm you need to represent the knowledge of the problem as
heuristic function.
Best first search is sometimes another name for Greedy Best First Search, but it may also mean
class of search algorithms, that chose to expand the most promising node based on an evaluation
function(not necessary the same as the heuristics) such as Greedy Best First Search, A* and
others.
Let all arcs have the same cost, S - start node, G - goal node and h-heuristic function
Page 12 of 25
Section-B
A problem-solving search can either forward or backward. What factors determine the
choice of direction for a particular problem?
Answer:
The size of the search space of the generic search algorithm on finite uniform graphs is bk, where
b is the branching factor and k is the path length. Anything that can be done to reduce k or b can
potentially give great savings. The abstract definition of the graph-searching method of problem
solving is symmetric in the sense that the algorithm can either begin with a start node and search
forward for a goal node or begin with a goal node and search backward for a start node in the
inverse graph. Note that in many applications the goal is determined implicitly by a Boolean
function that returns true when a goal is found, and not explicitly as a set of nodes, so backward
search may not be possible.
For those cases where the goal nodes are explicit, it may be more efficient to search in one
direction than in the other. The size of the search space is exponential in the branching factor. It
is typically the case that forward and backward searches have different branching factors. A
general principle is to search forward or backward, depending on which has the smaller
branching factor.
Page 13 of 25
Whether you use forward or backwards reasoning to solve a problem depends on the properties
of your rule set and initial facts. Sometimes, if you have some particular goal (to test some
hypothesis), then backward chaining will be much more efficient, as you avoid drawing
conclusions from irrelevant facts. However, sometimes backward chaining can be very wasteful -
there may be many possible ways of trying to prove something, and you may have to try almost
all of them before you find one that works. Forward chaining may be better if you have lots of
things you want to prove (or if you just want to find out in general what new facts are true);
when you have a small set of initial facts; and when there tend to be lots of different rules which
allow you to draw the same conclusion. Backward chaining may be better if you are trying to
prove a single fact, given a large set of initial facts, and where, if you used forward chaining, lots
of rules would be eligible to fire in any cycle.
Knowledge acquisition is the process used to define the rules and ontologies required for a
knowledge-based system. The phrase was first used in conjunction with expert systems to
describe the initial tasks associated with developing an expert system, namely finding and
interviewing domain experts and capturing their knowledge via rules, objects, and frame-based
ontologies.
Expert systems were one of the first successful applications of artificial intelligence technology
to real world business problems. Researchers at Stanford and other AI laboratories worked with
doctors and other highly skilled experts to develop systems that could automate complex tasks
such as medical diagnosis. Until this point computers had mostly been used to automate highly
data intensive tasks but not for complex reasoning. Technologies such as inference engines
allowed developers for the first time to tackle more complex problems.
One approach to knowledge acquisition investigated was to use natural language parsing and
generation to facilitate knowledge acquisition. Natural language parsing could be performed on
manuals and other expert documents and an initial first pass at the rules and objects could be
developed automatically. Text generation was also extremely useful in generating explanations
for system behavior. This greatly facilitated the development and maintenance of expert systems.
3. What do you understand by uniformed search? What are its advantages & disadvantages over
informed search? What is breadth first search better than depth first search better than depth first
and vice-versa? Explain.
Page 14 of 25
Answer:
A problem determines the graph and the goal but not which path to select from the frontier. This
is the job of a search strategy. A search strategy specifies which paths are selected from the
frontier. Different strategies are obtained by modifying how the selection of paths in the frontier
is implemented.
This section presents three uninformed search strategies that do not take into account the location
of the goal. Intuitively, these algorithms ignore where they are going until they find a goal and
report success.
Advantages:-
This uninformed search strategy can find the goal node where ever it is located in the search tree
since it traverses the each node in a breadth-first manner until the goal node is reached. So we
call this search strategy to be ‘Complete’ since it always guarantees that it finds the goal node at
some level.
This finds the goal node is an optimal manner if each of the costs of traversing one node to the
other is similar for the entire search tree.
In this type of search, the main idea is that the root node is expanded first and then all the
successor states of the root node are expanded afterwards. In the next step the rest of the
successor states of the states traversed first would be explored. This activity is continued until the
goal state for that specific problem is reached. So, at each state, it is checked whether it is the
goal state or not. If we explain the breadth-first search in more specific terms, it requires all the
nodes at a given depth of the search tree/graph to be expanded before going to the next depth
level of the tree. Following search tree shows how breadth-first traversal works.
Figure 1 – Breadth-first traversal on the state space denoted by a search tree. The root node is
‘A’ and the goal node is ‘F’.
Page 15 of 25
The breadth-first traversal searches the tree in this order as depicted by the red arrows.
A->B->C->D->E->F
In the depth-first search (DFS) strategy, there is a clear distinction from the BFS. This always
expands the deepest node in the search tree and goes along the depth of each node rather than
across the breadth. In figure 2, we have shown how DFS would work on the same search tree as
used in illustrating the behaviour of BFS.
Figure 2 – Depth-first traversal on the state space denoted by a search tree. The root node is ‘A’
and the goal node is ‘F’.
The depth-first traversal searches the tree in this order as depicted by the blue arrows.
A->B->E->F
In this particular scenario, it can be clearly seen that DFS find the goal node in less number of
steps when compared to BFS (There can be situations where this would not hold as well).
Let’s now take a look at the advantages and disadvantages of the DFS search strategy.
Section-C
Page 16 of 25
Question No. 1 Marks - 10
What is Artificial intelligence?
Options
1. Putting your intelligence into Computer
2. Programming with your own intelligence
3. Making a Machine intelligent
4. Playing a Game
Options
1. Linear approach
2. Heuristic approach
3. Optimal approach
4. Random approach
Options
1. PROLOG
2. Java
3. LISP
4. Perl
Options
1. Depth-First Search
2. Breadth-First search
3. Both (a) and (b)
4. Linear Search.
Options
1. To discover something or an idea embedded in a program
2. To search and measure how far a node in a search tree seems to be from a goal
3. To compare two nodes in a search tree to see if one is better than the other
4. Only (a), (b) and (c).
Page 17 of 25
Question No. 6 Marks - 10
What is state space?
Options
1. The whole problem
2. Your Definition to a problem
3. Problem you design
4. Representing your problem with variable and parameter
Options
1. A set of Rule
2. A sequence of steps
3. Arbitrary representation to problem
4. Both (a) and (b)
Options
1. James C Gosling
2. Dennis Ritchie
3. Alan Turing
4. Isaac Newton
Options
1. Knowledge
2. Meta-knowledge
3. Artificial Knowledge
4. Performance
Options
1. rationalist
2. Top-down
3. bottom-up
4. push-pop approach
Page 18 of 25
Options
1. Meta-Knowledge
2. Performance Knowledge
3. Standard knowledge
4. Specific knowledge
Options
1. Functional behaviour
2. Human behaviour
3. Human brain
4. Statistical analysis
Options
1. i-True, ii-False
2. i-True, ii-True
3. i-False, ii-False
4. i-False, ii-True
Options
1. Recognizing objects
2. Answering questions
3. Manipulating robotic devices
4. All of the above
Options
1. Expert system
2. Knowledge system
3. Common system
4. Communication system
Page 19 of 25
Question No. 16 Marks - 10
One method of programming a computer to exhibit human intelligence is called modeling
on____________.
Options
1. simulation
2. cognition
3. more intelligence.
4. programming
Options
1. Automatic programming.
2. Decision support.
3. Intelligent computer assisted instruction.
4. Expert systems.
Options
1. The Turing test.
2. LISP.
3. Cyber entices.
4. The logic theorist.
Options
1. John MC Carthy.
2. Marvin minsky.
3. Natheniel Rochester.
4. Claude Shannon.
Options
1. program.
2. learn.
3. Learn and program.
4. read.
Page 20 of 25
Question No. 21 Marks - 10
An expert system differs from a database program if only an expert system__________.
Options
1. contains declarative knowledge.
2. contains procedural knowledge.
3. features the ret rival of sorted information.
4. excepts users to draw their own conclusions.
Options
1. Inference engine.
2. Knowledge base.
3. User interface.
4. GUI
Options
1. production rules.
2. rule interpreters.
3. control rules.
4. meta rules.
Options
1. cognitive scientist.
2. domain expert.
3. knowledge engineer.
4. software engineer.
Options
1. descriptive.
2. diagnostic.
3. interpretive.
4. iterative.
Page 21 of 25
Question No. 26 Marks - 10
A problem is first connected to the proposed solution during the_____________ stage.
Options
1. identification.
2. conceptualization.
3. formalization.
4. implementation.
Options
1. hill climbing search.
2. breadth first
3. depth first
4. shortest path
Options
1. depth first search
2. heuristic search
3. best first search
4. beam search
Options
1. million Instructions per hour.
2. million Instructions per second.
3. million Instructions per day.
4. million Instructions per minute.
Options
1. state space representation and problem.
2. state space representation and representation.
3. state space representation problem representation.
4. state space representation and problem representation.
Page 22 of 25
Basically the knowledge of an expert occupies three distinctive layers____________.
Options
1. factual knowledge, heuristic knowledge .
2. factual knowledge, meta knowledge.
3. factual knowledge, heuristic knowledge, meta knowledge.
4. heuristic knowledge, meta knowledge.
Options
1. AI workstations.
2. super minicomputers.
3. time sharing terminals.
4. client machines.
Options
1. Knowledge Engineering.
2. Imposed Structure.
3. Rapid Prototyping.
4. Protocols.
Options
1. Depth first search
2. Depth limited search.
3. Breadth first search.
4. Breadth limited search
Options
1. uniformed Search.
2. . breadth first search.
3. . depth first search.
4. uniform cost.
Page 23 of 25
The simple strategy in which the root node is expanded first then all the successors and so on
.this is called _____.
Options
1. informed search.
2. breadth first search.
3. uniform cost search.
4. linear search.
Options
1. robot navigation.
2. traveling salesperson problem.
3. nternet searching.
4. search tree
Options
1. Real-world problem.
2. Toy problem
3. 8-puzzle problem.
4. 8-queen problem.
Options
1. Logic.
2. Syllogisms.
3. Philosophy.
4. Rational agent
Options
1. agent generator
2. program generator.
Page 24 of 25
3. problem generator.
4. output generator
Page 25 of 25