Student: Renad Zuhairi

MCQ and Essay Questions For Mid TM366

1- ………….is a feature of some interactive systems: complex, ordered patterns of behavior,

which are a property of the system as a whole, arise from the simple, interactive
behavior of the system’s component parts.
A selection B adaptation C interaction D emergence

2- The moves that the chess piece is legally of making is called ……………..
A State B State space C Symbol
D Process

3- A search strategy with the advantage of always finding a route –if exist- with least
number of intermediate states at the expense of having to keep on the agenda every
path with this number of steps.
A Breadth-first search B Data search C Depth first search D None of the
above

4- Cockroach is an expert at sensing exactly where a threat is coming from and taking
speedy evasive action in the safest direction and this intelligent action can be considered
as ………….
A Internal interaction B Interaction with other agents
C Interaction with the environment D None of the above

5- In…………, there is a set of exemplars, each one accompanied by a teaching input that
indicates the correct or the desired answer.
A Unsupervised learning B Supervised learning C Self-learning D Automated
learning

6- 6 ……………………is a mechanism in which communication between a number of units

results in a complex task being performed.
A Selection B Interaction C Adaptation D None of the above
7- 7 Laying pheromones is an example of interaction………..
A With the environment B Between agents C Internal interaction D None of the
above

8- “The sky is clear” is an example of ………………..knowledge

A Declarative B Procedural C Base D meta

9- Construction and usage of tools by non-human anthropoid can be considered as …………..

A systematic behavior B symbolic AI C purposeful behavior D None of the
above

10- The task of identifying a process, applying it to an expression and so changing the
expression in some way is termed ………………..
A Symbol structure B Interpretation C object D PSSH

11- …….. are both categorized as uninformed search algorithms.

A Iterative-deepening search and Beam search B A* and Beam search
C Breadth-first search and Depth-first search D A* and Best-first search

12- …………………. start with a possible solution and then play with it, checking if better
solutions can be found by making small alterations at various points.
A Local search algorithm B Exact algorithm
C Construction algorithm D Approximate algorithm

13- In the missionaries and cannibals problem, the statement “Missionaries can never be
outnumbered by cannibals on either side of river, or else the missionaries are killed” is
considered……………
A constraint B state C goal D operator

14- In context of AI, the word “fitness” is used in searching for a solution for a particular
problem to measure ________.
A How good a solution is B How complex the solution is
C How feasible the solution is D None of the above

15- ………..is a path from the initial state to the goal state.
A State B State space C Solution cost D Solution

16- When we create a system that tries to mimic intelligence, it is called .. …….
A optimization B emulation C Simulation D None of the above
17- In …………any valid solution is as good as any other solution.
A Satisfaction problem B Combinational optimization problems
C Optimization problem D None of the above

18- Insect motion based on their leg muscles is an example of interaction of the type …….
A Interaction with other agents B Interaction with the environment
C Internal interaction D None of the above

19- ………………..describes how much memory is needed to perform the search.

A Space complexity of search algorithm B Time complexity of search
algorithm
C Completeness of search algorithm D Optimality of search algorithm

20- The statement “Move boat containing some set of occupants across the river (in either
direction) to the other side” in the Missionaries and cannibals is an example of
………………..
A Constraint B Operator C Goal D State

21- In …………. we always start from hypothesis until reaching the goal
A Forward chaining B None of the above C Backward chaining D Satisfaction
problem

22- ‘does the search process consume large amounts of either time or space in finding a
solution ?’ describes algorithm ………..
A complexity B completeness C optimality D linearity

23- …………is the sifting out of units whose characteristics and behavior make them less
capable of responding successfully to the problems thrown up by their environment..
A emergence B adaptation C interaction D selection

24- Argentine Ants lay down deposits of special chemicals known as………..
A Signals B Pheromone C Trails D Recruitment

25- In________, there is a set of exemplars, each one accompanied by a teaching input that
indicates the correct or the desired answer.
A Automated learning B Supervised learning C Self-learning D Unsupervised
learning
26- In ………………a learning system is presented with the inputs and desired outputs of a
program or procedure. The system has to derive the program that satisfies these
constraints.
A inductive programming B Unsupervised learning
C Supervised leaning D Speed-up learning

27- In …………behavior, the animal responds directly to a stimulus with a motor pattern and
without any intervening processing.
A Conscious B Reactive C Reflexive D None of the above

28- In expert systems, everything after the THEN in the IF-THEN rules is called ……..
A inference B premise C consequent D None of the above

29- ………………is defined by how long does it take to find a solution.

A Space complexity B Completeness C Optimality D Time complexity

30- …………………….is defined by how much memory is needed to perform the search
A Time complexity B Completeness C optimality D Space complexity

31- ………… tries to find good solutions within reasonable amount of time.
A Exact algorithm B Approximate algorithm
C adaptable algorithm D None of the above

32- ……………. is a model that captures the functional connections between inputs and
outputs of the system and is based on processes that are same as, or similar to, those
real-world-system and in the same material as the natural system
A Simulation B Emulation C Replication D None of the above

33- In PSO algorithm, the solution representing the best solution found ever is called ………..
A gBest B Particle fitness C pBest D
None of the above

34- Computer model that represents weather forecast is an example of …………..

A Simulation B Emulation C Replication D None of the above
35- ………………………is the ability of some unit to alter its longer-term behavior patterns in
response to challenges from its environment.
A. Interaction B. Emergence C. Adaptation D. Selection

36- ……………………is a mechanism in which communication between a number of units

results in a complex task being performed.
A Interaction B Adaptation C Selection D None of the above

37- ………………………..can be used to guide the player’s reasoning to explore the promising
moves while quickly disregarding the bad ones.
A Declarative knowledge B Procedural knowledge C Base knowledge D Meta-
knowledge

38- The set of states that a physical symbol system can be in is termed ………….
A. State B. State space C. Expression D. Process

39- The In …………any valid solution is as good as any other solution.

A. Combinational optimization problems B. Satisfaction problem
C. Optimization problem D. None of the above

40- When the correct classifications are known to the learner, this learning type is called …….
a. supervised b. unsupervised c. semi-supervised d. None of the above

41- A path within the solutions paths with the minimum cost is called ……..
a. solution b. Cost function c. Optimal solution d. None of the above
Essay Questions:

1- Optimality and completeness in measuring the performance of a search algorithm.

• Optimality: Does the strategy find the optimal solution?
• Completeness: Is the algorithm guaranteed to find a solution when there is one?

2- Construction and local search algorithm.

• Construction algorithm: involve building a possible solution step by step, at each step
picking the most possible candidate from the set of possibilities. Construction algorithms are
very quick and can produce good results, but they may completely miss many of the best
solutions.
• Local search algorithm: start with a possible solution, maybe generated by a construction
algorithm, and then play with it, checking if better solutions can be found by making small
alterations at various points.

3- Optimization and combinational optimization problems

• Optimization: find the best possible solution from among several alternatives.
• Combinational optimization: the solution will be the best possible combination of
elements of some given set.

4- Emergence and adaptation e. Uniform-cost search and beam search

• Emergence: A feature of some interactive systems: complex, ordered patterns of behavior,
which are a property of the system as a whole, arise from the simple, interactive behavior of
the system’s component parts.
• Adaptation: The ability of some unit to alter its longer-term behavior patterns in response
to challenges from its environment.

5- Uniform-cost search and beam search

• Uniformed-cost search: examine the shortest partial route first, this means, keep the
cost of all the paths on the agenda as uniform as possible to prevent the search from
drawn into a long route while there are shorter routes to be explored.
• Beam search: limiting the size of the agenda (keep only the most promising candidates).

6- For chess game, mention:

a. One possible representation
b. One state example
c. Constrain
d. Operator
a. Representation: 𝑜𝑛(𝑓𝑖𝑙𝑒, 𝑟𝑎𝑛𝑘, 𝑝𝑖𝑒𝑐𝑒 )
b. A state example: 𝑜𝑛(𝑐, 1, 𝑤(𝐾))
c. A constrain: a rook cannot leap over an occupied square by a piece of the same color.
d. An operator: moving a piece to another position.
7- Declarative knowledge and meta knowledge
• Declarative knowledge: can be explicitly state: my cup is empty.
• Meta knowledge: can be used to guide the player’s reasoning to explore the promising
moves while quickly disregarding the bad ones.

8- Intermediate state and goal state in symbolic AI problem.

• an intermediate state: is a state that is reached during the problem-solving process.
• a goal state: is the final state that the problem solver is trying to reach.

9- Compare and mention 2 examples between systematic and purposeful behavior.

• Purposeful behavior: is simply acting in such a way as to reach some clearly defined
objective, such as when a homing pigeon flies back to a fixed place, or an animal forage
for food.
examples: o Chimpanzees, use sticks to break open termite nests. o shorebird break open
shells by two means.
• Systematic behavior: follow a pattern or some fairly rigid process: organized hunting
behavior, systematic construction of nests and shelters, etc.
examples: o The paper wasp is a social insect that lives in large colonies and builds
elaborate nests

10- Declarative and base knowledge

• Declarative Knowledge: knowledge about facts and concepts. can be thought of
as the "what" of knowledge. Used to inform and guide.
• Base Knowledge: the basic skills and abilities needed to perform a task. base
knowledge is the "how". Used in problem solving.

11- Weak and strong AI

• Weak AI: AI Systems Designed to perform a specific task.
designed to solve narrow, specific problems and is often used in applications such
as voice recognition or image classification
• Strong AI: AI Systems that are capable of human like reasoning and intelligence
a long-term goal of AI research and involves creating machines that can think,
reason, and learn like humans.

12- In natural intelligence, Interaction with other agents and Interaction with the
environment.
• Interaction with other agents: the ability of an intelligent system to
communicate, collaborate, and negotiate with other agents to achieve a common
goal. It involves social skills, such as empathy, trust, and cooperation.
• Interaction with the environment: the ability of an intelligent system to perceive,
understand, and interact with its environment. It involves sensing the
environment, recognizing objects, and reacting to events.
13- Best-first and A* search algorithms.
• Best-first search: expands the most promising node in a search tree, based on a
h(n) that estimates the distance to the goal. It is a greedy algorithm that always
selects the best node to expand next.
• A* search: combines the best-first search with a cost function that considers both
the heuristic function and the actual cost of reaching a node.It is an informed
search algorithm.

14- Discriminate between satisfaction and optimization problems.

• satisfaction problem: aim to find a feasible solution. have a smaller solution
space.
• optimization problem: aim to find an optimal solution. involve searching through
a large space of possible solutions

15- Mention one constraint, goal, state, operator for the game tic tac toe- 3*3 case.(or XO)
• A constraint: A player cannot place their symbol on a cell that has already been
occupied by the other player's symbol.
• The goal: The goal of the game is for a player to get three of their symbols in a row,
either horizontally, vertically, or diagonally.
• A state: The state of the game at any given time is represented by the positions of the X
and O symbols on the 3x3 grid.
• An operator: The operator in this game is the player's move, which involves selecting an
empty cell on the grid and placing their symbol (X or O) in that cell.

16- Discriminate between replication and emulation in natural systems.

• Replication: is a model that captures the functional connections between inputs and
outputs of the system and is based on processes that are same as, or similar to, those of
the real-world-system (weather forecast)

• Emulation: is a model that captures the functional connections between inputs and
outputs of the system and is based on processes that are same as, or similar to, those of
the real-world-system and in the same material as the natural system (ex-primitive earth
model).

17- For the TSP problem mention an example of constrain, goal, solution.
• A constraint: each city may be visited once only.
• The goal: finding the shortest route that visits all cities.
• A solution: would be the ordered set [Exeter, Bristol, Manchester, Leeds, London]

18- Discriminate between time complexity and space complexity for a search algorithm.
• Time complexity: refers to the amount of time required to perform a search algorithm.
• space complexity: refers to the amount of memory required to perform the algorithm.
19- Describe using an example the meaning of uninformed search.
An example of uninformed search is depth-first search, which explores the search space
by visiting the deepest node in the current path before backtracking to explore other
paths. Uninformed search refers to a search algorithm that explores the search space
without using any prior knowledge or heuristic information.

20- Define and give an example of informed search.

Informed search: Strategies that know whether one goal-state is more promising than
another. Also known as the Heuristic Search. Heuristic means a way to embed the
knowledge we have in our problem-solving system. Examples: Best-First and A*

21- . Mention one definition for the term AI.

AI: is the ability of a computer or robot controlled by a computer to do tasks usually done
by a human.

22- Discriminate between simulation and replication in natural systems.

• Simulation: is a model that captures the functional connections between inputs and
outputs of the system (calculator)
• Replication: is a model that captures the functional connections between inputs and
outputs of the system and is based on processes that are same as, or similar to, those of
the real-world-system (weather forecast)

23- For the ‘missionaries and cannibals’ problem mention one goal, constrain, state, operator.
• Goal: Move all the missionaries and cannibals across the river.
• A constraint: Missionaries can never be outnumbered by cannibals on either side of
river, or else the missionaries are killed.
• A state: configuration of missionaries and cannibals and boat on each side of river.
• An operator: Move boat containing some set of occupants across the river (in either
direction) to the other side.

24- Compare between completeness and time complexity of a search algorithm.

• Completeness: Is the algorithm guaranteed to find a solution when there is one?
• Time complexity: How long does it take to find a solution?

25- Mention three contributing factors to Symbolic AI’s perception as a failure.

1. "Just programming": Some of AI’s successes have not been seen as successes but are
instead regarded as ‘just programming’.
2. AI’s realization in some areas has often failed to live up to the expectations.
3. Concealment: AI systems often take the form of specialized modules within large
software packages.
26- Briefly define the concept emergence.
Emergence: A feature of some interactive systems: complex, ordered patterns of
behavior, which are a property of the system as a whole, arise from the simple,
interactive behavior of the system’s component parts.

27- There are three desirable factors to be kept in mind while one designs a search algorithm
namely completeness, optimality and complexity define each in detail.
• Completeness: Is the algorithm guaranteed to find a solution when there is one?
• Optimality: Does the strategy find the optimal solution?
• Complexity: does the search process consume large amounts of either time or space in
finding a solution?

28- Can you deduce that: Macavity is responsible for the crime. ?
Let
𝐶 = cat fur was found at the scene of the crime,
𝐷 = dog fur was found at the scene of the crime,
𝑂 = officer Thompson had an allergy attack,
𝑀 = 𝑀𝑎𝑐𝑎𝑣𝑖𝑡𝑦 𝑖𝑠 responsible for the crime.

29- AI as a tool for acting rationally.

A rational agent: is one that acts so as to achieve the best outcome or, when there is
uncertainty, the best expected outcome.

30- Strong AI.

Strong AI: computer is not only a tool, rather, the appropriately programmed computer
really is a mind.

31- Simulation.
Simulation: is a model that captures the functional connections between inputs and
outputs of the system (calculator)

32- Expressions in PSSH .

Expressions: designate things in the world, which can be called objects.

33- Satisfaction problem.

Satisfaction problem: if any valid solution is as good as any other.

34- Mention 3 the main features of good representation?

• Coverage
• Parsimony (concise)
• Clarity
• Use of derived knowledge
• Specificity
35- Mention the main steps involved in the means-end analysis to reach the goal state.
• First, the goal conditions are added to the agenda.
• Planning then proceeds by popping the first condition from the agenda and, if it’s not
already true, finding an operator that can achieve it.
• The operator’s action is then pushed on the agenda, as is each of the operator’s
precondition terms.
• Achieving each of these preconditions requires its own sub-plan.
• The process continues until the only things left on the agenda are actions.
• If these are performed, in sequence, the goals will be achieved.

36- Define the word rule firing in expert system.

Rule firing: When a rule is used to prove its consequent.

37- Expanding is a main component in the uninformed search define it.

Expanding: the state is the process of applying operators on this state to generate new
states.

38- Differentiate between definitional and assertion semantic network.

• definitional networks: define concepts in term of other concepts.
• assertional networks: describe sets of assertions or propositions.

39- Compare and mention 2 examples between systematic and purposeful behavior.
• Purposeful behavior: is simply acting in such a way as to reach some clearly defined
objective, such as when a homing pigeon flies back to a fixed place, or an animal forage
for food.
examples: o Chimpanzees, use sticks to break open termite nests. o shorebird break open
shells by two means.
• Systematic behavior: follow a pattern or some fairly rigid process: organized hunting
behavior, systematic construction of nests and shelters, etc.
examples: o The paper wasp is a social insect that lives in large colonies and builds
elaborate nests.

40- Briefly define PSSH and mention its components.

PSSH: A physical symbol system has the necessary and sufficient means for general
intelligent action.
Its Components: • Symbolic representation • Symbolic reasoning.