Which is a refutation complete inference procedure for propositional logic?

a) Clauses
b) Variables
c) Propositional resolution
d) Proposition
What kind of clauses are available in Conjunctive Normal Form?
a) Disjunction of literals
b) Disjunction of variables
c) Conjunction of literals
d) Conjunction of variables
What is the condition of literals in variables?
a) Existentially quantified
b) Universally quantified
c) Quantified
d) None of the mentioned
Which can be converted to inferred equivalent CNF sentence?
a) Every sentence of propositional logic
b) Every sentence of inference
c) Every sentence of first-order logic
d) All of the mentioned
Which sentence will be unsatisfiable if the CNF sentence is unsatisfiable?
a) Search statement
b) Reading statement
c) Replaced statement
d) Original statement
Which rule is equal to the resolution rule of first-order clauses?
a) Propositional resolution rule
b) Inference rule
c) Resolution rule
d) None of the mentioned
At which state does the propositional literals are complementary?
a) If one variable is less
b) If one is the negation of the other
c) All of the mentioned
d) None of the mentioned
What is meant by factoring?
a) Removal of redundant variable
b) Removal of redundant literal
c) Addition of redundant literal
d) Addition of redundant variable
What will happen if two literals are identical?
a) Remains the same
b) Added as three
c) Reduced to one
d) None of the mentioned
When the resolution is called as refutation-complete?
a) Sentence is satisfiable
b) Sentence is unsatisfiable
c) Sentence remains the same
d) None of the mentioned
Which is created by using single propositional symbol?
a) Complex sentences
b) Atomic sentences
c) Composition sentences
d) None of the mentioned
Which is used to construct the complex sentences?
a) Symbols
b) Connectives
c) Logical connectives
d) All of the mentioned
How many proposition symbols are there in artificial intelligence?
a) 1
b) 2
c) 3
d) 4
How many logical connectives are there in artificial intelligence?
a) 2
b) 3
c) 4
d) 5
Which is used to compute the truth of any sentence?
a) Semantics of propositional logic
b) Alpha-beta pruning
c) First-order logic
d) Both Semantics of propositional logic & Alpha-beta pruning

Which are needed to compute the logical inference algorithm?

a) Logical equivalence
b) Validity
c) Satisfiability
d) All of the mentioned

From which rule does the modus ponens are derived?

a) Inference rule
b) Module rule
c) Both Inference & Module rule
d) None of the mentioned

Which is also called single inference rule?

a) Reference
b) Resolution
c) Reform
d) None of the mentioned

Which form is called as a conjunction of disjunction of literals?

a) Conjunctive normal form
b) Disjunctive normal form
c) Normal form
d) All of the mentioned

What can be viewed as a single lateral of disjunction?

a) Multiple clause
b) Combine clause
c) Unit clause
d) None of the mentioned

What is the process of capturing the inference process as a single inference rule?
a) Ponens
b) Clauses
c) Generalized Modus Ponens
d) Variables
Which process makes different logical expression looks identical?
a) Lifting
b) Unification
c) Inference process
d) None of the mentioned

Which algorithm takes two sentences and returns a unifier?

a) Inference
b) Hill-climbing search
c) Depth-first search
d) Unify algorithm

Which is a lifted version of modus ponens?

a) Generalized modus ponens
b) Inference
c) Clauses
d) None of the mentioned

Which is unique up to renaming of variables?

a) Unifier
b) Most general unifier
c) Unifier & Most general unifier
d) None of the mentioned

Which makes the complexity of the entire algorithm quadratic in the size?
a) Clause
b) Inference
c) Resolution
d) Occur check

How many functions are available in the unification and lifting process?
a) 1
b) 2
c) 3
d) 4

Where did all the facts are stored to implement store and fetch function?
a) Database
b) Knowledge base
c) Datamart
d) All of the mentioned
What is meant by predicate indexing?
a) All the one kind of facts in one bucket and another kind in other bucket
b) Acts like index for facts
c) All of the mentioned
d) None of the mentioned

How the buckets are stored in predicate indexing?

a) Lists
b) Stack
c) Hashes
d) None of the mentioned

Using logic to represent and reason we can represent knowledge about the world
with facts and rules.
a) True
b) False

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

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

How is Fuzzy Logic different from conventional control methods?

a) IF and THEN Approach
b) FOR Approach
c) WHILE Approach
d) DO Approach

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
The primitives in probabilistic reasoning are random variables.
a) True
b) False

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

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

What is the other name of informed search strategy?

a) Simple search
b) Heuristic search
c) Online search
d) None of the mentioned

How many types of informed search method are in artificial intelligence?

a) 1
b) 2
c) 3
d) 4

Which search uses the problem specific knowledge beyond the definition of the
problem?
a) Informed search
b) Depth-first search
c) Breadth-first search
d) Uninformed search

Which function will select the lowest expansion node at first for evaluation?
a) Greedy best-first search
b) Best-first search
c) Depth-first search
d) None of the mentioned
What is the heuristic function of greedy best-first search?
a) f(n) != h(n)
b) f(n) < h(n)
c) f(n) = h(n)
d) f(n) > h(n)

Which search uses only the linear space for searching?

a) Best-first search
b) Recursive best-first search
c) Depth-first search
d) None of the mentioned

Which method is used to search better by learning?

a) Best-first search
b) Depth-first search
c) Metalevel state space
d) None of the mentioned

Which search is complete and optimal when h(n) is consistent?

a) Best-first search
b) Depth-first search
c) Both Best-first & Depth-first search
d) A* search

Which is used to improve the performance of heuristic search?

a) Quality of nodes
b) Quality of heuristic function
c) Simple form of nodes
d) None of the mentioned

Which search method will expand the node that is closest to the goal?
a) Best-first search
b) Greedy best-first search
c) A* search
d) None of the mentioned

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
A* algorithm is based on ___________
a) Breadth-First-Search
b) Depth-First –Search
c) Best-First-Search
d) Hill climbing

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

Uninformed search strategies are better than informed search strategies.

a) True
b) False

. 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

Best-First search can be implemented using the following data structure.

a) Queue
b) Stack
c) Priority Queue
d) Circular Queue

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

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
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

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

What is the space complexity of Greedy search?

a) O(b)
b) O(bl)
c) O(m)
d) O(bm)

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

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

In many problems the path to goal is irrelevant, this class of problems can be
solved using ____________
a) Informed Search Techniques
b) Uninformed Search Techniques
c) Local Search Techniques
d) Informed & Uninformed Search Techniques
Though local search algorithms are not systematic, key advantages would
include __________
a) Less memory
b) More time
c) Finds a solution in large infinite space
d) Less memory & Finds a solution in large infinite space

A complete, local search algorithm always finds goal if one exists, an optimal
algorithm always finds a global minimum/maximum.
a) True
b) False

. _______________ Is an algorithm, a loop that continually moves in the direction of

increasing value – that is uphill.
a) Up-Hill Search
b) Hill-Climbing
c) Hill algorithm
d) Reverse-Down-Hill search

When will Hill-Climbing algorithm terminate?

a) Stopping criterion met
b) Global Min/Max is achieved
c) No neighbor has higher value
d) All of the mentioned

What are the main cons of hill-climbing search?

a) Terminates at local optimum & Does not find optimum solution
b) Terminates at global optimum & Does not find optimum solution
c) Does not find optimum solution & Fail to find a solution
d) Fail to find a solution

Stochastic hill climbing chooses at random from among the uphill moves; the
probability of selection can vary with the steepness of the uphil1 move.
a) True
b) False
Hill climbing sometimes called ____________ because it grabs a good neighbor state
without thinking ahead about where to go next.
a) Needy local search
b) Heuristic local search
c) Greedy local search
d) Optimal local search

Hill-Climbing approach stuck for which of the following reasons?

a) Local maxima
b) Ridges
c) Plateaux
d) All of the mentioned

. ___________ algorithm keeps track of k states rather than just one.

a) Hill-Climbing search
b) Local Beam search
c) Stochastic hill-climbing search
d) Random restart hill-climbing search

A genetic algorithm (or GA) is a variant of stochastic beam search in which

successor states are generated by combining two parent states, rather than by
modifying a single state.
a) True
b) False

What are the two main features of Genetic Algorithm?

a) Fitness function & Crossover techniques
b) Crossover techniques & Random mutation
c) Individuals among the population & Random mutation
d) Random mutation & Fitness function

Searching using query on Internet is, use of ___________ type of agent.

a) Offline agent
b) Online agent
c) Both Offline & Online agent
d) Goal Based & Online agent