0% found this document useful (0 votes)
13 views7 pages

AI MID-1 Bits AI

66w

Uploaded by

karamteja99
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
13 views7 pages

AI MID-1 Bits AI

66w

Uploaded by

karamteja99
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

MOTHER TERESA INSTITUTE OF SCIENCE & TECHNOLOGY

SATHUPALLY, KHAMMAM DIST, TELANGANA.

Subject: Artificial Intelligence Branch: AI&ML


Examination: BITS Year & Sem : III-II

1. Problem Solving by Search-I introduces students to the foundational concepts of:

a) Robotics

b) Machine Learning

c) Artificial Intelligence

d) Natural Language Processing

2. In AI, ____________ are systems that perceive their environment and take actions to
maximize a goal.

a) Robots

b) Sensors

c) Agents

d) Drones

3. Problem Solving by Search-II focuses on the intricacies of problem-solving and:

a) Decision making

b) Data analysis

c) Algorithm design

d) Solution finding

4. Problem-Solving Agents in AI aim to:

a) Identify problems

b) Define problems

c) Solve problems

d) Create problems
5. Searching for Solutions in AI involves exploring possible paths to achieve a:

a) Known goal

b) Random goal

c) Desired goal

d) Variable goal

6. Uninformed Search Strategies like Breadth-first search and Depth-first search focus on:

a) Exploring all paths

b) Exploring paths randomly

c) Systematic exploration

d) Exploring the shortest path

7. Breadth-first search explores nodes level by level in a ____________ manner.

a) Depth-first

b) Breadth-wise

c) Random

d) Informed

8. In adversarial search, what is the purpose of alpha-beta pruning?

a) To maximize the alpha value

b) To minimize the beta value

c) To reduce the number of nodes evaluated

d) To prioritize the maximizer player

9. What kind of problems are suitable for constraint satisfaction problems (CSPs)?

a) Problems with no constraints

b) Problems with only binary constraints

c) Problems with no variables

d) Problems with constraints on variable assignments

10. Which logical operators are commonly used in propositional logic?


a) AND, OR, IF

b) XOR, NOT, THEN

c) AND, OR, NOT

d) AND, XOR, THEN

11. In the context of knowledge-based agents, what is a knowledge base?

a) A database of general knowledge

b) A collection of beliefs and facts

c) A set of logical operators

d) A type of reasoning algorithm

12. What kind of environment does the Wumpus World represent?

a) A world with a friendly monster

b) A grid-based environment with hazards

c) A virtual reality game

d) A simple puzzle game

13. Which technique is commonly used to solve constraint satisfaction problems (CSPs)
when constraints are violated?

a) Backtracking

b) Alpha-beta pruning

c) Hill climbing

d) Propositional logic

14. In propositional logic, what does the NOT operator do?

a) Combines two propositions

b) Negates a proposition

c) Implies a proposition

d) Has no effect on propositions

15. What type of search is used in adversarial games to minimize the opponent's score while
maximizing one's own score?

a) Breadth-first search
b) Depth-first search

c) Minimax search

d) A* search

16. Which of the following is not a valid inference technique in propositional logic?

a) Resolution

b) Modus Ponens

c) Hill climbing

d) Modus Tollens

17. What is the primary goal of an agent in the Wumpus World?

a) Collect gold

b) Avoid the wumpus

c) Solve a mathematical puzzle

d) Find the exit

18. What is the primary purpose of First-Order Logic (FOL)?

a) To represent knowledge using natural language

b) To represent and reason about statements involving objects and relationships

c) To perform arithmetic calculations

d) To simulate physical systems

19. What are the basic components of FOL sentences?

a) Constants, variables, predicates, and logical connectives

b) Constants, functions, and arithmetic operators

c) Variables, events, and propositions

d) Predicates, conditions, and mathematical symbols

20. Which logical quantifiers are used in First-Order Logic (FOL) to express universal and
existential quantification?

a) ∆ and ∑

b) ∀ (for universal) and ∃ (for existential)


c) ∨ and ∧

d) ¬ and ⇔

ANSWER
1. c) Artificial Intelligence
2. c) Agents
3. d) Solution finding
4. c) Solve problems
5. c) Desired goal
6. c) Systematic exploration
7. b) Breadth-wise
8. c) To reduce the number of nodes evaluated
9. d) Problems with constraints on variable assignments
10. c) AND, OR, NOT
11. b) A collection of beliefs and facts
12. b) A grid-based environment with hazards
13. a) Backtracking
14. b) Negates a proposition
15. c) Minimax search
16. c) Hill climbing
17. b) Avoid the wumpus
18. b) To represent and reason about statements involving objects and relationships.

20. b) ∀ (for universal) and ∃ (for existential).


19. a) Constants, variables, predicates, and logical connectives.

1. Iterative deepening Depth-first search combines the advantages of ____________ and


depth-first search.

2. Bidirectional search simultaneously explores from the ____________ and goal states.

3. Informed Search Strategies use ____________ to guide exploration.

4. Greedy best-first search prioritizes nodes based on ____________ estimates.

5. A* search considers both ____________ and cost to make informed decisions.

6. Heuristic Functions provide ____________ about the remaining cost to reach the goal.

7. Beyond Classical Search, Hill-climbing search aims to improve the ____________ of the
current state.
8. Simulated annealing search involves accepting ____________ moves with a certain
probability.

9. Local Search in Continuous Spaces explores ____________ solutions for optimization


problems.

10. Searching with Non-Deterministic Actions involves dealing with ____________


outcomes.

11. Searching with Partial Observations considers that the agent's perception might be
____________.

12. Model-based agents primarily focus on ________ reasoning.

13. Propositional logic uses logical operators like AND, OR, and ________.

14. Backtracking is a technique used to explore all possible solutions systematically in


________ problems.

15. In propositional logic, the logical NOT is represented as ________.

16. The primary objective of the minimax algorithm in adversarial games is to maximize the
________ score.

17. Local search algorithms for CSPs are often used for problems with many variables and
________.

18. The syntax of FOL includes elements like variables, constants, predicates, functions, and
____________.

19. FOL allows for the representation of complex relationships and ____________ about
objects in a structured manner.

20. FOL provides a means to formalize statements about the world in a way that is suitable
for automated ____________ and reasoning.

1. breadth-first

2. start and goal

3. heuristics

4. heuristic

5. heuristics

6. estimates

7. quality
8. worse

9. continuous

10. uncertain

11. incomplete

12.reasoning under uncertainty

13.NOT

14.constraint satisfaction

15.¬

16.player's

17.constraints

18.Quantifiers

19.Facts

20.Reasoning

You might also like