Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “History – 1”.
1. In LISP, the function returns the list that results after the first element is removed (the rest f the list), is __________
a) car
b) last
c) cons
d) cdr
Explanation: None.
2. Which of the following contains the output segments of Artificial Intelligence programming?
a) Printed language and synthesized speech
b) Manipulation of physical object
c) Locomotion
d) All of the mentioned
Explanation: None.
3. LISP was created by?
a) John McCarthy
b) Marvin Minsky
c) Alan Turing
d) Allen Newell and Herbert Simon
Explanation: None.
4. Expert Ease was developed under the direction of __________
a) John McCarthy
b) Donald Michie
c) Lofti Zadeh
d) Alan Turing
Explanation: None.
5. An Artificial Intelligence system developed by Terry A. Winograd
to permit an interactive dialogue about a domain he called blocks-world.
a) SHRDLU
b) SIMD
c) BACON
d) STUDENT
Explanation: None.
6. MLMenu, a natural language interface for the TI Explorer, is similar to __________
a) Ethernet
b) NaturalLink
c) PROLOG
d) The Personal Consultant
Explanation: None.
7. Strong Artificial Intelligence is __________
a) the embodiment of human intellectual capabilities within a computer
b) a set of computer programs that produce output that would be
considered to reflect intelligence if it were generated by humans
c) the study of mental faculties through the use of mental models implemented on a computer
d) all of the mentioned
Explanation: None.
8. The traditional way to exit and LISP system is to enter __________
a) quit
b) exit
c) bye
d) ok
Explanation: None.
9. In which of the following situations might a blind search be acceptable?
a) real-life situation
b) complex game
c) small search space
d) all of the mentioned
Explanation: None.
10. What is Artificial intelligence?
a) Putting your intelligence into Computer
b) Programming with your own intelligence
c) Making a Machine intelligent
d) Playing a Game
Explanation: Because AI is to make things work automatically through machine without using human effort. Machine will give the result with just giving input from human. That means the system or machine will act as per the requirement.
11. Which search method takes less memory?
a) Depth-First Search
b) Breadth-First search
c) Optimal search
d) Linear Search
Explanation: Depth-First Search takes less memory since only the nodes on the current path are stored, but in Breadth First Search, all of the tree that has generated must be stored.
Explanation: In a heuristic approach, we discover certain idea and use heuristic functions to search for a goal and predicates to compare nodes.
13. How do you represent “All dogs have tails”?
a) ۷x: dog(x) àhastail(x)
b) ۷x: dog(x) àhastail(y)
c) ۷x: dog(y) àhastail(x)
d) ۷x: dog(x) àhasàtail(x)
Explanation: We represent the statement in mathematical logic taking ‘x ‘as Dog and which has tail. We cannot represent two variable x, y for the same object Dog that has tail. The symbol “۷ “represent all.
14. Which is not a property of representation of knowledge?
a) Representational Verification
b) Representational Adequacy
c) Inferential Adequacy
d) Inferential Efficiency
Explanation: There is nothing to go for Representational verification; the verification comes under Representational adequacy.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Facts – 1”.
1. When talking to a speech recognition program, the program divides each second of your speech into 100 separate __________
a) Codes
b) Phonemes
c) Samples
d) Words
Explanation: None.
2. Which term is used for describing the judgmental or commonsense part of problem solving?
a) Heuristic
b) Critical
c) Value based
d) Analytical
Explanation: None.
3. Which stage of the manufacturing process has been described as “the mapping of function onto form”?
a) Design
b) Distribution
c) Project management
d) Field service
Explanation: None.
4. Which kind of planning consists of successive representations of different levels of a plan?
a) hierarchical planning
b) non-hierarchical planning
c) project planning
d) all of the mentioned
Explanation: None.
5. What was originally called the “imitation game” by its creator?
a) The Turing Test
b) LISP
c) The Logic Theorist
d) Cybernetics
Explanation: None.
6. Decision support programs are designed to help managers make __________
a) budget projections
b) visual presentations
c) business decisions
d) vacation schedules
Explanation: None.
7. PROLOG is an AI programming language, which solves problems with a
form of symbolic logic known as predicate calculus. It was developed in
1972 at the University of Marseilles by a team of specialists. Can you
name the person who headed this team?
a) Alain Colmerauer
b) Niklaus Wirth
c) Seymour Papert
d) John McCarthy
Explanation: None.
8. Programming a robot by physically moving it through the trajectory you want it to follow be called __________
a) contact sensing control
b) continuous-path control
c) robot vision control
d) pick-and-place control
Explanation: None.
9. To invoke the LISP system, you must enter __________
a) AI
b) LISP
c) CL (Common Lisp)
d) Both LISP and CL
Explanation: None.
10. In LISP, what is the function (list-length <list>)?
a) returns a new list that is equal to <:list> by copying the top-level element of <list>
b) returns the length of <list>
c) returns t if <list> is empty
d) all of the mentioned
Explanation: None.
11. ART (Automatic Reasoning Tool) is designed to be used on __________
a) LISP machines
b) Personal computers
c) Microcomputers
d) All of the mentioned
Explanation: None.
Explanation: None.
13. Shaping teaching techniques to fit the learning patterns of individual students is the goal of __________
a) decision support
b) automatic programming
c) intelligent computer-assisted instruction
d) expert systems
Explanation: None.
14. Which of the following function returns t If the object is a symbol m LISP?
a) (* <object>)
b) (symbolp <object>)
c) (nonnumeric <object>)
d) (constantp <object>)
Explanation: None.
15. The symbols used in describing the syntax of a programming language are __________
a) 0
b) {}
c) “”
d) <>
Explanation: None.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Agents”.
1. Which instruments are used for perceiving and acting upon the environment?
a) Sensors and Actuators
b) Sensors
c) Perceiver
d) None of the mentioned
Explanation: An agent is anything that can be viewed as perceiving and acting upon the environment through the sensors and actuators.
2. What is meant by agent’s percept sequence?
a) Used to perceive the environment
b) Complete history of actuator
c) Complete history of perceived things
d) None of the mentioned
Explanation: An agent’s percept sequence is the complete history of everything that the agent has ever perceived.
3. How many types of agents are there in artificial intelligence?
a) 1
b) 2
c) 3
d) 4
Explanation: The four types of agents are Simple reflex, Model based, Goal based and Utility based agents.
4. What is the rule of simple reflex agent?
a) Simple-action rule
b) Condition-action rule
c) Simple & Condition-action rule
d) None of the mentioned
Explanation: Simple reflex agent is based on the present condition and so it is condition action rule.
5. What are the composition for agents in artificial intelligence?
a) Program
b) Architecture
c) Both Program & Architecture
d) None of the mentioned
Explanation: An agent program will implement function mapping percepts to actions.
6. In which agent does the problem generator is present?
a) Learning agent
b) Observing agent
c) Reflex agent
d) None of the mentioned
Explanation: Problem generator will give the suggestion to improve the output for learning agent.
7. Which is used to improve the agents performance?
a) Perceiving
b) Learning
c) Observing
d) None of the mentioned
Explanation: An agent can improve its performance by storing its previous actions.
8. Which agent deals with happy and unhappy states?
a) Simple reflex agent
b) Model based agent
c) Learning agent
d) Utility based agent
Explanation: A utility function maps a state onto a real number which describes the associated degree of happiness.
9. Which action sequences are used to achieve the agent’s goal?
a) Search
b) Plan
c) Retrieve
d) Both Search & Plan
Explanation: When the environment becomes more tricky means, the agent needs plan and search action sequence to achieve the goal.
10. Which element in the agent are used for selecting external actions?
a) Perceive
b) Performance
c) Learning
d) Actuator
Explanation: None.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Agent Architecture”.
1. Which depends on the percepts and actions available to the agent?
a) Agent
b) Sensor
c) Design problem
d) None of the mentioned
Explanation: The design problem depends on the percepts and actions available to the agent, the goals that the agent’s behavior should satisfy.
2. Which were built in such a way that humans had to supply the inputs and interpret the outputs?
a) Agents
b) AI system
c) Sensor
d) Actuators
Explanation: AI systems were built in such a way that humans had to supply the inputs and interpret the outputs.
3. Which technology uses miniaturized accelerometers and gyroscopes?
a) Sensors
b) Actuators
c) MEMS
d) None of the mentioned
Explanation: Micro ElectroMechanical System uses miniaturized accelerometers and gyroscopes and is used to produce actuators.
4. What is used for tracking uncertain events?
a) Filtering algorithm
b) Sensors
c) Actuators
d) None of the mentioned
Explanation: Filtering algorithm is used for tracking uncertain events because in this the real perception is involved.
5. What is not represented by using propositional logic?
a) Objects
b) Relations
c) Both Objects & Relations
d) None of the mentioned
Explanation: Objects and relations are not represented by using propositional logic explicitly.
6. Which functions are used as preferences over state history?
a) Award
b) Reward
c) Explicit
d) Implicit
Explanation: Reward functions may be that preferences over states are really compared from preferences over state histories.
7. Which kind of agent architecture should an agent an use?
a) Relaxed
b) Logic
c) Relational
d) All of the mentioned
Explanation: Because an agent may experience any kind of situation, So that an agent should use all kinds of architecture.
8. Specify the agent architecture name that is used to capture all kinds of actions.
a) Complex
b) Relational
c) Hybrid
d) None of the mentioned
Explanation: A complete agent must be able to do anything by using hybrid architecture.
9. Which agent enables the deliberation about the computational entities and actions?
a) Hybrid
b) Reflective
c) Relational
d) None of the mentioned
Explanation: Because it enables the agent to capture within itself.
10. What can operate over the joint state space?
a) Decision-making algorithm
b) Learning algorithm
c) Complex algorithm
d) Both Decision-making & Learning algorithm
Explanation: Decision-making and learning algorithms can operate over the joint state space and thereby serve to implement and used to improve the computational activities.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Problem Solving”.
1. What is the main task of a problem-solving agent?
a) Solve the given problem and reach to goal
b) To find out which sequence of action will get it to the goal state
c) All of the mentioned
d) None of the mentioned
Explanation: The problem-solving agents are one of the goal-based agents.
2. What is state space?
a) The whole problem
b) Your Definition to a problem
c) Problem you design
d) Representing your problem with variable and parameter
Explanation: Because state space is mostly concerned with a problem, when you try to solve a problem, we have to design a mathematical structure to the problem, which can only be through variables and parameters. eg. You have given a 4-gallon jug and another 3-gallon jug. Neither has measuring marker on it. You have to fill the jugs with water. How can you get exactly 2 gallons of water in to 4 gallons. Here the state space can defined as set of ordered pairs integers(x,y), such that x=0,1,2,3 or 4 and y=0,1,2 or 3; X represents the number of gallons in 4 gallon jug and y represents the quantity of water in the 3-gallon jug.
3. The problem-solving agent with several immediate options of
unknown value can decide what to do by just examining different possible
sequences of actions that lead to states of known value, and then
choosing the best sequence. This process of looking for such a sequence
is called Search.
a) True
b) False
Explanation: Refer to the definition of problem-solving agent.
4. A search algorithm takes _________ as an input and returns ________ as an output.
a) Input, output
b) Problem, solution
c) Solution, problem
d) Parameters, sequence of actions
Explanation: A search algorithm takes input as a problem and returns a solution to the problem as an output.
5. A problem in a search space is defined by one of these state.
a) Initial state
b) Last state
c) Intermediate state
d) All of the mentioned
Explanation: A problem has four components initial state, goal test, set of actions, path cost.
6. The Set of actions for a problem in a state space is formulated by a ___________
a) Intermediate states
b) Initial state
c) Successor function, which takes current action and returns next immediate state
d) None of the mentioned
Explanation: The most common formulation for actions uses a successor function. Given a particular state x, SUCCESSOR-FN(x) returns a set of (action, successor) ordered pairs, where each action is one of the legal actions in state x and each successor is a state that can be reached from x by applying the action.
7. A solution to a problem is a path from the initial state to a goal
state. Solution quality is measured by the path cost function, and an
optimal solution has the highest path cost among all solutions.
a) True
b) False
Explanation: A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the lowest path cost among all solutions.
8. The process of removing detail from a given state representation is called ______
a) Extraction
b) Abstraction
c) Information Retrieval
d) Mining of data
Explanation: The process of removing detail from a representation is called abstraction.
9. A problem solving approach works well for ______________
a) 8-Puzzle problem
b) 8-queen problem
c) Finding a optimal path from a given source to a destination
d) Mars Hover (Robot Navigation)
Explanation: Problem-solving approach works well for toy problems and real-world problems.
10. The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour.
a) Finding shortest path between a source and a destination
b) Travelling Salesman problem
c) Map coloring problem
d) Depth first search traversal on a given map represented as a graph
Explanation: Refer the TSP problem.
11. Web Crawler is a/an ____________
a) Intelligent goal-based agent
b) Problem-solving agent
c) Simple reflex agent
d) Model based agent
Explanation: Web Crawling is type of search for a relevant document from given seed documents. Focused crawlers exists, helps to improvise the search efficiency.
Explanation: For best performance consideration of all component is necessary.
13. A production rule consists of ____________
a) A set of Rule
b) A sequence of steps
c) Set of Rule & sequence of steps
d) Arbitrary representation to problem
Explanation: When you are trying to solve a problem, you should design how to get a step-by-step solution with constraints condition to your problem, e.g Chess board problem.
14. Which search method takes less memory?
a) Depth-First Search
b) Breadth-First search
c) Linear Search
d) Optimal search
Explanation: Depth-First Search takes less memory since only the nodes on the current path are stored, but in Breadth First Search, all of the tree that has generated must be stored.
15. Which is the best way to go for Game playing problem?
a) Linear approach
b) Heuristic approach (Some knowledge is stored)
c) Random approach
d) An Optimal approach
Explanation: We use a Heuristic approach, as it will find out brute force computation, looking at hundreds of thousands of positions. e.g Chess competition between Human and AI based Computer.
This set of Artificial Intelligence (AI) Questions and Answers for Aptitude test focuses on “Informed Search and Exploration”.
1. A heuristic is a way of trying ___________
a) To discover something or an idea embedded in a program
b) To search and measure how far a node in a search tree seems to be from a goal
c) To compare two nodes in a search tree to see if one is better than another
d) All of the mentioned
Explanation: In a heuristic approach, we discover certain idea and use heuristic functions to search for a goal and predicates to compare nodes.
2. A* algorithm is based on ___________
a) Breadth-First-Search
b) Depth-First –Search
c) Best-First-Search
d) Hill climbing
Explanation: Best-first-search is giving the idea of optimization and quick choose of path, and all these characteristic lies in A* algorithm.
3. The search strategy the uses a problem specific knowledge is known as ___________
a) Informed Search
b) Best First Search
c) Heuristic Search
d) All of the mentioned
Explanation: The problem specific knowledge is also known as Heuristics and Best-First search uses some heuristic to choose the best node for expansion.
4. Uninformed search strategies are better than informed search strategies.
a) True
b) False
Explanation: Informed search strategies uses some problem specific knowledge, hence more efficient to finding goals.
5. Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion.
a) Evaluation function returning lowest evaluation
b) Evaluation function returning highest evaluation
c) Evaluation function returning lowest & highest evaluation
d) None of them is applicable
Explanation: Best-first search is an instance of the general TREE-SEARCH or GRAPH-SEARCH algorithm in which a node is selected for expansion based on an evaluation function, f (n). Traditionally, the node with the lowest evaluation is selected for expansion, because the evaluation measures distance to the goal.
6. Best-First search can be implemented using the following data structure.
a) Queue
b) Stack
c) Priority Queue
d) Circular Queue
Explanation: Best-first search can be implemented within our general search framework via a priority queue, a data structure that will maintain the fringe in ascending order of f-values.
7. The name “best-first search” is a venerable but inaccurate one.
After all, if we could really expand the best node first, it would not
be a search at all; it would be a straight march to the goal. All we can
do is choose the node that appears to be best according to the
evaluation function.
a) True
b) False
Explanation: If the evaluation function is exactly accurate, then this will indeed be the best node; in reality, the evaluation function will sometimes be off, and can lead the search astray.
8. Heuristic function h(n) is ________
a) Lowest path cost
b) Cheapest path from root to goal node
c) Estimated cost of cheapest path from root to goal node
d) Average path cost
Explanation: Heuristic is an estimated cost.
9. Greedy search strategy chooses the node for expansion in ___________
a) Shallowest
b) Deepest
c) The one closest to the goal node
d) Minimum heuristic cost
Explanation: Sometimes minimum heuristics can be used, sometimes maximum heuristics function can be used. It depends upon the application on which the algorithm is applied.
10. What is the evaluation function in greedy approach?
a) Heuristic function
b) Path cost from start node to current node
c) Path cost from start node to current node + Heuristic cost
d) Average of Path cost from start node to current node and Heuristic cost
Explanation: Greedy best-first search3 tries to expand the node that is closest to the goal, on the grounds that this is likely to lead to a solution quickly. Thus, it evaluates nodes by using just the heuristic function: f (n) = h(n).
Explanation: O(bm) is the space complexity where b is the branching factor and m is the maximum depth of the search tree. Since this algorithm resembles the DFS.
12. What is the evaluation function in A* approach?
a) Heuristic function
b) Path cost from start node to current node
c) Path cost from start node to current node + Heuristic cost
d) Average of Path cost from start node to current node and Heuristic cost
Explanation: The most widely-known form of best-first search is called A* search. It evaluates nodes by combining g(n), the cost to reach the node, and h(n.), the cost to get from the node to the goal: f(n) = g(n) + h(n). Since g(n) gives the path cost from the start node to node n, and h(n) is the estimated cost of the cheapest path from n to the goal.
13. A* is optimal if h(n) is an admissible heuristic-that is,
provided that h(n) never underestimates the cost to reach the goal.
a) True
b) False
Explanation: A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never overestimates the cost to reach the goal. Refer both the example from the book for better understanding of the algorithms.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Game Theory”.
1. General games involves ____________
a) Single-agent
b) Multi-agent
c) Neither Single-agent nor Multi-agent
d) Only Single-agent and Multi-agent
Explanation: Depending upon games it could be single agent (Sudoku) or multi-agent (Chess).
2. Adversarial search problems uses ____________
a) Competitive Environment
b) Cooperative Environment
c) Neither Competitive nor Cooperative Environment
d) Only Competitive and Cooperative Environment
Explanation: Since in cooperative environment agents’ goals are I conflicts. They compete for goal.
3. Mathematical game theory, a branch of economics, views any
multi-agent environment as a game provided that the impact of each agent
on the others is “significant,” regardless of whether the agents are
cooperative or competitive.
a) True
b) False
Explanation: None.
4. Zero sum games are the one in which there are two agents whose
actions must alternate and in which the utility values at the end of the
game are always the same.
a) True
b) False
Explanation: Utility values are always same and opposite.
5. Zero sum game has to be a ______ game.
a) Single player
b) Two player
c) Multiplayer
d) Three player
Explanation: Zero sum games could be multiplayer games as long as the condition for zero sum game is satisfied.
6. A game can be formally defined as a kind of search problem with the following components.
a) Initial State
b) Successor Function
c) Terminal Test
d) All of the mentioned
Explanation: The initial state includes the board position and identifies the player to move. A successor function returns a list of (move, state) pairs, each indicating a legal move and the resulting state. A terminal test determines when the game is over. States where the game has ended are called terminal states. A utility function (also called an objective function or payoff function), which gives a numeric value for the terminal states. In chess, the outcome is a win, lose, or draw, with values +1, -1, or 0.
7. The initial state and the legal moves for each side define the __________ for the game.
a) Search Tree
b) Game Tree
c) State Space Search
d) Forest
Explanation: An example of game tree for Tic-Tac-Toe game.
8. General algorithm applied on game tree for making decision of win/lose is ____________
a) DFS/BFS Search Algorithms
b) Heuristic Search Algorithms
c) Greedy Search Algorithms
d) MIN/MAX Algorithms
Explanation: Given a game tree, the optimal strategy can be determined by examining the min/max value of each node, which we write as MINIMAX- VALUE(n). The min/max value of a node is the utility (for MAX) of being in the corresponding state, assuming that both players play optimally from there to the end of the game. Obviously, the min/max value of a terminal state is just its utility. Furthermore, given a choice, MAX will prefer to move to a state of maximum value, whereas MIN prefers a state of minimum value.
9. The minimax algorithm computes the minimax decision from the
current state. It uses a simple recursive computation of the minimax
values of each successor state, directly implementing the defining
equations. The recursion proceeds all the way down to the leaves of the
tree, and then the minimax values are backed up through the tree as the
recursion unwinds.
a) True
b) False
Explanation: Refer definition of minimax algorithm.
10. What is the complexity of minimax algorithm?
a) Same as of DFS
b) Space – bm and time – bm
c) Time – bm and space – bm
d) Same as BFS
Explanation: Same as DFS.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Alpha Beta Pruning”.
1. Which search is equal to minimax search but eliminates the branches that can’t influence the final decision?
a) Depth-first search
b) Breadth-first search
c) Alpha-beta pruning
d) None of the mentioned
Explanation: The alpha-beta search computes the same optimal moves as minimax, but eliminates the branches that can’t influence the final decision.
2. Which values are independant in minimax search algorithm?
a) Pruned leaves x and y
b) Every states are dependant
c) Root is independant
d) None of the mentioned
Explanation: The minimax decision are independant of the values of the pruned values x and y because of the root values.
3. To which depth does the alpha-beta pruning can be applied?
a) 10 states
b) 8 States
c) 6 States
d) Any depth
Explanation: Alpha–beta pruning can be applied to trees of any depth and it is possible to prune entire subtree rather than leaves.
4. Which search is similar to minimax search?
a) Hill-climbing search
b) Depth-first search
c) Breadth-first search
d) All of the mentioned
Explanation: The minimax search is depth-first search, So at one time we just have to consider the nodes along a single path in the tree.
5. Which value is assigned to alpha and beta in the alpha-beta pruning?
a) Alpha = max
b) Beta = min
c) Beta = max
d) Both Alpha = max & Beta = min
Explanation: Alpha and beta are the values of the best choice we have found so far at any choice point along the path for MAX and MIN.
6. Where does the values of alpha-beta search get updated?
a) Along the path of search
b) Initial state itself
c) At the end
d) None of the mentioned
Explanation: Alpha-beta search updates the value of alpha and beta as it gets along and prunes the remaining branches at node.
7. How the effectiveness of the alpha-beta pruning gets increased?
a) Depends on the nodes
b) Depends on the order in which they are executed
c) All of the mentioned
d) None of the mentioned
Explanation: None.
8. What is called as transposition table?
a) Hash table of next seen positions
b) Hash table of previously seen positions
c) Next value in the search
d) None of the mentioned
Explanation: Transposition is the occurrence of repeated states frequently in the search.
9. Which is identical to the closed list in Graph search?
a) Hill climbing search algorithm
b) Depth-first search
c) Transposition table
d) None of the mentioned
Explanation: None.
10. Which function is used to calculate the feasibility of whole game tree?
a) Evaluation function
b) Transposition
c) Alpha-beta pruning
d) All of the mentioned
Explanation: Because we need to cut the search off at some point and apply an evaluation function that gives an estimate of the utility of the state.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “First-Order Logic”.
1. There exist only two types of quantifiers, Universal Quantification and Existential Quantification.
a) True
b) False
Explanation: None.
2. Translate the following statement into FOL.
“For every a, if a is a philosopher, then a is a scholar”
a) ∀ a philosopher(a) scholar(a)
b) ∃ a philosopher(a) scholar(a)
c) All of the mentioned
d) None of the mentioned
Explanation: None.
3. A _________ is used to demonstrate, on a purely syntactic basis,
that one formula is a logical consequence of another formula.
a) Deductive Systems
b) Inductive Systems
c) Reasoning with Knowledge Based Systems
d) Search Based Systems
Explanation: Refer the definition of Deductive based systems.
4. The statement comprising the limitations of FOL is/are ____________
a) Expressiveness
b) Formalizing Natural Languages
c) Many-sorted Logic
d) All of the mentioned
Explanation: The Löwenheim–Skolem theorem shows that if a first-order theory has any infinite model, then it has infinite models of every cardinality. In particular, no first-order theory with an infinite model can be categorical. Thus there is no first-order theory whose only model has the set of natural numbers as its domain, or whose only model has the set of real numbers as its domain. Many extensions of first-order logic, including infinitely logics and higher-order logics, are more expressive in the sense that they do permit categorical axiomatizations of the natural numbers or real numbers. This expressiveness comes at a meta-logical cost, however: by Lindström’s theorem, the compactness theorem and the downward Löwenheim–Skolem theorem cannot hold in any logic stronger than first-order.
Formalizing Natural Languages : First-order logic is able to formalize many simple quantifier constructions in natural language, such as “every person who lives in Perth lives in Australia”. But there are many more complicated features of natural language that cannot be expressed in (single-sorted) first-order logic.
Many-sorted Logic: Ordinary first-order interpretations have a single domain of discourse over which all quantifiers range. Many-sorted first-order logic allows variables to have different sorts, which have different domains.
5. A common convention is:
• is evaluated first
• and are evaluated next
• Quantifiers are evaluated next
• is evaluated last.
a) True
b) False
Explanation: None.
6. A Term is either an individual constant (a 0-ary function), or a
variable, or an n-ary function applied to n terms: F(t1 t2 ..tn).
a) True
b) False
Explanation: Definition of term in FOL.
7. First Order Logic is also known as ___________
a) First Order Predicate Calculus
b) Quantification Theory
c) Lower Order Calculus
d) All of the mentioned
Explanation: None.
8. The adjective “first-order” distinguishes first-order logic from
___________ in which there are predicates having predicates or functions
as arguments, or in which one or both of predicate quantifiers or
function quantifiers are permitted.
a) Representational Verification
b) Representational Adequacy
c) Higher Order Logic
d) Inferential Efficiency
Explanation: None.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Forward Chaining”.
1. Which condition is used to cease the growth of forward chaining?
a) Atomic sentences
b) Complex sentences
c) No further inference
d) All of the mentioned
Explanation: Forward chain can grow by adding new atomic sentences until no further inference is made.
2. Which closely resembles propositional definite clause?
a) Resolution
b) Inference
c) Conjunction
d) First-order definite clauses
Explanation: Because they are disjunction of literals of which exactly one is positive.
3. What is the condition of variables in first-order literals?
a) Existentially quantified
b) Universally quantified
c) Both Existentially & Universally quantified
d) None of the mentioned
Explanation: First-order literals will accept variables only if they are universally quantified.
4. Which are more suitable normal form to be used with definite clause?
a) Positive literal
b) Negative literal
c) Generalized modus ponens
d) Neutral literal
Explanation: Definite clauses are a suitable normal form for use with generalized modus ponen.
5. Which will be the instance of the class datalog knowledge bases?
a) Variables
b) No function symbols
c) First-order definite clauses
d) None of the mentioned
Explanation: If the knowledge base contains no function symbols means, it is an instance of the class datalog knowledge base.
6. Which knowledge base is called as fixed point?
a) First-order definite clause are similar to propositional forward chaining
b) First-order definite clause are mismatch to propositional forward chaining
c) All of the mentioned
d) None of the mentioned
Explanation: Fixed point reached by forward chaining with first-order definiteclause are similar to those for propositional forward chaining.
7. How to eliminate the redundant rule matching attempts in the forward chaining?
a) Decremental forward chaining
b) Incremental forward chaining
c) Data complexity
d) None of the mentioned
Explanation: We can eliminate the redundant rule matching attempts in the forward chaining by using incremental forward chaining.
8. From where did the new fact inferred on new iteration is derived?
a) Old fact
b) Narrow fact
c) New fact
d) All of the mentioned
Explanation: None.
9. Which will solve the conjuncts of the rule so that the total cost is minimized?
a) Constraint variable
b) Conjunct ordering
c) Data complexity
d) All of the mentioned
Explanation: Conjunct ordering will find an ordering to solve the conjuncts of the rule premise so that the total cost is minimized.
10. How many possible sources of complexity are there in forward chaining?
a) 1
b) 2
c) 3
d) 4
Explanation: The three possible sources of complexity are an inner loop, algorithm rechecks every rule on every iteration, algorithm might generate many facts irrelevant to the goal.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Knowledge and Reasoning”.
1. Knowledge and reasoning also play a crucial role in dealing with __________________ environment.
a) Completely Observable
b) Partially Observable
c) Neither Completely nor Partially Observable
d) Only Completely and Partially Observable
Explanation: Knowledge and reasoning could aid to reveal other factors that could complete environment.
2. Treatment chosen by doctor for a patient for a disease is based on _____________
a) Only current symptoms
b) Current symptoms plus some knowledge from the textbooks
c) Current symptoms plus some knowledge from the textbooks plus experience
d) All of the mentioned
Explanation: None.
3. A knowledge-based agent can combine general knowledge with current
percepts to infer hidden aspects of the current state prior to
selecting actions.
a) True
b) False
Explanation: Refer definition of Knowledge based agents.
4. A) Knowledge base (KB) is consists of set of statements.
B) Inference is deriving a new sentence from the KB.
Choose the correct option.
a) A is true, B is true
b) A is false, B is false
c) A is true, B is false
d) A is false, B is true
Explanation: None.
5. Wumpus World is a classic problem, best example of _______
a) Single player Game
b) Two player Game
c) Reasoning with Knowledge
d) Knowledge based Game
Explanation: Refer the definition of Wumpus World Problem.
6. ‘α |= β ‘(to mean that the sentence α entails the sentence β) if
and only if, in every model in which α is _____ β is also _____
a) True, true
b) True, false
c) False, true
d) False, false
Explanation: Refer the definition of law of entailment.
7. Which is not a property of representation of knowledge?
a) Representational Verification
b) Representational Adequacy
c) Inferential Adequacy
d) Inferential Efficiency
Explanation: None.
8. Which is not Familiar Connectives in First Order Logic?
a) and
b) iff
c) or
d) not
Explanation: “not” is coming under propositional logic and is therefore not a connective.
9. Inference algorithm is complete only if _____________
a) It can derive any sentence
b) It can derive any sentence that is an entailed version
c) It is truth preserving
d) It can derive any sentence that is an entailed version & It is truth preserving
Explanation: None.
10. An inference algorithm that derives only entailed sentences is called sound or truth-preserving.
a) True
b) False
Explanation: None.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Semantic Net – 1”.
1. What among the following constitutes the representation of the knowledge in different forms?
a) Relational method where each fact is set out systematically in columns
b) Inheritable knowledge where relational knowledge is made up of objects
c) Inferential knowledge
d) All of the mentioned
Explanation: None.
2. What are Semantic Networks?
a) A way of representing knowledge
b) Data Structure
c) Data Type
d) None of the mentioned
Explanation: None.
3. Graph used to represent semantic network is _____________
a) Undirected graph
b) Directed graph
c) Directed Acyclic graph (DAG)
d) Directed complete graph
Explanation: Semantic Network is a directed graph consisting of vertices, which represent concepts and edges, which represent semantic relations between the concepts.
4. Which of the following are the Semantic Relations used in Semantic Networks?
a) Meronymy
b) Holonymy
c) Hyponymy
d) All of the mentioned
Explanation: None.
5. What is Meronymy relation?
a) A is part of B
b) B has A as a part of itself
c) A is a kind of B
d) A is superordinate of B
Explanation: A meronym denotes a constituent part of or a member of something. That is,
“X” is a meronym of “Y” if Xs are parts of Y(s), or
“X” is a meronym of “Y” if Xs are members of Y(s).
6. What is Hypernym relation?
a) A is part of B
b) B has A as a part of itself
c) A is a kind of B
d) A is superordinate of B
Explanation: In linguistics, a hyponym is a word or phrase whose semantic field is included within that of another word, its hypernym (sometimes spelled hypernym outside of the natural language processing community). In simpler terms, a hyponym shares a type-of relationship with its hypernym.
7. What is Holonymy relation?
a) A is part of B
b) B has A as a part of itself
c) A is a kind of B
d) A is superordinate of B
Explanation: Holonymy (in Greek holon = whole and onoma = name) is a semantic relation. Holonymy defines the relationship between a term denoting the whole and a term denoting a part of, or a member of, the whole. That is,
‘X’ is a holonym of ‘Y’ if Ys are parts of Xs, or
‘X’ is a holonym of ‘Y’ if Ys are members of Xs.
8. The basic inference mechanism in semantic network is to follow the links between the nodes.
a) True
b) False
Explanation: None.
9. There exists two way to infer using semantic networks.
1) Intersection Search
2) Inheritance Search
a) True
b) False
Explanation: None.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Partial Order Planning”.
1. The process by which the brain incrementally orders actions needed to complete a specific task is referred as ______________
a) Planning problem
b) Partial order planning
c) Total order planning
d) Both Planning problem & Partial order planning
Explanation: Definition of partial order planning.
2. To complete any task, the brain needs to plan out the sequence by
which to execute the behavior. One way the brain does this is with a
partial-order plan.
a) True
b) False
Explanation: None.
3. In partial order plan.
A. Relationships between the actions of the behavior are set prior to the actions
B. Relationships between the actions of the behavior are not set until absolutely necessary
Choose the correct option.
a) A is true
b) B is true
c) Either A or B can be true depending upon situation
d) Neither A nor B is true
Explanation: Relationship between behavior and actions is established dynamically.
4. Partial-order planning exhibits the Principle of Least Commitment,
which contributes to the efficiency of this planning system as a whole.
a) True
b) False
Explanation: None.
5. Following is/are the components of the partial order planning.
a) Bindings
b) Goal
c) Causal Links
d) All of the mentioned
Explanation: Bindings: The bindings of the algorithm are the connections between specific variables in the action. Bindings, as ordering, only occur when it is absolutely necessary.
Causal Links: Causal links in the algorithm are those that categorically order actions. They are not the specific order (1,2,3) of the actions, rather the general order as in Action 2 must come somewhere after Action 1, but before Action 2.
Plan Space: The plan space of the algorithm is constrained between its start and finish. The algorithm starts, producing the initial state and finishes when all parts of the goal is been achieved.
6. Partial-order planning is the opposite of total-order planning.
a) True
b) False
Explanation: Partial-order planning is the opposite of total-order planning, in which actions are sequenced all at once and for the entirety of the task at hand.
7. Sussman Anomaly can be easily and efficiently solved by partial order planning.
a) True
b) False
Explanation: http://en.wikipedia.org/wiki/Sussman_Anomaly.
8. Sussman Anomaly illustrates a weakness of interleaved planning algorithm.
a) True
b) False
Explanation: Sussman Anomaly illustrates a weakness of non interleaved planning algorithm.
9. One the main drawback of this type of planning system is that it requires a lot of computational powers at each node.
a) True
b) False
Explanation: None.
10. What are you predicating by the logic: ۷x: €y: loyalto(x, y).
a) Everyone is loyal to someone
b) Everyone is loyal to all
c) Everyone is not loyal to someone
d) Everyone is loyal
Explanation: ۷x denotes Everyone or all, and €y someone and loyal to is the proposition logic making map x to y.
11. A plan that describe how to take actions in levels of increasing refinement and specificity is ____________
a) Problem solving
b) Planning
c) Non-hierarchical plan
d) Hierarchical plan
Explanation: A plan that describes how to take actions in levels of increasing refinement and specificity is Hierarchical (e.g., “Do something” becomes the more specific “Go to work,” “Do work,” “Go home.”) Most plans are hierarchical in nature.
12. A constructive approach in which no commitment is made unless it is necessary to do so, is ____________
a) Least commitment approach
b) Most commitment approach
c) Nonlinear planning
d) Opportunistic planning
Explanation: Because we are not sure about the outcome.
13. Uncertainty arises in the Wumpus world because the agent’s sensors give only ____________
a) Full & Global information
b) Partial & Global Information
c) Partial & local Information
d) Full & local information
Explanation: The Wumpus world is a grid of squares surrounded by walls, where each square can contain agents and objects. The agent (you) always starts in the lower left corner, a square that will be labeled [1, 1]. The agent’s task is to find the gold, return to [1, 1] and climb out of the cave. Therefore, uncertainty is there as the agent gives partial and local information only. Global variable are not goal specific problem solving.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Graph Planning”.
1. Which data structure is used to give better heuristic estimates?
a) Forwards state-space
b) Backward state-space
c) Planning graph algorithm
d) None of the mentioned
Explanation: A special data structure called planning graph is used to give better heuristic estimates.
2. Which is used to extract solution directly from the planning graph?
a) Planning algorithm
b) Graphplan
c) Hill-climbing search
d) All of the mentioned
Explanation: We can extract the solution directly from the planning graph, using a specialized algorithm called Graphplan.
3. What are present in the planning graph?
a) Sequence of levels
b) Literals
c) Variables
d) Heuristic estimates
Explanation: A planning graph consists of sequence of levels correspond to time steps.
4. What is the starting level of planning graph?
a) Level 3
b) Level 2
c) Level 1
d) Level 0
Explanation: None.
5. What are present in each level of planning graph?
a) Literals
b) Actions
c) Variables
d) Both Literals & Actions
Explanation: Each and every level in the planning graph contains a set of literals and a set of actions.
6. Which kind of problem are suitable for planning graph?
a) Propositional planning problem
b) Planning problem
c) Action problem
d) None of the mentioned
Explanation: Planning graph work only for propositional planning problem with no variables.
7. What is meant by persistence actions?
a) Allow a literal to remain false
b) Allow a literal to remain true
c) Allow a literal to remain false & true
d) None of the mentioned
Explanation: Calculus allows a literal to remain true from one situation to the next if no action alters it. It is called as persistence action.
8. When will further expansion is unnecessary for planning graph?
a) Identical
b) Replicate
c) Not identical
d) None of the mentioned
Explanation: Every subsequent levels will be identical, So further expansion is unnecessary.
9. How many conditions are available between two actions in mutex relation?
a) 1
b) 2
c) 3
d) 4
Explanation: The three conditions available on mute relationship are inconsistent effects, interference and competing needs.
10. What is called inconsistent support?
a) If two literals are not negation of other
b) If two literals are negation of other
c) Mutually exclusive
d) None of the mentioned
Explanation: If two literals are at the same level if one is the negation of another is called inconsistent support.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Uncertain Knowledge and Reasoning”.
1. Using logic to represent and reason we can represent knowledge about the world with facts and rules.
a) True
b) False
Explanation: None.
2. Uncertainty arises in the wumpus world because the agent’s sensors give only ___________
a) Full & Global information
b) Partial & Global Information
c) Partial & local Information
d) Full & local information
Explanation: The Wumpus world is a grid of squares surrounded by walls, where each square can contain agents and objects. The agent (you) always starts in the lower left corner, a square that will be labeled [1, 1]. The agent’s task is to find the gold, return to [1, 1] and climb out of the cave. So uncertainty is there as the agent gives partial and local information only. Global variable are not goal specific problem solving.
3. A Hybrid Bayesian network contains ___________
a) Both discrete and continuous variables
b) Only Discrete variables
c) Only Discontinuous variable
d) Both Discrete and Discontinuous variable
Explanation: To specify a Hybrid network, we have to specify two new kinds of distributions: the conditional distribution for continuous variables given discrete or continuous parents, and the conditional distribution for a discrete variable given continuous parents.
4. How is Fuzzy Logic different from conventional control methods?
a) IF and THEN Approach
b) FOR Approach
c) WHILE Approach
d) DO Approach
Explanation: FL incorporates a simple, rule-based IF X AND Y THEN Z approach to a solving control problem rather than attempting to model a system mathematically.
5. If a hypothesis says it should be positive, but in fact it is negative, we call it ___________
a) A consistent hypothesis
b) A false negative hypothesis
c) A false positive hypothesis
d) A specialized hypothesis
Explanation: Consistent hypothesis go with examples, If the hypothesis says it should be negative but in fact it is positive, it is false negative. If a hypothesis says it should be positive, but in fact it is negative, it is false positive. In a specialized hypothesis we need to have certain restrict or special conditions.
6. The primitives in probabilistic reasoning are random variables.
a) True
b) False
Explanation: The primitives in probabilistic reasoning are random variables. Just like primitives in Propositional Logic are propositions. A random variable is not in fact a variable, but a function from a sample space S to another space, often the real numbers.
7. Which is true for Decision theory?
a) Decision Theory = Probability theory + utility theory
b) Decision Theory = Inference theory + utility theory
c) Decision Theory = Uncertainty + utility theory
d) Decision Theory = Probability theory + preference
Explanation: The Wumpus world is a grid of squares surrounded by walls, where each square can contain agents and objects. The agent (you) always starts in the lower left corner, a square that will be labeled [1, 1]. The agent’s task is to find the gold, return to [1, 1] and climb out of the cave. So uncertainty is there as the agent gives partial and local information only. Global variable are not goal specific problem solving.
8. A constructive approach in which no commitment is made unless it is necessary to do so is ___________
a) Least commitment approach
b) Most commitment approach
c) Nonlinear planning
d) Opportunistic planning
Explanation: Because we are not sure about the outcome.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Bayesian Networks”.
1. How many terms are required for building a bayes model?
a) 1
b) 2
c) 3
d) 4
Explanation: The three required terms are a conditional probability and two unconditional probability.
2. What is needed to make probabilistic systems feasible in the world?
a) Reliability
b) Crucial robustness
c) Feasibility
d) None of the mentioned
Explanation: On a model-based knowledge provides the crucial robustness needed to make probabilistic system feasible in the real world.
3. Where does the bayes rule can be used?
a) Solving queries
b) Increasing complexity
c) Decreasing complexity
d) Answering probabilistic query
Explanation: Bayes rule can be used to answer the probabilistic queries conditioned on one piece of evidence.
4. What does the bayesian network provides?
a) Complete description of the domain
b) Partial description of the domain
c) Complete description of the problem
d) None of the mentioned
Explanation: A Bayesian network provides a complete description of the domain.
5. How the entries in the full joint probability distribution can be calculated?
a) Using variables
b) Using information
c) Both Using variables & information
d) None of the mentioned
Explanation: Every entry in the full joint probability distribution can be calculated from the information in the network.
6. How the bayesian network can be used to answer any query?
a) Full distribution
b) Joint distribution
c) Partial distribution
d) All of the mentioned
Explanation: If a bayesian network is a representation of the joint distribution, then it can solve any query, by summing all the relevant joint entries.
7. How the compactness of the bayesian network can be described?
a) Locally structured
b) Fully structured
c) Partial structure
d) All of the mentioned
Explanation: The compactness of the bayesian network is an example of a very general property of a locally structured system.
8. To which does the local structure is associated?
a) Hybrid
b) Dependant
c) Linear
d) None of the mentioned
Explanation: Local structure is usually associated with linear rather than exponential growth in complexity.
9. Which condition is used to influence a variable directly by all the others?
a) Partially connected
b) Fully connected
c) Local connected
d) None of the mentioned
Explanation: None.
10. What is the consequence between a node and its predecessors while creating bayesian network?
a) Functionally dependent
b) Dependant
c) Conditionally independent
d) Both Conditionally dependant & Dependant
Explanation: The semantics to derive a method for constructing bayesian networks were led to the consequence that a node can be conditionally independent of its predecessors.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Learning – 1”.
1. What will take place as the agent observes its interactions with the world?
a) Learning
b) Hearing
c) Perceiving
d) Speech
Explanation: Learning will take place as the agent observes its interactions with the world and its own decision making process.
2. Which modifies the performance element so that it makes better decision?
a) Performance element
b) Changing element
c) Learning element
d) None of the mentioned
Explanation: A learning element modifies the performance element so that it can make better decision.
3. How many things are concerned in the design of a learning element?
a) 1
b) 2
c) 3
d) 4
Explanation: The three main issues are affected in design of a learning element are components, feedback and representation.
4. What is used in determining the nature of the learning problem?
a) Environment
b) Feedback
c) Problem
d) All of the mentioned
Explanation: The type of feedback is used in determining the nature of the learning problem that the agent faces.
5. How many types are available in machine learning?
a) 1
b) 2
c) 3
d) 4
Explanation: The three types of machine learning are supervised, unsupervised and reinforcement.
6. Which is used for utility functions in game playing algorithm?
a) Linear polynomial
b) Weighted polynomial
c) Polynomial
d) Linear weighted polynomial
Explanation: Linear weighted polynomial is used for learning element in the game playing programs.
7. Which is used to choose among multiple consistent hypotheses?
a) Razor
b) Ockham razor
c) Learning element
d) None of the mentioned
Explanation: Ockham razor prefers the simplest hypothesis consistent with the data intuitively.
8. What will happen if the hypothesis space contains the true function?
a) Realizable
b) Unrealizable
c) Both Realizable & Unrealizable
d) None of the mentioned
Explanation: A learning problem is realizable if the hypothesis space contains the true function.
9. What takes input as an object described by a set of attributes?
a) Tree
b) Graph
c) Decision graph
d) Decision tree
Explanation: Decision tree takes input as an object described by a set of attributes and returns a decision.
10. How the decision tree reaches its decision?
a) Single test
b) Two test
c) Sequence of test
d) No test
Explanation: A decision tree reaches its decision by performing a sequence of tests.
This set of AI Multiple Choice Questions & Answers focuses on “Neural Networks – 2”.
1. Why is the XOR problem exceptionally interesting to neural network researchers?
a) Because it can be expressed in a way that allows you to use a neural network
b) Because it is complex binary operation that cannot be solved using neural networks
c) Because it can be solved by a single layer perceptron
d) Because it is the simplest linearly inseparable problem that exists.
Explanation: None.
2. What is back propagation?
a) It is another name given to the curvy function in the perceptron
b) It is the transmission of error back through the network to adjust the inputs
c) It is the transmission of error back through the network to allow weights to be adjusted so that the network can learn
d) None of the mentioned
Explanation: Back propagation is the transmission of error back through the network to allow weights to be adjusted so that the network can learn.
3. Why are linearly separable problems of interest of neural network researchers?
a) Because they are the only class of problem that network can solve successfully
b) Because they are the only class of problem that Perceptron can solve successfully
c) Because they are the only mathematical functions that are continue
d) Because they are the only mathematical functions you can draw
Explanation: Linearly separable problems of interest of neural network researchers because they are the only class of problem that Perceptron can solve successfully.
4. Which of the following is not the promise of artificial neural network?
a) It can explain result
b) It can survive the failure of some nodes
c) It has inherent parallelism
d) It can handle noise
Explanation: The artificial Neural Network (ANN) cannot explain result.
5. Neural Networks are complex ______________ with many parameters.
a) Linear Functions
b) Nonlinear Functions
c) Discrete Functions
d) Exponential Functions
Explanation: Neural networks are complex linear functions with many parameters.
6. A perceptron adds up all the weighted inputs it receives, and if
it exceeds a certain value, it outputs a 1, otherwise it just outputs a
0.
a) True
b) False
c) Sometimes – it can also output intermediate values as well
d) Can’t say
Explanation: Yes the perceptron works like that.
7. What is the name of the function in the following statement “A
perceptron adds up all the weighted inputs it receives, and if it
exceeds a certain value, it outputs a 1, otherwise it just outputs a 0”?
a) Step function
b) Heaviside function
c) Logistic function
d) Perceptron function
Explanation: Also known as the step function – so answer 1 is also right. It is a hard thresholding function, either on or off with no in-between.
8. Having multiple perceptrons can actually solve the XOR problem
satisfactorily: this is because each perceptron can partition off a
linear part of the space itself, and they can then combine their
results.
a) True – this works always, and these multiple perceptrons learn to classify even complex problems
b) False – perceptrons are mathematically incapable of solving linearly inseparable functions, no matter what you do
c) True – perceptrons can do this but are unable to learn to do it – they have to be explicitly hand-coded
d) False – just having a single perceptron is enough
Explanation: None.
9. The network that involves backward links from output to the input and hidden layers is called _________
a) Self organizing maps
b) Perceptrons
c) Recurrent neural network
d) Multi layered perceptron
Explanation: RNN (Recurrent neural network) topology involves backward links from output to the input and hidden layers.
10. Which of the following is an application of NN (Neural Network)?
a) Sales forecasting
b) Data validation
c) Risk management
d) All of the mentioned
Explanation: All mentioned options are applications of Neural Network.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Communication”.
1. What is the intentional exchange of information brought about by production and perception?
a) Hearing
b) Communication
c) Speech
d) None of the mentioned
Explanation: Communication is the intentional exchange of information brought about by the production and perception of signs drawn from a shared system.
2. What is the complex system of structured message?
a) Languages
b) Words
c) Signs
d) Speech
Explanation: Language is the complex system of structured message that enables us to communicate.
3. How many things are present in conventional communication signs?
a) 3
b) 4
c) 5
d) 6
Explanation: The five things present in the conventional communication system are query, inform, request, acknowledge and promise.
4. What is defined by a set of strings?
a) Signs
b) Formal language
c) Communication
d) None of the mentioned
Explanation: A formal language is defined by a set of strings that is a concatenation of terminal symbols.
5. What is a finite set of rules that specifies a language?
a) Signs
b) Communication
c) Grammar
d) Phrase
Explanation: None.
6. What kind of perception is used in printing?
a) Optical character recognition
b) Speech recognition
c) Perception
d) None of the mentioned
Explanation: When perception is used in printing means, It is called as optical character recognition.
7. Why the parsing is used?
a) Interpretation
b) Building a parse tree
c) Recognition
d) All of the mentioned
Explanation: Parsing is the process of building a parse tree for an input string.
8. How many objects are available in closed classes?
a) 1
b) 2
c) 3
d) 4
Explanation: The four objects are available in closed classes are pronoun, article, preposition and conjunction.
9. How many states are present in parsing?
a) 1
b) 2
c) 3
d) 4
Explanation: The three state available in parsing are initial state, successor function and goal test.
10. Pick out the correct option about the types of parsing.
a) Top-down and bottom-up parsing
b) Interpretation and communication
c) Roll-up and roll-down
d) None of the mentioned
Explanation: The two types of parsing are top-down parsing and bottom-up parsing.
11. Semantic grammars are _____________
a) Encode semantic information into a syntactic grammar
b) Decode semantic information into a syntactic grammar
c) Encode syntactic information into a semantic grammar
d) Decode syntactic information into a semantic grammar
Explanation: Semantic grammars encode semantic information into a syntactic grammar.
Explanation: A top-down parser begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual pre-terminal symbols are written.
13. Perception involves __________
a) Sights, sounds, smell and touch
b) Hitting
c) Boxing
d) Dancing
Explanation: Perception involves Sights, sounds, smell and touch.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Robotics – 1”.
1. What is the name for information sent from robot sensors to robot controllers?
a) temperature
b) pressure
c) feedback
d) signal
Explanation: None.
2. Which of the following terms refers to the rotational motion of a robot arm?
a) swivel
b) axle
c) retrograde
d) roll
Explanation: None.
3. What is the name for space inside which a robot unit operates?
a) environment
b) spatial base
c) work envelope
d) exclusion zone
Explanation: None.
4. Which of the following terms IS NOT one of the five basic parts of a robot?
a) peripheral tools
b) end effectors
c) controller
d) drive
Explanation: None.
5. Decision support programs are designed to help managers make __________
a) budget projections
b) visual presentations
c) business decisions
d) vacation schedules
Explanation: None.
6. PROLOG is an AI programming language which solves problems with a
form of symbolic logic known as predicate calculus. It was developed in
1972 at the University of Marseilles by a team of specialists. Can you
name the person who headed this team?
a) Alain Colmerauer
b) Niklaus Wirth
c) Seymour Papert
d) John McCarthy
Explanation: None.
7. The number of moveable joints in the base, the arm, and the end effectors of the robot determines_________
a) degrees of freedom
b) payload capacity
c) operational limits
d) flexibility
Explanation: None.
8. Which of the following places would be LEAST likely to include operational robots?
a) warehouse
b) factory
c) hospitals
d) private homes
Explanation: None.
9. For a robot unit to be considered a functional industrial robot, typically, how many degrees of freedom would the robot have?
a) three
b) four
c) six
d) eight
Explanation: None.
10. Which of the basic parts of a robot unit would include the
computer circuitry that could be programmed to determine what the robot
would do?
a) sensor
b) controller
c) arm
d) end effector
Explanation: None.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “LISP Programming – 1”.
1. DEC advertises that it helped to create “the world’s first expert
system routinely used in an industrial environment,” called XCON or
__________
a) PDP-11
b) Rl
c) VAX
d) MAGNOM
Explanation: None.
2. Prior to the invention of time-sharing, the prevalent method of computer access was ____________
a) batch processing
b) telecommunication
c) remote access
d) all of the mentioned
Explanation: None.
3. Seymour Papert of the MIT AI lab created a programming environment for children called ___________
a) BASIC
b) LOGO
c) MYCIN
d) FORTRAN
Explanation: None.
4. Which of the following is a project of the Strategic Computing Program?
a) Defense Advanced Research Projects Agency
b) National Science Foundation
c) Jet Propulsion Laboratory
d) All of the mentioned
Explanation: None.
5. The original LISP machines produced by both LMI and Symbolics were based on research performed at?
a) CMU
b) MIT
c) Stanford University
d) RAMD
Explanation: None.
6. In LISP, the addition 3 + 2 is entered as _______________
a) 3 + 2
b) 3 add 2
c) 3 + 2 =
d) (+ 3 2)
Explanation: None.
7. What is Weak AI?
a) the embodiment of human intellectual capabilities within a computer
b) a set of computer programs that produce output that would be
considered to reflect intelligence if it were generated by humans
c) the study of mental faculties using mental models implemented on a computer
d) all of the mentioned
Explanation: None.
8. In LISP, the function returns t if is a CONS cell and nil otherwise ________
a) (cons )
b) (consp )
c) (eq )
d) (cous =)
Explanation: None.
9. In a rule-based system, what is the form of procedural domain knowledge?
a) production rules
b) rule interpreters
c) meta-rules
d) control rules
Explanation: None.
10. If a robot can alter its own trajectory in response to external conditions, it is considered to be ____________
a) intelligent
b) mobile
c) open loop
d) non-servo
Explanation: None.
11. In LISP, what is the function assigns the symbol x to y?
a) (setq y x)
b) (set y = ‘x’)
c) (setq y = ‘x’)
d) (setq y ‘x’)
Explanation: None.
Explanation: None.
This set of AI Interview Questions and Answers for Experienced people focuses on “LISP Programming – 3”.
1. LISP machines also are known as ___________
a) AI workstations
b) Time-sharing terminals
c) Super mini computers
d) All of the mentioned
Explanation: None.
2. What are the two subfields of Natural language processing?
a) context and expectations
b) generation and understanding
c) semantics of pragmatics
d) recognition and synthesis
Explanation: None.
3. How many ALU(s) is/are control by one control unit is SIMD (single instruction stream, multiple data stream) architecture?
a) one or more ALUs
b) One ALU
c) Only two ALU
d) Impossible to say
Explanation: None.
4. Which of the following function returns t if the object is a number in LISP?
a) (number <object>)
b) (numberp <object>)
c) (numericp <object>)
d) (numeric <object>)
Explanation: None.
5. Which of the following have computers traditionally done better than people?
a) storing information
b) responding flexibly
c) computing numerically
d) both storing information & computing numerically
Explanation: None.
6. The characteristics of the computer system capable of thinking, reasoning and learning are known as ____________
a) machine intelligence
b) human intelligence
c) artificial intelligence
d) virtual intelligence
Explanation: None.
7. What part of the manufacturing process relate to each stage of the process and to the process as a whole?
a) field service
b) design
c) distribution
d) project management
Explanation: None.
8. The area of AI that investigates methods of facilitating communication between people and computers is ___________
a) natural language processing
b) symbolic processing
c) decision support
d) robotics
Explanation: None.
9. In the 16th century, a Czech rabbi reportedly created a living
clay man whose name has become a synonym for an artificial human. What
was the clay man’s name?
a) Frankenstein
b) Golem
c) Paracelsus
d) Hal
Explanation: None.
10. For speech understanding systems to gain widespread acceptance in office automation, they must feature ____________
a) speaker independence
b) speaker dependence
c) isolated word recognition
d) all of the mentioned
Explanation: None.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Artificial Intelligence Algorithms”.
1. What is a Cybernetics?
a) Study of communication between two machines
b) Study of communication between human and machine
c) Study of communication between two humans
d) Study of Boolean values
Explanation: Cybernetics is Study of communication between human and machine.
2. What is the goal of artificial intelligence?
a) To solve real-world problems
b) To solve artificial problems
c) To explain various sorts of intelligence
d) To extract scientific causes
Explanation: The scientific goal of artificial intelligence is to explain various sorts of intelligence.
3. An algorithm is complete if ____________
a) It terminates with a solution when one exists
b) It starts with a solution
c) It does not terminate with a solution
d) It has a loop
Explanation: An Algorithm is complete if It terminates with a solution when one exists.
4. Which is true regarding BFS (Breadth First Search)?
a) BFS will get trapped exploring a single path
b) The entire tree so far been generated must be stored in BFS
c) BFS is not guaranteed to find a solution if exists
d) BFS is nothing but Binary First Search
Explanation: Regarding BFS-The entire tree so far been generated must be stored in BFS.
5. What is a heuristic function?
a) A function to solve mathematical problems
b) A function which takes parameters of type string and returns an integer value
c) A function whose return type is nothing
d) A function that maps from problem state descriptions to measures of desirability
Explanation: Heuristic function is a function that maps from problem state descriptions to measures of desirability.
6. The traveling salesman problem involves n cities with paths
connecting the cities. The time taken for traversing through all the
cities, without knowing in advance the length of a minimum tour, is
___________
a) O(n)
b) O(n2)
c) O(n!)
d) O(n/2)
Explanation: The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is O(n!).
7. What is the problem space of means-end analysis?
a) An initial state and one or more goal states
b) One or more initial states and one goal state
c) One or more initial states and one or more goal state
d) One initial state and one goal state
Explanation: The problem space of means-end analysis has an initial state and one or more goal states.
8. An algorithm A is admissible if ___________
a) It is not guaranteed to return an optimal solution when one exists
b) It is guaranteed to return an optimal solution when one exists
c) It returns more solutions, but not an optimal one
d) It guarantees to return more optimal solutions
Explanation: An algorithm A is admissible if It is guaranteed to return an optimal solution when one exists.
9. Knowledge may be
I. Declarative.
II. Procedural.
III. Non-procedural.
a) Only (I)
b) Only (II)
c) Only (III)
d) Both (I) and (II)
Explanation: Knowledge may be declarative and procedural.
10. Idempotency law is
I. P Ú P = P.
II. P Ù P = P.
III. P + P = P.
a) Only (I)
b) Only (II)
c) Only (III)
d) Both (I) and (II)
Explanation: Idempotency Law is P V P = P.
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Miscellaneous”.
1. Which of the following contains output segments of AI programming?
a) Printed language and synthesized
b) Manipulation of physical object
c) Locomotion
d) All of the mentioned
Explanation: None.
2. In LISP, the square root of X is referenced as _____________
a) sqrt(x)
b) (sqrt x)
c) x/2
d) x/3
Explanation: None.
3. How can you evaluate 1.25 + sqrt (144) in LISP?
a) 1.25+sqrt (1.44)
b) (1.25+sqrt (1.44))
c) (+1.25 sqrt (1.44)
d) All of the mentioned
Explanation: None.
4. When a top-level function is entered, the LISP processor does?
a) It reads the function entered
b) It prints the result returned by the function
c) Large memory and high-speed processor
d) All of the mentioned
Explanation: None.
5. Which kind of planning consists of successive representations of different levels of a plan?
a) Hierarchical planning
b) Non-hierarchical planning
c) Project planning
d) All of the mentioned
Explanation: None.
6. The component of an ICAI (Intelligent Computer Assisted Instruction) presenting information to the student is the?
a) Student model
b) Problem solving expertise
c) Tutoring module
d) All of the mentioned
Explanation: None.
7. In which of the following situations might a blind search be acceptable?
a) Real life situation
b) Complex game
c) Small search space
d) All of the mentioned
Explanation: None.
8. The hardware feature of LISP machines generally includes _____________
a) Large memory and high-speed processor
b) Letter quality printers and eight-inch disk drives
c) A mouse and specialized keyboard
d) A mouse and specialized keyboard, Letter quality printers and eight-inch disk drives
Explanation: None.
