Interested to Buy Any Domain ? << Click Here >> for more details...
- AI Algorithms (69)
- AI Natural Language Processing (85)
- AI Knowledge Representation Reasoning (4)
- AI Robotics (155)
- AI Computer Vision (2)
- AI Neural Networks (45)
- AI Fuzzy Logic (21)
- AI Games (8)
- AI Languages (5)
- AI Tools (11)
- AI Machine Learning (659)
- Data Science (671)
- Data Mining (120)
- AI Deep Learning (111)
- Generative AI (153)
- AI Frameworks Libraries (197)
- AI Ethics Safety (100)
- AI Applications (427)
- AI General (188)
- AI AllOther (5)
Which environment is called as semidynamic? a) Environment does not change with the passage of time b) Agent performance changes c) Environment will be changed d) Both a & b
Where does the performance measure is included? a) Rational agent b) Task environment c) Actuators d) Sensor
The main task of a problem-solving agent is a) Solve the given problem and reach to goal b) To find out which sequence of action will get it to the goal state c) Both a) and b) d) Neither a) nor b)
. 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
The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the best sequence. This process of looking for such a sequence is called Search. State True or False a) True b) False
A problem in a search space Is defined by, a) Initial state b) Goal test c) Intermediate states d) All of the above
The Set of actions for a problem in a state space is formulated by a ___________. a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned
A problem solving approach works well for a) 8-Puzzle problem b) 8-queen problem c) Finding a optimal path from a given source to a destination d) Mars Hover (Robot Navigation)
Optimality of BFS is a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) Both a & c
How many successors are generated in backtracking search? a) 1 b) 2 c) 3 d) 4
In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False
What is the other name of informed search strategy? a) Simple search b) Heuristic search c) Online search d) None of the mentioned
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)
