Artificial intelligence

 Q. is the full form of “AI”?

a) Artificially Intelligent
b) Artificial Intelligence
c) Artificially Intelligence
d) Advanced Intelligence

Q.Which of the following is a component of Artificial Intelligence?

a) Learning
b) Training
c) Designing
d) Puzzling

Q. _______ number of informed search method are there in Artificial Intelligence.

a) 4

b) 3

c) 2

Q.Which of the following are the approaches to Artificial Intelligence?

a) Applied approach

b) Strong approach

c) Weak approach

d) All of the mentioned

Q.Which of the following is an expansion of Artificial Intelligence application?

a) Game Playing
b) Planning and Scheduling
c) Diagnosis
d) All of the mentioned

Q.What is state space?
a) The whole problem
b) Your Definition to a problem
c) Problem you design
d) Representing your problem with variable and parameter

Q.A problem in a search space is defined by one of these state.
a) Initial state
b) Last state
c) Intermediate state
d) All of the mentioned



Q.A search algorithm takes _________ as an input and returns ________ as an output.
a) Input, output
b) Problem, solution
c) Solution, problem
d) Parameters, sequence of actions

Q.A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions.
a) True
b) False

Q.. A production rule consists of ____________
a) A set of Rule
b) A sequence of steps
c) Set of Rule & sequence of steps
d) Arbitrary representation to problem

Q.Which search method takes less memory?
a) Depth-First Search
b) Breadth-First search
c) Linear Search
d) Optimal search

Q.Which search strategy is also called as blind search?
a) Uninformed search
b) Informed search
c) Simple reflex search
d) All of the mentioned

Q.How many types are available in uninformed search method?
a) 3
b) 4
c) 5
d) 6

Q.Which search is implemented with an empty first-in-first-out queue?
a) Depth-first search
b) Breadth-first search
c) Bidirectional search
d) None of the mentioned

Q.What is the space complexity of Depth-first search?
a) O(b)
b) O(bl)
c) O(m)
d) O(bm)

Q.Which search algorithm imposes a fixed depth limit on nodes?
a) Depth-limited search
b) Depth-first search
c) Iterative deepening search
d) Bidirectional search

Q.Which search implements stack operation for searching the states?

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

d) None of the mentioned

Q.Which of the following is/are Uninformed Search technique/techniques?

a) Breadth First Search (BFS)
b) Depth First Search (DFS)
c) Bidirectional Search
d) All of the mentioned

Q.Which data structure conveniently used to implement BFS?
a) Stacks
b) Queues
c) Priority Queues
d) All of the mentioned

Q.Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node.

a)True
b) False

Q.DFS is ______ efficient and BFS is __________ efficient.

a) Space, Time
b) Time, Space
c) Time, Time
d) Space, Space