AI 2023 Past Question
AI 2023 Past Question
Name:
----- ----- ----- ---Index Number: - - - - - - -
Circle the correct answer from the choices provided for each ofthe following questions
I. Which function will select the lowest expansion node at first for evaluation?
a. Greedy best-first search c. Breadth-first search
b. Depth-first search d. Both A and B
2. Which search uses problem-specific knowledge beyond the definition of the problem?
a. Informed search c. Best-first search
b. Depth-first search d. Uninformed
3. A pro'cess that is repeated, evaluated and re-defined is called
a. diagnostic c. interpretative
b. descriptive • d. iterative
4. Which of the following is not done by a Goal-based agent?
a. Conclusion c. Searching
b. Planning d. Inference
Page 1 of 6
c. knowledge base
a. inference engine
d. all of the mentioned
b. user interface
The following task/tasks Artificial Intelligence could not do yet . t·
8. Construction of plans in rea1 ime
a. Understand natural language c. dynamic systems
robustly
d. All of the mentioned
b. Web mining
.
. particular . of computers 1s
generation • d Wt·th artificial intelligence? .
• associate
9. Which
a. Second c. Fifth
d. Third
..
b. Fourth
I 0. In which of-the following situations b. complex game
might a blind search be acceptable? C. small search space
a. real-life situation d. all of.the mentioned
11. Computers normally solve problem by breaking them down into a series of yes-or-no
decisions represented by ls and Os. What is the name of the logic that allows computers to
assign numerical values that fail somewhere between 0 and I?.
a. Human logic c. Fuzzy logic
b. Boolean logic d. Operational logic
12. In language underst~nding, the levels of knowledge that docs.not include
a. E1n]5irical c. Syntactic
b. Phonological ·_ :d. Semantic
13. What is state space?
a. The whole problem . d. Representation your problem
b. Your definition to the problem with variable and parameter
I
17. A completely automated chess engine (Learn from previous games) is based on
a. Strong Artificial Intelligence c. Cognitive Artificial Intelligence
approach .. approach
_b. Weak Artificial lntelligen~e d. Applied Artificial Intelligence
approach approach
18. What kind of environment is strategic in artificial intelligence? ,'
a. Deterministic c. Partial
b. Rational d. Stochastic
19. Agents behavior can be best described by
a. Perception sequen~e d. Environment in which agent is
performing
b. Agent function
c. Sensors and Actuators
20. Which search is implemented with an empty first-in-first-out queue?
a. Depth-first search c. Bidirectional search·
d. None of the mentioned
1
b. Bre·adth-first search
\
\I
21. Strategies that know whether one non-goal state is "more promising" than another are caHed
a. Informed & Unformed Search c. Heuristic & Unformed Search
b. Unformed Search d. Informed· & Heuristic Search
22. In AI problem definition, the property that describes the result of each actions taken in a
particular state is known as
a. Transition model c. Goal Test
b. Percept sequence d. all of the above
23. If machine learning model output involves target variable, then that model is called
a. descriptive model c. reinforcement learning
b. predictive model . d. Initial state
24. Data used to build a data mining model
a. Training data c. Test data
b. Validation data d. Hidden data
25. Of the following examples, which would you address using a supervised learning algorithm?
a. given email labeled as spam or b. given a set of news articles found
not spam, learn a spam filter on the web, group them into set
of articles about the same story I
Page 3 of6
d. find the patterns in market basket
c. given a database of customer
data, automatically discover analysis
market segments and group
customers into different market
segments.
26. Following are the types of supervised learning.
a. classification c. sub-group discovery
b. regression d. all of the above
27. What is gini index
a. it is a type of index structure c. both options except none
b. it is a measure of purity d. none of the options
28. Which one of these is not a tree based learner
a. cart c. Bayesian classifier
b. id3 d. Random fore st
29. What is Decision Tree?·
...
a. flow-chart c. flow-chart like structure i!'1 which
b. structure in which internal internal node represents test on •
node represents test on an an attribute, each branch .
a_ttribute, each branch represents represents outco~e of test and
-0ut-eo1ne of test and each leaf each leaf node represents class
node represents class label label
d. none of the above
30. ML techniques that involve the ':}Sage of both labeled and _unlabeled data is called
a. supervised .c. unsupervised
b. semi-supervised d. none of the above
Fill the spaces provided the appropriate answers
31 ................... ••••••••••••....... is a proposed means of testing the intelligence of a machine
by ......·.............................. .
32. . .................................... find solution for a program by trying different sequences of
actions/operators until a solution is found.
33. In AI, the representation of a problem in terms of states and operators that change states in
known as . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ... . ............................... .
34. The area of AI that investigates methods of facilitating communications between humans and
computers is called .................................... .
35 ................ .-................. is a field that investigates the mechanics of human intelligence.
36. The Professor at the Stanford University that coined the word 'artificial intelligence' in I956
at a conference held at Dartmouth college is ..........................•••••••
37. The embodiment of human intellectual capabilities within a computer is the category Al
called .............·................... .
38. The conference that launched the AI revolution in 1956 was held at .....•..••••••• ••• ••••••.~ ••
• a term •ts used 1or
39 ......................... ts c. descn·b·1ng the JU
• dgmentaJ or common-sense part of
problem solving.
40. The action of the Simple reflex agent completely depends upon ...........................
41: ·In terms of observabiJity, the crossword puzzle can be classified as ............. ............ .
42. An agent consists of architecture and ...........................
43. A search algorithm takes ........................... as an input and returns .......................... .
as an output.
44. The ........................... is a toµring problem in which each city must be visited exactly
i Using Tor F respectively, indicate whether the following statements are True or False. Note:
Wrong guesses shall he penalized, take the 5th if you are not sure
47. Artificial intelligence is the study of how to make computers do things which, at the moment,
people can do better.
48. Artificial-intelligence does not necessarily imply understanding.
49. A heuristic is a way of trying to discover something or an idea embedded in a problem.
50. In an Unsupervised learning specific output values are not given.
Page 5 of6
\
. \
'
51. If a hypothesis says it should be positive, but in fact it is negative, we call it true negative
hypothesis.
52. A statement is satisfiable if there is some interpretation for which it is true.
53. Good data structures are likely to affect the performance of learner system.
54. Perception involves sights, sounds, smell, touch and acting.
55. A natural language generation program must decide what to say.
56. The action of the Simple reflex agent completely depends upon perception history.
57. A basic line following robot is based on is based on weak artificial intelligence approach.
58. Humans are examples of the intelligent agent/agents.
59. Perf~rmance Measures are fixed_for all agents.
,
60. An omniscient agent knows the actual outcome of its actions and can act accordingly; but
om~iscience is, impossible in reality. Rational Agent always does the right thing; but
Rationality is ·possible in reality.
61. The game of Poker is a single agent.
62. A problem in a search space is defined by initial state. I•
'
63. Solution·quality is measured by the path cost function, and an optimal solution has the
highest path cost among all solutions. ·, ....
64. The r_un time of an algorithm is the time taken for ~he algorith1n to s?lve a decision problem.
-THEORY
You are trained to be an Engineer not a writer, answer ttll questions precisely
1. The wolf-goat-cabbage problem -
•You are on the bank of a river with a boat, cabbage; a goat and wolf. Your task is to get
everything to the other side. Without.solving
.
the ·pro~~lem
. • .
a) Describe the PEAS - ..-
b) Formulate the problem i~.terms of state space.
2. Succinctly define the folki~ng terms in relation to Al.
. ,>
Page 6 of 6