SERIAL UNIT DIFFICULTY

NUMBER NUMBER LEVEL(AD/HD)

1 I AD
2 I
3 I
4 I
5 I
6 I
7 I
8 I
9 I
10 I
11 I
12 I
13 I
14 I
15 I
16 I
17 I
18 I
19 I
20 I
21 I
22 I
23 I
24 I
25 I
26 I
27 I
28 I
29 I
30 I
31 I
32 I
33 I
34 I
35 I
36 I
37 I
38 I
39 I
40 I
41 I
42 I
43 I
44 I
45 I
46 I
47 I
48 I
49 I
50 I
51 I
52 I
53 I
54 I
55 I
56 I
57 I
58 I
59 I
60 I
61 I
62 I
63 I
64 I
65 I
 QUESTION TEXT
What is Artificial intelligence?
who coined the trem Artificial Intelligence
Which one of the following is not the advantage of AI
The characteristics of the computer system capable of thinking, reasoni
The succes of an intellignet behaviour of a system can be mesured with
Which one of the following application is not of AI
Which of the following areas can not contribute to build an intelligent
In which year John McCarthy coined the term Artificial Intelligence?
If a robot can alter its own trajectory in response to external conditions,
What is the name of the computer program that simulates the thought p
Which is not the commonly used programming language for AI
________ is the information that the agent receives
Utility based agent are the extension of ______agent
The major component/components for measuring the performance of problem
What is the expansion if PEAS in task environment
What kind of observing environments are present in artificial intelligence
Where does the performance measure is included
An Agent observes the environment through ______.
How many types of agents are there in artificial intelligence?
_______ choose action based on only current percept
What kind of environment is strategic in artificial intelligence
What are the composition for agents in artificial intelligence
Agents behavior can be best described by
In which agent does the problem generator is present
Different learning methods does not include
 OPTION_1 OPTION_2 OPTION_3
Putting your intelligence into Computer Programming with your own intelligence Making a Machin
Arthur Samule James Slagle Jhon McCarth
High Speed Digital Assistant Accuracy
machine intelligence human intelligence artificial intelli
System Test Turing Test Intelligent Test
Education Telsa Siri
Neuron science Maths Computer Sci
1956 1957 1965
intelligent Extra Ordinary Turing Tester
Expert reason Expert system Management in
PROLOG Java LISP
Percept Environment Action
Manager Goal Based Agent Simple Reflex
Completeness Optimality Time and Space
Peer, Environment, Actuators, Sense Perceiving, Environment, Actuators, Sensors Performance, E
Partial Fully Learning
Rational agent Task environment Actuators
Sensor SmartBox Accuator
1 2 3
Robot Simple Reflex Agent Smart Agent
Deterministic Rational Partial
Program Architecture Both Program &
Perception sequence Agent function Sensors and Ac
Learning agent Observing agent Reflex agent
Memorization Analogy Deduction
 OPTION_4 CORRECT OPTION
Playing a GamC
E. F. Codd C
High Cost D
virtual intellige C
Machine Test B
Netflix A
Geology D
1959 A
Knowledge A
Artificial Intell B
Perl D
Goal A
Smart Agent B
All of the ment D
None of the me C
Both Partial & D
Sensor B
Effctor A
4 D
Sensor B
Stochastic A
None of the me C
Environment in B
None of the me A
Introduction D
 DIFFICULT
Y
SERIAL UNIT LEVEL(AD
NUMBER NUMBER /HD)

1 II AD
2 II

3 II
4 II
5 II
6 II
7 II
8 II
9 II
10 II
11 II

12 II
13 II
14 II
15 II
16 II
17 II
18 II
19 II
20 II
21 II
22 II
23 II
24 II
25 II
26 II
27 II
28 II
29 II
30 II
31 II
32 II
33 II
34 II
35 II
36 II
37 II
38 II
39 II
40 II
41 II
42 II
43 II
44 II
45 II
46 II
47 II
48 II
49 II
50 II
51 II
52 II
53 II
54 II
55 II
56 II
57 II
58 II
59 II
60 II
61 II
62 II
63 II
64 II
65 II
 QUESTION TEXT OPTION_1
Hill climbing sometimes called ____________ because it grabs a good neighbor state Needy loca
without thinking ahead about where to go next.
blind search is also called as ________. Uninforme
 Input, output
A search algorithm takes _________ as an input and returns ________ as an output.
an intellignret agent act to increase their ________ Knowledg
Which search method takes less memory? Breadth-F
To solve a problem which 2 phase of formulation it should pass? Goal,Start
To solve problem using AI, Process consist of ___ steps. 2
Which one of the followings is not a part of process for solving problem using AI Defining
A* search strategy comes under ____. Uninforme
In BFS the frontier is implemented as a ________ queue. FIFO
Hill climbing Search algorithm works like _________ algorithm. When
AI
there is
less
When is breadth-first search is optimal?
number
What is the heuristic function of greedy best-first search? f(n)nodes
of = h(n)
Evaluation function for A* is f(n)=__+__ . h(n)+h(m)
Greedy approach in hill climbing means choosing best possible ________ solution. Hilltop
___________ behavior means something which can be determined with set of logicla proofs and actioSmart
simulated annealing is an efective and general form of ____________. Optimizati
AND/OR is implemented in the ______________ problem Determinist
OPTION_2OPTION_3OPTION_4
CORRECT OPTION

 Heuristic Greedy
local search
locOptimal lo C

Informed Simple reinitial Sea A

Problem, sSolution, Parameter
B
PerformanDatabase Goal MeasB
 Depth-First
Optimal
Searchs Linear Se B
Goal,ProbPath,GoalPath,ProbB
4 5 6C
Analysing Implemena sensorlessD
Blind SearInformed Classical C
LIFO FILO Random A
A* When
When all Hilltop
When all Generate aD
there is
step step
less B
costs are costs are
f(n) != number
equal
f(n) > h(n) unequal off(n)agent
< h(n) A
h(n)
h(n)+g(n) h(n)+c(n) g(n)+h(m) B
Complex Otimal Nearest D
Bounded DeterministRidge C
Hill climbi InspirationAgent A
Non-Determ Otimal Hill Climbi B
 DIFFICULT
Y
SERIAL UNIT LEVEL(AD
NUMBER NUMBER /HD)
1 III AD
2 III
3 III
4 III
5 III
6 III
7 III
8 III
9 III
10 III

11 III
12 III
13 III
14 III
15 III
16 III
17 III
18 III
19 III
20 III
21 III
22 III
23 III
24 III
25 III
26 III
27 III
28 III
29 III
30 III
31 III
32 III
33 III
34 III
35 III
36 III
37 III
38 III
39 III
40 III
41 III
42 III
43 III
44 III
45 III
46 III
47 III
48 III
49 III
50 III
51 III
52 III
53 III
54 III
55 III
56 III
57 III
58 III
59 III
60 III
61 III
62 III
63 III
64 III
65 III
 QUESTION TEXT
_______returns the set of legal moves in a state.
A utility function is also called :
A function defines the final numeric value for game that ends in terminal states for a player p is called
game tree defined by
In a normal search problem , the optimal solution would be a sequence of action leading to a_______
If the agent is acting deterministically, one of the probability will be ________
In _______system the observer may utilise a memory system in order to add information to observers understanding of the sys
In alpha beta pruning alpha stands for________
In alpha beta pruning beta stands for________
In chess the outcome win is represent with value

A zero-sum game is (confusingly) defined as one where the total payoff to all players is the _____ for every instance of the gam
In MINIMAX algorithm, the role played by Max is
The space complexity of minimax algorithm is
In alpha beta search, α is associated along with ___ path
 OPTION_1 OPTION_2OPTION_3OPTION_4
CORRECT OPTION
test actions utility player B
Objective function payoff funcnone of th both A andD
primary function secondary utility functoptimum fuC
initial state actions result all of the D
Goal state terminal st both A andinitial stateC
1 0 0.5 either A or A
fully obsevable Partially o static known B
Max Min both a andnone of th A
Max Min both a andnone of th B
1 0 2 none of th A
Undefine
Equal Unequal Zero d A
AND OR NOT NAND B
O(bm) O(bm) O(d) O(b) A
DFS MIN MAX BFS C
 DIFFICULT
Y
SERIAL UNIT LEVEL(AD
NUMBER NUMBER /HD)
1 IV AD
2 IV
3 IV
4 IV
5 IV
6 IV
7 IV
8 IV
9 IV
10 IV
11 IV
12 IV
13 IV
14 IV
15 IV
16 IV
17 IV
18 IV
19 IV
20 IV
21 IV
22 IV
23 IV
24 IV
25 IV
26 IV
27 IV
28 IV
29 IV
30 IV
31 IV
32 IV
33 IV
34 IV
35 IV
36 IV
37 IV
38 IV
39 IV
40 IV
41 IV
42 IV
43 IV
44 IV
45 IV
46 IV
47 IV
48 IV
49 IV
50 IV
51 IV
52 IV
53 IV
54 IV
55 IV
56 IV
57 IV
58 IV
59 IV
60 IV
61 IV
62 IV
63 IV
64 IV
65 IV
QUESTION TEXT
OPTION_1OPTION_2OPTION_3OPTION_4
CORRECT OPTION
 DIFFICULT
Y
SERIAL UNIT LEVEL(AD
NUMBER NUMBER /HD)
1 V AD
2 V
3 V
4 V
5 V
6 V
7 V
8 V
9 V
10 V
11 V
12 V
13 V
14 V
15 V
16 V
17 V
18 V
19 V
20 V
21 V
22 V
23 V
24 V
25 V
26 V
27 V
28 V
29 V
30 V
31 V
32 V
33 V
34 V
35 V
36 V
37 V
38 V
39 V
40 V
41 V
42 V
43 V
44 V
45 V
46 V
47 V
48 V
49 V
50 V
51 V
52 V
53 V
54 V
55 V
56 V
57 V
58 V
59 V
60 V
61 V
62 V
63 V
64 V
65 V
QUESTION TEXT
OPTION_1OPTION_2OPTION_3OPTION_4
CORRECT OPTION