1. : Which of the following are the two key characteristics of the Genetic Algorithm?
(A) Crossover techniques and Fitness function
(B) Random mutation and Crossover techniques
(C) Random mutation and Individuals among the population
(D) Random mutation and Fitness function
2. : Searching by query on the Internet is the use of which of the following type of agent.
(A) Offline agent
(B) Online agent
(C) Both Offline and Online agent
(D) Goal-Based and Online agent
3. : In many problems the path to the goal is irrelevant, this class of problems can be answered using which of the following Techniques?
(A) Informed Search
(B) Uninformed Search
(C) Local Search
(D) both a and b
4. : A loop that constantly moves in the direction of growing value that is uphill, ……. is an algorithm.
(A) Up-Hill Search
(B) Hill-Climbing
(C) Hill algorithm
(D) Reverse-Down-Hill search
5. : Hill-Climbing algorithm terminates in which of the following conditions?
(A) Stopping criterion met
(B) Global Min/Max is achieved
(C) No neighbor has a higher value
(D) All of these
6. : Hill climbing is commonly known as ………search because it grabs a suitable neighbor state without being thoughtful onward about where to go next.
(A) Needy local search
(B) Heuristic local search
(C) Greedy local search
(D) Optimal local search
7. : Which of the following algorithm keeps track of k states instead of just one.
(A) Hill-Climbing search
(B) Local Beam search
(C) Stochastic hill-climbing search
(D) Random restart hill-climbing search
8. : Which of the following are the main disadvantages of a hill-climbing search?
(A) Stops at local optimum and don’t find the optimum solution
(B) Stops at global optimum and don’t find the optimum solution
(C) Don’t find the optimum solution and Flop to search for a solution
(D) Fail to find a solution
9. : Hill-Climbing technique stuck for which of the following reasons?
(A) Local maxima
(B) Ridges
(C) Plateaux
(D) All of these
10. : Local search algorithms are not systematic, the main pros include which of the followings?
(A) Less memory
(B) More time
(C) Search a solution in a big infinite space
(D) Less memory and search a solution in a big infinite space