# Ait

60 Questions | Total Attempts: 14  Settings  Related Topics
• 1.
Which of the following describe the Overfitting problem?
• A.

a. The learner have excellent performance on the training set, but low performance on new data

• B.

B. The learner have excellent performance on the training set, and excellent performance on new data

• C.

c. The learner have low performance on the training set, but excellent performance on new data

• D.

d. The learner have low performance on the training set, and low performance on new data

• 2.
In backtracking search, the most-constrained-variable and most-constraining variable strategies are used to
• A.

A. decide what order should the values be tried for a variable

• B.

b. perform forward checking

• C.

c. detect inevitable failure early

• D.

d. decide which variable should be assigned next

• 3.
Which of the following representations is Conjunctive Normal Form? (symbol ^ represents AND, symbol – represent NOT)
• A.

A. P => Q

• B.

B. – P V (Q ^ R)

• C.

c. P ^ Q Correct

• D.

d. P ^ (Q => R)

• 4.
What is the main difference between breadth-first search and depth-first search?
• A.

A. The initial state

• B.

b. The solution

• C.

C. The goal state

• D.

D. The order of node expansion

• 5.
Which of the following sentences is equivalent to the sentence P => Q?
• A.

a. Q

• B.

B. – P => – Q

• C.

c. Q => P

• D.

d. – P V Q

• 6.
An agent perceives its environment through which of the following components?
• A.

a. agent program

• B.

b. sensors

• C.

C. agent function

• D.

d. actuators

• 7.
Assume that the following heuristic functions are admissible for a given problem, which function among them is best for search?
• A.

a. h( n) = (10 - n) ^ 2

• B.

B. h( n) = 1

• C.

C. h( n) = 2

• D.

d. h( n) = (10 - n)^2 + 2

• 8.
The value of a heuristic function of a node is
• A.

a. estimated total cost of path through that node to goal

• B.

b. estimated cost so far to reach that node

• C.

c. real cost so far to reach that node

• D.

d. estimated cost from that node to goal

• 9.
Which of the followig FOL sentences most matches the meaning of "Some people don't fly"?
• A.

A. ThereExist x People(x) ^ – Flies(x)

• B.

b. ThereExist x People(x) => – Flies(x)

• C.

c. ThereExist x People(x) V – Flies(x)

• D.

d. ThereExist x – Flies(x) => People(x)

• 10.
In problem-solving agents, after the first action is performed, the agent is able to reach to the final goal without considering the percept in each step.
• A.

True

• B.

False

• 11.
What is the main difference between breadth-first search and depth-first search?
• A.

a. The initial state

• B.

b. The goal state

• C.

C. The solution

• D.

D. The order of node expansion

• 12.
The input of an agent function is:
• A.

a. actions

• B.

b. environment

• C.

c. performance measure

• D.

d. percepts

• 13.
According to the content of the course, Genetic Algorithms can be used in which of the following problems?
• A.

a. Vacuum-cleaner problem

• B.

b. Timetabling problem

• C.

C. Tic-tac-toe problem

• D.

d. Path-finding problem

• 14.
An agent perceives its environment through which of the following components?
• A.

a. sensors

• B.

b. actuators

• C.

c. agent program

• D.

d. agent function

• 15.
Which of the followig FOL sentences most matches the meaning of "Some people don't fly"?
• A.

a. ThereExist x People(x) ^ – Flies(x)

• B.

B. ThereExist x People(x) V – Flies(x)

• C.

ThereExist x People(x) => – Flies(x)

• D.

D. ThereExist x – Flies(x) => People(x)

• 16.
In backtracking search, which of the following method can be used to detect inevitable failure early
• A.

a. Least-constraing-value

• B.

b. Most-constraining-variable

• C.

C. Forward-checking

• D.

d. Most-constrained-variable

• 17.
Why do we use alpha-beta pruning algorithm?
• A.

a. It can be implemented by Java

• B.

b. It can solve the tic-tac-toe game problem

• C.

c. It takes less time to make the optimal decisions.

• D.

d. It improves the final result

• 18.
Which of the following functions is admissible heuristic function for any problem?
• A.

a. h( n) = 2n

• B.

B. h( n) = 0

• C.

C. h( n) = n

• D.

d. h( n) = 2

• 19.
What is a solution in problem-solving agents?
• A.

a. A sequence of actions leading from the initial state to a goal state

• B.

b. A set of actions leading from the initial state to a goal state

• C.

c. A sequence of states from the initial state to a goal state

• D.

d. A sequence of percepts leading from the initial state to a goal state

• 20.
Which of the following representations is Conjunctive Normal Form? (symbol ^ represents AND, symbol – represent NOT)
• A.

a. P ^ Q

• B.

b. – P V (Q ^ R)

• C.

c. P ^ (Q => R)

• D.

d. P => Q

• 21.
Which of the following describe the Overfitting problem?
• A.

D. The learner have excellent performance on the training set, but low performance on new data

• B.

C. The learner have low performance on the training set, and low performance on new data

• C.

b. The learner have low performance on the training set, but excellent performance on new data

• D.

A. The learner have excellent performance on the training set, and excellent performance on new data

• 22.
According to the content of the course, Genetic Algorithms can be used in which of the following problems?
• A.

a. Tic-tac-toe problem

• B.

b. Timetabling problem

• C.

c. Vacuum-cleaner problem

• D.

d. Path-finding problem

• 23.
The input of an agent function is:
• A.

a. percepts

• B.

b. environment

• C.

c. actions

• D.

d. performance measure

• 24.
Which of the following sentences is equivalent to the sentence P => Q?
• A.

a. – P => – Q

• B.

b. Q

• C.

c. Q => P

• D.

d. – P V Q

• 25.
Which of the followig FOL sentences most matches the meaning of "Squares adjacent to wumpus are smelly"?
• A.

a. ForAll S1 Smelly(S1) ThereExist S2 Adjacent(S1,S2) ^ Wumpus(S2)

• B.

B. ThereExist S1 Smelly(S1) ThereExist S2 Adjacent(S1,S2) ^ Wumpus(S2)

• C.

C. ThereExist S1 Smelly(S1) ForAll S2 Adjacent(S1,S2) ^ Wumpus(S2)

• D.

d. ForAll S1 Smelly(S1) ForAll S2 Adjacent(S1,S2) ^ Wumpus(S2)

• 26.
The value of a heuristic function of a node is
• A.

a. estimated cost from that node to goal

• B.

B. estimated cost so far to reach that node

• C.

c. real cost so far to reach that node

• D.

D. estimated total cost of path through that node to goal

• 27.
Which of the followig FOL sentences most matches the meaning of "Some people don't fly"?
• A.

a. ThereExist x People(x) => – Flies(x

• B.

b. ThereExist x People(x) V – Flies(x)

• C.

c. ThereExist x – Flies(x) => People(x)

• D.

d. ThereExist x People(x) ^ – Flies(x)

• 28.
Compare to tree search algorithms, local search algorithms use
• A.

a. more memory

• B.

b. less memory

• C.

c. more disk space

• D.

d. less disk space

• 29.
Which of the following sentences is equivalent to the sentence P => Q?
• A.

a. – P => – Q

• B.

b. Q => P

• C.

c. Q

• D.

d. – P V Q

• 30.
The input of an agent function is:
• A.

a. environment

• B.

b. actions

• C.

C. performance measure

• D.

d. percepts

• 31.
Which of the following describe the Overfitting problem?
• A.

A. The learner have low performance on the training set, and low performance on new data

• B.

b. The learner have low performance on the training set, but excellent performance on new data

• C.

c. The learner have excellent performance on the training set, and excellent performance on new data

• D.

d. The learner have excellent performance on the training set, but low performance on new data

• 32.
Which of the following representations is Conjunctive Normal Form? (symbol ^ represents AND, symbol – represent NOT)
• A.

a. P => Q

• B.

b. P ^ Q

• C.

c. P ^ (Q => R)

• D.

d. – P V (Q ^ R)

• 33.
Assume that the following heuristic functions are admissible for a given problem, which function among them is best for search?
• A.

a. h( n) = 1

• B.

b. h( n) = (10 - n) ^ 2

• C.

c. h( n) = (10 - n)^2 + 2

• D.

d. h( n) = 2

• 34.
An agent perceives its environment through which of the following components?
• A.

a. agent program

• B.

b. agent function

• C.

c. sensors

• D.

d. actuators

• 35.
In backtracking search, which of the following method can be used to detect inevitable failure early
• A.

A. Least-constraing-value

• B.

b. Most-constraining-variable

• C.

C. Forward-checking

• D.

D. Most-constrained-variable

• 36.
Which of the followig FOL sentences most matches the meaning of "Some people don't fly"?
• A.

a. ThereExist x People(x) V – Flies(x)

• B.

b. ThereExist x – Flies(x) => People(x)

• C.

c. ThereExist x People(x) => – Flies(x)

• D.

d. ThereExist x People(x) ^ – Flies(x)

• 37.
Which of the following describe the Overfitting problem?
• A.

A. The learner have low performance on the training set, but excellent performance on new data

• B.

b. The learner have low performance on the training set, and low performance on new data

• C.

c. The learner have excellent performance on the training set, but low performance on new data

• D.

d. The learner have excellent performance on the training set, and excellent performance on new data

• 38.
Why do we use alpha-beta pruning algorithm?
• A.

A. It can be implemented by Java

• B.

b. It can solve the tic-tac-toe game problem

• C.

c. It takes less time to make the optimal decisions.

• D.

d. It improves the final resul

• 39.
Which of the following functions is admissible heuristic function for any problem?
• A.

a. h( n) = 2n

• B.

b. h( n) = 0

• C.

c. h( n) = n

• D.

d. h( n) = 2

• 40.
In backtracking search, the most-constrained-variable and most-constraining variable strategies are used to
• A.

a. decide what order should the values be tried for a variable

• B.

B. perform forward checking

• C.

c. detect inevitable failure early

• D.

d. decide which variable should be assigned next

• 41.
Which of the following describe the Overfitting problem?
• A.

A. The learner have low performance on the training set, and low performance on new data

• B.

B. The learner have excellent performance on the training set, but low performance on new data

• C.

c. The learner have excellent performance on the training set, and excellent performance on new data

• D.

d. The learner have low performance on the training set, but excellent performance on new data

• 42.
Which of the followig FOL sentences most matches the meaning of "Squares adjacent to wumpus are smelly"?
• A.

A. ForAll S1 Smelly(S1) ThereExist S2 Adjacent(S1,S2) ^ Wumpus(S2)

• B.

b. ThereExist S1 Smelly(S1) ForAll S2 Adjacent(S1,S2) ^ Wumpus(S2)

• C.

c. ForAll S1 Smelly(S1) ForAll S2 Adjacent(S1,S2) ^ Wumpus(S2)

• D.

d. ThereExist S1 Smelly(S1) ThereExist S2 Adjacent(S1,S2) ^ Wumpus(S2)

• 43.
Why do we use alpha-beta pruning algorithm?
• A.

a. It can solve the tic-tac-toe game problem

• B.

b. It can be implemented by Java

• C.

c. It improves the final result

• D.

D. It takes less time to make the optimal decisions

• 44.
Which of the following representations is Conjunctive Normal Form? (symbol ^ represents AND, symbol – represent NOT)
• A.

a. P ^ Q

• B.

b. P => Q

• C.

c. – P V (Q ^ R)

• D.

d. P ^ (Q => R)

• 45.
What is the main difference between breadth-first search and depth-first search?
• A.

a. The initial state

• B.

B. The goal state

• C.

c. The solution

• D.

D. The order of node expansion

• 46.
What is a solution in problem-solving agents?
• A.

A. A sequence of actions leading from the initial state to a goal state

• B.

b. A sequence of states from the initial state to a goal state

• C.

c. A sequence of percepts leading from the initial state to a goal state

• D.

d. A set of actions leading from the initial state to a goal state

• 47.
According to the content of the course, Genetic Algorithms can be used in which of the following problems?
• A.

a. Tic-tac-toe problem

• B.

b. Vacuum-cleaner problem

• C.

c. Path-finding problem

• D.

d. Timetabling problem

• 48.
In problem-solving agents, after the first action is performed, the agent is able to reach to the final goal without considering the percept in each step
• A.

True

• B.

False

• 49.
Which of the following describe the Overfitting problem?
• A.

A. The learner have low performance on the training set, and low performance on new data

• B.

b. The learner have excellent performance on the training set, but low performance on new data

• C.

c. The learner have excellent performance on the training set, and excellent performance on new data

• D.

d. The learner have low performance on the training set, but excellent performance on new data

• 50.
Why do we use alpha-beta pruning algorithm?
• A.

a. It can solve the tic-tac-toe game problem

• B.

B. It improves the final result

• C.

c. It takes less time to make the optimal decisions.

• D.

d. It can be implemented by Java

• 51.
Compare to tree search algorithms, local search algorithms use
• A.

a. less disk space

• B.

B. more memory

• C.

C. more disk space

• D.

d. less memory

• 52.
The value of a heuristic function of a node is
• A.

A. real cost so far to reach that node

• B.

b. estimated cost so far to reach that node

• C.

c. estimated total cost of path through that node to goal

• D.

D. estimated cost from that node to goal

• 53.
An agent perceives its environment through which of the following components?
• A.

a. agent program

• B.

B. sensors

• C.

c. actuators

• D.

d. agent function

• 54.
What is a solution in problem-solving agents?
• A.

a. A sequence of states from the initial state to a goal state

• B.

b. A sequence of percepts leading from the initial state to a goal state

• C.

c. A set of actions leading from the initial state to a goal state

• D.

d. A sequence of actions leading from the initial state to a goal state

• 55.
Which of the followig FOL sentences most matches the meaning of "Squares adjacent to wumpus are smelly"?
• A.

a. ForAll S1 Smelly(S1) ForAll S2 Adjacent(S1,S2) ^ Wumpus(S2)

• B.

b. ThereExist S1 Smelly(S1) ForAll S2 Adjacent(S1,S2) ^ Wumpus(S2)

• C.

C. ForAll S1 Smelly(S1) ThereExist S2 Adjacent(S1,S2) ^ Wumpus(S2)

• D.

d. ThereExist S1 Smelly(S1) ThereExist S2 Adjacent(S1,S2) ^ Wumpus(S2)

• 56.
In backtracking search, which of the following method can be used to detect inevitable failure early
• A.

a. Forward-checking

• B.

b. Most-constrained-variable

• C.

C. Most-constraining-variable

• D.

d. Least-constraing-value

• 57.
An agent perceives its environment through which of the following components?
• A.

a. sensors

• B.

b. agent program

• C.

c. actuators

• D.

d. agent function

• 58.
Which of the following describe the Overfitting problem?
• A.

A. The learner have excellent performance on the training set, but low performance on new data

• B.

B. The learner have low performance on the training set, but excellent performance on new data

• C.

c. The learner have low performance on the training set, and low performance on new data

• D.

d. The learner have excellent performance on the training set, and excellent performance on new data

• 59.
Assume that the following heuristic functions are admissible for a given problem, which function among them is best for search?
• A.

a. h( n) = (10 - n) ^ 2

• B.

b. h( n) = (10 - n)^2 + 2

• C.

c. h( n) = 1

• D.

d. h( n) = 2

• 60.
According to the content of the course, Genetic Algorithms can be used in which of the following problems?
• A.

a. Vacuum-cleaner problem

• B.

b. Path-finding problem

• C.

c. Timetabling problem

• D.

D. Tic-tac-toe problem