Questions
1. In healthcare, an AI system that assists doctors in diagnosing
medical conditions by reasoning through a patient's symptoms
and medical history is an example of _________
a- Thinking Rationally b- Acting Humanly
c- Acting Rationally d- Thinking Humanly
_________________________________________________
2. Chatbots used in customer service that engage in
conversations and provide assistance to customers by
mimicking human interactions represent the ______ AI
approach
a- Thinking Rationally b-Acting Humanly
c- Acting Rationally d-Thinking Humanly
_________________________________________________
3- ________ is a type of problem that requiring percepts during
the execution.
a- Single state b- Contingency
c- Multiple State d- Exploration
_________________________________________________
4. Rational agent is the one who always does the right thing.
a- True b- False
___________________________________________________
5- ....... is a formal representation for world states.
a- Performance measure b- Actuators
c- Environment d-Sensors
_________________________________________________
6- _______ are observations that allow the agent to infer the
world state.
a- Performance measure b- Actuators
c- Environment d- Sensors
___________________________________________________
7. If the environment is partially observable, however, then it
could appear to be ________
a- Episodic b- Stochastic
c- Partially Observable. d- Static
_________________________________________________
8. An intelligent Sudoku Solver's environment is:
a- Strategic b- Stochastic
c- Discrete d- Multi-Agent.
_________________________________________________
9- ......... agents select actions on the basis of the current
percept, ignoring the rest of the percept history.
a- Simple reflex b- Goal-based
c- Model-based reflex d- Utility-based
_________________________________________________
10. In a medical diagnosis system that learns from a database of
patient records to predict diseases, the concept that is primarily
used is _________
a- Computer Vision b- Data Mining
c- Natural Language Processing d- Machine Learning
__________________________________________________
11. Which agent type of a language translation app aiming to
provide accurate translations?
a- Cost based b- Goal based
c- Table based d- Model-based
____________________________________________________
12. A search algorithm takes ------- as an input and returns ------
as an output.
a- Input, output b- Solution, problem
c- Problem, solution d-Parameters, sequence of actions
___________________________________________________
13. Which search strategy is also called as blind search?
a- Uninformed search b- Simple reflex search
c- Informed search d- Heuristic Search
________________________________________________
14. A problem is first connected to its proposed solution during
the _______ stage.
a- conceptualization b- identification
c- implementation. d- formalization
_________________________________________________
15- ........ is a type of an optimization search algorithm.
a- uniform-cost b- A*
c- genetic algorithms d- Greedy best-first
-__________________________________________________
16- ..... Is a type of Game playing algorithm
a- uniform-cost b- alpha-beta pruning
c- Ant Colony Optimization d- beam search
________________________________________________
17- ..... Is a type of search strategy to find an optimal value of
an objective function.
a- Exhaustive b- Heuristic
c- Optimization d- Adversarial
_________________________________________________
18- ....... is calculated by number of nodes generated
a- Completenss b-Time Complexity
c- Space Complexity d- Optimality
________________________________________________
19- ...... measure if the algorithm can always find a least-cost
solution
a- Completenss b- Time Complexity
c- Space Complexity d- Optimality
________________________________________________
20- In which problem type, agent should build map of
environment to solve the problem.
a- Single state b- Contingency
c- Multiple State d- Exploration
__________________________________________________
21- Using the heuristic h(N) "selecting the cell with the fewest
possible candidate values (i.e., the smallest domain) to fill first",
may reduce the branching factor in the search space.
a- True b- False
___________________________________________________
22- Which search algorithm imposes a fixed depth limit on
nodes?
a- Depth-limited search b- Iterative deepening search
c- Depth-first search d- Bidirectional search
_________________________________________________
23- What is Time Complexity of Breadth First search algorithm?
a- b^d b- b^m c- b^2 d- bm
__________________________________________________
24- What is Space Complexity of Depth First search algorithm?
a- b^d b- b^m c- b^2 d- bm
___________________________________________________
25- uniform-cost search expands the node n with the
a- Lowest path cost b-Highest path cost
c- Heuristic cost d- Average path cost
__________________________________________________
26- 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)
__________________________________________________
27- Greedy search strategy chooses the node for expansion in
a- Shallowest b- The one closest to the goal node
c- Deepest d- Minimum heuristic cost
_________________________________________________
28- A* algorithm is based on
a- Breadth-First-Search b- Uniform Cost Search
c- Depth-First-Search d- Best-First-Search
__________________________________________________
29- Which informed search algorithm uses a priority queue to
expand nodes with the lowest estimated cost first?
a- Depth-First Search b- A* Search
c- Breadth-First Search d- Uniform Cost Search
__________________________________________________
30- In A* search, the cost function is defined as ....
a- g(n) + h(n) b- h(n) c- g(n) d- g(n) - h(n)
__________________________________________________
31- Hill climbing is sometimes called.....
a- Local maxima search b- optimal search algorithm
c- greedy local search d- brute force search
____________________________________________________
32- The main drawback of Hill-climbing Search is........
a- Failing to reach the optimal solution
b- Heavy reliance on random calculations
c- Inability to move backward
d- Complexity in performance analysis
__________________________________________________
33- In a local search algorithm, elevation corresponds to Cost
when the aim is to find the..... point, that known as the..........
a- highest, global minimum. b- lowest, global minimum.
c- highest, global maximum. d- lowest, global maximum.
__________________________________________________
34- What is the role of the utility function in game-playing
scenarios?
a- Generating all legal next board configurations
b- Evaluating each move's quality
c- Identifying the starting configuration
d- Determining the opponent's strategy
____________________________________________________
35- Which statement best defines the Alpha-beta pruning
technique?
a- Increasing the number of nodes explored in the search tree
b- Enhancing the accuracy of the utility function
c- Reducing the number of legal moves in a game
d- Eliminating unnecessary branches in the search tree
___________________________________________________
36- The Disjunction of proposition is ____
a- P ~ Q b- P V Q c- P | Q d- P ~ A
_________________________________________________
37- Writing the English sentence "Every Red Sox player has no
love for any Yankee player" in FOL will result in the following
sentence:
a- b- c- d-
_________________________________________________
38. Writing the English sentence "Not a single Red Sox player is
better than any Yankee" in FOL will result in the following
sentence:
a- b- c- d-
____________________________________________________
39- Local search algorithms are used to solve pure optimization
problems by finding the best state without rules
a-True b- False
__________________________________________________
40- The heuristic cost function for the 8-queens problem
represents the number of queen-pairs attacking each other.
a- True b- False
________________________________________________
41- Simulated Annealing uses a physical analogy with the
annealing process to soften metals.
a- True b- False
________________________________________________
42- Depth-first search always expands at least as many nodes as
A search with an admissible heuristic.
a- True b- False
________________________________________________
43- The major drawback of Hillclimbing is that it is only
guaranteed to work for two-dimensional search spaces.
a- True b- False
_________________________________________________
44- The mini-max and alpha-beta procedures will always back
up identical values to the root node of a game tree.
a- True b- False
__________________________________________________
45- Uniform cost search is a generalization of depth first search
in which arcs can have non-unit costs.
a- True b- False
________________________________________________
46- "X=Y=john" can be expressed by "loves (john,X)=loves(Y,Y)"
a- True b- False
__________________________________________________
47- "Each lecture has a specific time and place" is an example of
declarative knowledge.
a- True b- False
___________________________________________________
48- "A car has four tires" is an example of procedural
knowledge.
a- True b- False
___________________________________________________
49- The conjunction of proposition is.....
a- P ¬ Q b- P ^ Q c- P | Q d- P ~ A
___________________________________________________
50- Writing the English sentence "All Yankee players have the
same skill level (no player is better than another)" in FOL will
result in the following sentence:
_________________________________________________
51- How many logical connectives are there in artificial
intelligence?
a- 3 b- 4 c- 5 d- 6
________________________________________________
52- A stochastic environment is one in which the next state is
completely determined by the agent's action.
a- True b- False
________________________________________________
53- Algorithm A* will always find the shortest solution if one
exists and it is of finite length.
a- True b- False
_________________________________________________
54- The minimax algorithm has been adapted to games that
include a chance element, such as backgammon.
a- True b- False
_________________________________________________
55- "Mohamed is older than Ahmed" is an example of
procedural knowledge.
a- True b- False
