Though local search algorithms are not systematic, key advantages would include __________ a) Less memory b) More time c) Finds a solution in large infinite space d) Less memory & Finds a solution in large infinite space

Though local search algorithms are not systematic, key advantages would include __________

a) Less memory

b) More time

c) Finds a solution in large infinite space

d) Less memory & Finds a solution in large infinite space
by

1 Answer

Answer :

d) Less memory & Finds a solution in large infinite space
by

Related questions

A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False

Description : A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False

Last Answer : a) True

The hardware features of LISP machines generally include __________ a) large memory and a high-speed processor b) letter-quality printers and 8-inch disk drives c) a mouse and a specialized keyboard d) large memory and a high-speed processor & a mouse and a specialized keyboard

Description : The hardware features of LISP machines generally include __________ a) large memory and a high-speed processor b) letter-quality printers and 8-inch disk drives c) a mouse and a specialized keyboard d) large memory and a high-speed processor & a mouse and a specialized keyboard

Last Answer : d) large memory and a high-speed processor & a mouse and a specialized keyboard

What are the main cons of hill-climbing search? a) Terminates at local optimum & Does not find optimum solution b) Terminates at global optimum & Does not find optimum solution c) Does not find optimum solution & Fail to find a solution

Description : What are the main cons of hill-climbing search? a) Terminates at local optimum & Does not find optimum solution b) Terminates at global optimum & Does not find optimum solution c) Does not find optimum solution & Fail to find a solution

Last Answer : a) Terminates at local optimum & Does not find optimum solution

General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms

Description : General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms

Last Answer : d) MIN/MAX Algorithms

Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned

Description : Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned

Last Answer : d) All of the mentioned

____________ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned

Description : ____________ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned

Last Answer : c) Fuzzy Set

______ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned

Description : ______ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned

Last Answer : c) Fuzzy Set

What are the 2 types of memory bounded heuristic algorithms?

Description : What are the 2 types of memory bounded heuristic algorithms?

Last Answer : i. Recursive Best First Search(RBFS)  ii. Memory bounded A*(MA*)

Which of the following(s) is/are found in Genetic Algorithms? (i) evolution (ii) selection (iii) reproduction (iv) mutation (a) i & ii only (b) i, ii & iii only (c) ii, iii & iv only

Description : Which of the following(s) is/are found in Genetic Algorithms? (i) evolution (ii) selection (iii) reproduction (iv) mutation (a) i & ii only (b) i, ii & iii only (c) ii, iii & iv only

Last Answer : (a) i & ii only

__________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search

Description : __________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search

Last Answer : b) Local Beam search

Search space A . The large set of candidate solutions possible for a problem B. The information stored in a database that can be, retrieved with a single query. C. Worth of the output of a machine learning program that makes it understandable for humans D . None of these

Description : Search space A . The large set of candidate solutions possible for a problem B. The information stored in a database that can be, retrieved with a single query. C. Worth of the output of a machine learning program that makes it understandable for humans D . None of these

Last Answer : A . The large set of candidate solutions possible for a problem

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

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

Last Answer : a) Depth-First Search

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

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

Last Answer : a) Depth-First Search

The initial state and the legal moves for each side define the __________ for the game. a) Search Tree b) Game Tree c) State Space Search d) Forest

Description :  The initial state and the legal moves for each side define the __________ for the game. a) Search Tree b) Game Tree c) State Space Search d) Forest

Last Answer : b) Game Tree

Write the time & space complexity associated with depth limited search.

Description : Write the time & space complexity associated with depth limited search.

Last Answer : Time complexity =O (bd) ,  b-branching factor,  d-depth of tree Space complexity=o (bl)

Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm d) Both RBFS & SMA*

Description : Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm d) Both RBFS & SMA*

Last Answer : d) Both RBFS & SMA*

What are taken into account of state-space search? a) Postconditions b) Preconditions c) Effects d) Both Preconditions & Effects

Description : What are taken into account of state-space search? a) Postconditions b) Preconditions c) Effects d) Both Preconditions & Effects

Last Answer : d) Both Preconditions & Effects

Modern NLP algorithms are based on machine learning, especially statistical machine learning. a) True b) False

Description : Modern NLP algorithms are based on machine learning, especially statistical machine learning. a) True b) False

Last Answer : a) True

Standard planning algorithms assumes environment to be ___________ a) Deterministic b) Fully observable c) Single agent d) Stochastic

Description : Standard planning algorithms assumes environment to be ___________ a) Deterministic b) Fully observable c) Single agent d) Stochastic

Last Answer : a) Deterministic

_____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic. a) BFS/DFS b) A* c) Graph-Plan d) Greedy

Description : _____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic. a) BFS/DFS b) A* c) Graph-Plan d) Greedy

Last Answer : c) Graph-Plan

Which can be adapted for planning algorithms? a) Most-constrained variable b) Most-constrained literal

Description : Which can be adapted for planning algorithms? a) Most-constrained variable b) Most-constrained literal

Last Answer : a) Most-constrained variable

Distinguish between A* and AO* algorithms?

Description : Distinguish between A* and AO* algorithms?

Last Answer : Ans:- A* algorithm:-  A* uses a best-first search and finds the least-cost path from a given initial node to one goal node (out of one or more possible goals).  It uses a distance-plus- ... node as SOLVED.  If starting node is SOLVED or value greater than FUTILITY, stop, else repeat from 2.

Core of soft Computing is A. Fuzzy Computing, Neural Computing, Genetic Algorithms B. Fuzzy Networks and Artificial Intelligence C. Artificial Intelligence and Neural Science D. Neural Science and Genetic Science

Description : Core of soft Computing is A. Fuzzy Computing, Neural Computing, Genetic Algorithms B. Fuzzy Networks and Artificial Intelligence C. Artificial Intelligence and Neural Science D. Neural Science and Genetic Science

Last Answer : D. Neural Science and Genetic Science

n(log n) is referred to A. A measure of the desired maximal complexity of data mining algorithms B. A database containing volatile data used for the daily operation of an organization C. Relational database management system D. None of these

Description : n(log n) is referred to A. A measure of the desired maximal complexity of data mining algorithms B. A database containing volatile data used for the daily operation of an organization C. Relational database management system D. None of these

Last Answer : A. A measure of the desired maximal complexity of data mining algorithms

Evolutionary computation is A . Combining different types of method or information B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution. C. Decision support systems that contain an information base filled with the knowledge of an expert formulated in terms of if-then rules. D . None of these

Description : Evolutionary computation is A . Combining different types of method or information B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution. C. ... the knowledge of an expert formulated in terms of if-then rules. D . None of these

Last Answer : B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution.

Expert systems A . Combining different types of method or information B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution C. an information base filled with the knowledge of an expert formulated in terms of if-then rules D . None of these

Description : Expert systems A . Combining different types of method or information B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution C. an information base ... the knowledge of an expert formulated in terms of if-then rules D . None of these

Last Answer : C. an information base filled with the knowledge of an expert formulated in terms of if-then rules

What are the algorithms to have efficient parsing?

Description : What are the algorithms to have efficient parsing?

Last Answer : i. Left to right parsing algorithm  ii. Chart Parsing algorithm.  iii. Left corner parsing

What is Genetic Algorithms?

Description : What is Genetic Algorithms?

Last Answer : Genetic Algorithm is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state.

Deep learning is a subfield of machine learning where concerned algorithms are inspired by the structured and function of the brain called _____. A. Machine learning B. Artificial neural networks C. Deep learning D. Robotics

Description : Deep learning is a subfield of machine learning where concerned algorithms are inspired by the structured and function of the brain called _____. A. Machine learning B. Artificial neural networks C. Deep learning D. Robotics

Last Answer : B. Artificial neural networks 

_______________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. a) Constraints Satisfaction Problems b) Uninformed Search Problems c) Local Search Problems d) All of the mentioned

Description : _______________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. a) Constraints Satisfaction Problems b) Uninformed Search Problems c) Local Search Problems d) All of the mentioned

Last Answer : a) Constraints Satisfaction Problems

Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next. a) Needy local search b) Heuristic local search c) Greedy local search d) Optimal local search

Description : Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next. a) Needy local search b) Heuristic local search c) Greedy local search d) Optimal local search

Last Answer : c) Greedy local search

What is the meaning for greedy local search?

Description : What is the meaning for greedy local search?

Last Answer :  It goals (picks) a good neighbor state without thinking ahead about where to go next. 

What is local search?

Description : What is local search?

Last Answer : It operates using a single current state rather than multiple paths and generally moves only to neighbors of that state.

______ is a branch of computer science which deals with helping machines finds solutions to complex problems in a more human like fashions A. Artificial Intelligence B. Internet of Things C. Embedded System D. Cyber Security

Description : ______ is a branch of computer science which deals with helping machines finds solutions to complex problems in a more human like fashions A. Artificial Intelligence B. Internet of Things C. Embedded System D. Cyber Security

Last Answer : A. Artificial Intelligence 

The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.) a) O(bd+1) and O(bd+1) b) O(b2) and O(d2) c) O(d2) and O(b2) d) O(d2) and O(d2)

Description : The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.) a) O(bd+1) and O(bd+1) b) O(b2) and O(d2) c) O(d2) and O(b2) d) O(d2) and O(d2)

Last Answer : a) O(bd+1) and O(bd+1)

What is the advantage of memory bounded search techniques?

Description : What is the advantage of memory bounded search techniques?

Last Answer : We can reduce space requirements of A* with memory bounded algorithm such as IDA* & SMA*. 

In which of the following situations might a blind search be acceptable? a) Real life situation b) Complex game c) Small search space d) All of the mentioned

Description : In which of the following situations might a blind search be acceptable? a) Real life situation b) Complex game c) Small search space d) All of the mentioned

Last Answer : c) Small search space

Which of the following search belongs to totally ordered plan search? a) Forward state-space search b) Hill-climbing search c) Depth-first search d) Breadth-first search

Description : Which of the following search belongs to totally ordered plan search? a) Forward state-space search b) Hill-climbing search c) Depth-first search d) Breadth-first search

Last Answer : a) Forward state-space search

What is the other name of the backward state-space search? a) Regression planning b) Progression planning c) State planning d) Test planning

Description : What is the other name of the backward state-space search? a) Regression planning b) Progression planning c) State planning d) Test planning

Last Answer : a) Regression planning

What is the main advantage of backward state-space search? a) Cost b) Actions c) Relevant actions d) All of the mentioned

Description : What is the main advantage of backward state-space search? a) Cost b) Actions c) Relevant actions d) All of the mentioned

Last Answer : c) Relevant actions

How many states are available in state-space search? a) 1 b) 2 c) 3 d) 4

Description : How many states are available in state-space search? a) 1 b) 2 c) 3 d) 4

Last Answer : d) 4

What is the other name for forward state-space search? a) Progression planning b) Regression planning c) Test planning d) None of the mentioned

Description : What is the other name for forward state-space search? a) Progression planning b) Regression planning c) Test planning d) None of the mentioned

Last Answer : a) Progression planning

How many ways are available to solve the state-space search? a) 1 b) 2 c) 3 d) 4

Description : How many ways are available to solve the state-space search? a) 1 b) 2 c) 3 d) 4

Last Answer : b) 2

Which is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search

Description : Which is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search

Last Answer : b) State-space search

Which method is used to search better by learning? a) Best-first search b) Depth-first search c) Metalevel state space d) None of the mentioned

Description : Which method is used to search better by learning? a) Best-first search b) Depth-first search c) Metalevel state space d) None of the mentioned

Last Answer : c) Metalevel state space

Which search uses only the linear space for searching? a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned

Description : Which search uses only the linear space for searching? a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned

Last Answer : b) Recursive best-first search

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

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

Last Answer : d) O(bm)

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

Description : 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

Last Answer : a) Initial state

In which of the following situations might a blind search be acceptable? a) real-life situation b) complex game c) small search space d) all of the mentioned

Description : In which of the following situations might a blind search be acceptable? a) real-life situation b) complex game c) small search space d) all of the mentioned

Last Answer : c) small search space

Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk service are not influenced by file allocation method. (C) Caching the directories and index blocks in main memory can also help in reducing disk arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Description : Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk ... arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Last Answer : (B) The number of requests for disk service are not influenced by file allocation method.