(B) Static / Dynamic

(Q.1) What are the main goals of AI? (C) Deterministic / Non-deterministic
(A) To Create Expert Systems (D) Single agent / Multiple agents
(B) To Implement Human Intelligence (Q.8) Chess is example of which
in Machines properties?
(C) Both A and B (A) Discrete
(D) None of the Above (B) Continuous
(Q.2) Which of the following is an (C) Episodic
application of AI? (D) Non-deterministic
(A) Gaming (Q.9) Which environment is called as
(B) Expert Systems semi dynamic?
(C) Vision Systems (A) Environment does not change with
(D) All of the above the passage of time
(Q.3) An AI system is composed of? (B) Agent performance changes
(A) agent (C) Environment does not change with
(B) environment the passage of time, but Agent
(C) Both A and B performance changes
(D) None of the Above (D) Environment will be changed
(Q.4) Which is used to improve the (Q.10) Depth-First Search is implemented
agent’s performance? in recursion with _______ data
(A) Perceiving structure.
(B) Observing (A) LIFO
(C) Learning (B) Vectors
(D) Sequence (C) FIFO
(Q.5) What could possibly be the (D) Maps
environment of a Satellite Image (Q.11) Which data structure conveniently
Analysis System? used to implement BFS?
(A) Computers in space and earth (A) Stacks
(B) Image categorization techniques (B) Queues
(C) Statistical data on image pixel (C) Priority Queues
intensity value and histograms (D) None of the Above
(D) All of the above (Q.12) Greedy search strategy chooses
(Q.6) What is an Agent? the node for expansion in ___________
(A) An agent is anything that can (A) Shallowest
perceive its environment through (B) Deepest
sensors (C) The one closest to the goal node
(B) An agent is anything that can (Q.13) What is Branching Factor?
change its environment through (A) Length of the shortest path from
sensors initial state to goal state.
(C) An agent is anything that can (B) The average number of child
control its environment through nodes in the problem space graph.
sensors (C) A property of an algorithm to
(D) None of the Above always find an optimal solution.
(Q.7) Which of the following is not (D) None of the Above
Properties of Environment? (Q.14) Which of the following search
(A) Discrete / Continuous algorithm searches forward from
 initial state and backward from goal conclusions (or take certain
state till both meet to identify a actions) given those facts.
common state? (Q.20) How many types of chaining rules
(A) Uniform Cost Search are there in rule-based system?
(B) Iterative Deepening Depth-First (A) 2
Search (B) 3
(C) Bidirectional Search (C) 4
(D) None of the Above (D) 5
(Q.15) What is the heuristic function of (Q.21) What is true about rule-based
greedy best-first search? system?
(A) f(n) != h(n) (A) The definitions of rule-based
(B) f(n) < h(n) system depend almost entirely on
(C) f(n) = h(n) expert systems.
(D) f(n) > h(n) (B) A rule-based system uses rules as
(Q.16) Which of the following are the knowledge representation for
Components of Expert Systems? knowledge coded into the system.
(A) Knowledge Base (C) A rule-based system is a way of
(B) Inference Engine encoding a human expert's
(C) User Interface knowledge in a fairly narrow area
(D) All of the above into an automated system.
(Q.17) Which of the following strategies (D) All of the above
used by Inference Engine? (Q.22) Rules are expressed as a set of
(A) Forward Chaining _______________.
(B) Block Chaining (A) Switch statement
(C) Stable Chaining (B) Using Loop
(D) Both A and B (C) if-then statements
(Q.18) If temperature < 0, then what is (D) Using continue statement
data in the statement? (Q.23) ________ systems are Data-driven,
(A) 0 whereas backward chaining systems
(B) <0 are goal-driven.
(C) temperature (A) Backward Chaining
(D) temperature < 0 (B) Forward Chaining
(Q.19) Which of the following is false? (C) Spanning Chaining
(A) A knowledge engineer has the job (D) None of the above
of extracting knowledge from an (Q.24) Backward chaining rule is?
expert and building the expert (A) Goal driven
system knowledge base. (B) Data driven
(B) An expert system is a computer (C) Both A and B
program that contains some of the (D) None of the above
subject-specific knowledge of one (Q.25) The truth values of traditional set
or more human experts. theory is ____________ and that of fuzzy
(C) A rule-based system consists of a set is __________
bunch of IF-THEN rules. (A) Either 0 or 1, between 0 & 1
(D) In a backward chaining system, (B) Between 0 & 1, either 0 or 1
you start with the initial facts, and (C) Between 0 & 1, between 0 & 1
keep using the rules to draw new (D) Either 0 or 1, either 0 or 1
(Q.26) The room temperature is hot. Here (A) Negative Infinity
the hot (use of linguistic variable is (B) 0
used) can be represented by _______ (C) Positive Infinity
(A) Fuzzy Set (D) 1
(B) Crisp Set (Q.33) The main condition which
(C) Both A and B required for alpha-beta pruning is?
(D) None of the Above (A) alpha<=beta
(Q.27) What action to take when IF (B) alpha>=beta
(temperature=Warm) AND (C) alpha=beta
(target=Warm) THEN? (D) alpha!=beta
(A) Heat (Q.34) The MIN player will only update
(B) No_Change the value of alpha.
(C) Cool (A) TRUE
(D) None of the Above (B) FALSE
(Q.28) In Membership function graph x- (C) Can be true or false
axis represent? (D) Cannot say
(A) universe of discourse. (Q.35) To which depth does the alpha-
(B) degrees of membership in the [0, beta pruning can be applied?
1] interval (A) 10 states
(C) degrees of discourse (B) 12 states
(D) Universe of membership (C) 8 states
(Q.29) Fuzzy logic is usually represented (D) Any States
as ___________ (Q.36) Which search is similar to minimax
(A) IF-THEN-ELSE rules search?
(B) IF-THEN rules (A) Hill-climbing search
(C) Both IF-THEN-ELSE rules & IF- (B) Depth-first search
THEN rules (C) Breadth-first search
(D) None of the Above (D) All of the above
(Q.30) The values of the set membership (Q.37) Which value is assigned to alpha
are represented by ___________ and beta in the alpha-beta pruning?
(A) Discrete Set (A) alpha = max
(B) Degree of truth (B) alpha = min
(C) Probabilities (C) beta = min
(D) Both Degree of truth & (D) Both A and C
Probabilities (Q.38) Neural Networks are complex
(Q.31) There is a technique by which ______________ with many parameters.
without checking each node of the (A) Linear Functions
game tree we can compute the correct (B) Nonlinear Functions
minimax decision, and this technique (C) Discrete Functions
is called? (D) Exponential Functions
(A) alpha-beta pruning (Q.39) Which of the following is not true
(B) Alpha-Beta Algorithm about artificial neural network?
(C) pruning (A) It can explain result
(D) minimax algorithm (B) It can survive the failure of some
(Q.32) The initial value of alpha in alpha- nodes
beta pruning is ________. (C) It has inherent parallelism
 (D) It can handle noise (D) None of the mentioned
(Q.40) The output at each node is (Q.45) Which search is complete and
called_____. optimal when h(n) is consistent?
(A) node value (A) Best-First Search
(B) Weight (B) Depth-First Search
(C) neurons (C) Both Best-first & Depth-First
(D) axons Search
(Q.41) A 4-input neuron has weights 1, 2, (D) A* search
3 and 4. The transfer function is linear (Q.46) What is the action of task
with the constant of proportionality environment in artificial intelligence?
being equal to 2 (i.e f(x)=2x). The (A) Problem
inputs are 4, 3, 2 and 1 respectively. (B) Solution
What will be the output? (C) Agent
(A) 20 (D) Observation
(B) 40 (Q.47) What kind of environment is
(C) 50 crossword puzzle?
(D) 60 (A) Static
(Q.42) What is back propagation? (B) Dynamic
(A) It is another name given to the (C) Semi Dynamic
curvy function in the perceptron (D) None of the mentioned
(B) It is the transmission of error back (Q.48) What kind of behavior does the
through the network to adjust the stochastic environment possess?
inputs (A) Local
(C) It is the transmission of error back (B) Deterministic
through the network to allow (C) Rational
weights to be adjusted so that the (D) Primary
network can learn (Q.49) The amount of output of one unit
(D) None of the Above received by another unit depends on
(Q.43) The network that involves what?
backward links from output to the (A) output unit
input and hidden layers is called (B) input unit
_________ (C) activation value
(A) Self-organizing map (D) weight
(B) Perceptrons (Q.50) The fundamental unit of network
(C) Recurrent neural network is _______.
(D) Multi layered perceptron (A) brain
(Q.44) Which function will select the (B) nucleus
lowest expansion node at first for (C) neuron
evaluation? (D) axon
(A) Greedy Best-First Search
(B) Best-First Search
(C) Depth-First Search
.
(Q.51) Given the following search tree, apply the alpha-beta pruning algorithm to it and show the
search tree that would be built by this algorithm. Make sure that you show where the alpha
and beta cuts are applied and which parts of the search tree are pruned as a result. (Max player
is the top layer)
A Max

B C Min

D E F G Max

6 5 8 10 2 1 15 18

(Q.52) Covid-19 tests are common nowadays, but some results of tests are not true. Let’s assume
that a diagnostic test has 99% accuracy for those who have the disease and 90% for those who
does not. If 60% of all people have Covid-19. If a patient tests positive, what is the probability
that they have the disease?
(Q.53) Two players P1 and P2 are competing at a quiz game involving a series of questions. On any
individual question, the probabilities that P1 and P2 give the correct answer are α and β
respectively, for all questions, with outcomes for different questions being independent. The
game finishes when a player wins by answering a question correctly. Compute the probability
that P1 wins if:
(A) P1 answers the first question,
(B) P2 answers the first question.