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

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
by

1 Answer

Answer :

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

Related questions

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

Shaping teaching techniques to fit the learning patterns of individual students is the goal of __________ a) decision support b) automatic programming c) intelligent computer-assisted instruction d) expert systems

Description : Shaping teaching techniques to fit the learning patterns of individual students is the goal of __________ a) decision support b) automatic programming c) intelligent computer-assisted instruction d) expert systems

Last Answer : c) intelligent computer-assisted instruction

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 

Genetic Algorithm are a part of A . Evolutionary Computing B. inspired by Darwin's theory about evolution - "survival of the fittest" C. are adaptive heuristic search algorithm based on the evolutionary ideas of natural selection and genetics D . All of the above

Description : Genetic Algorithm are a part of A . Evolutionary Computing B. inspired by Darwin's theory about evolution - "survival of the fittest" C. are adaptive heuristic search algorithm based on the evolutionary ideas of natural selection and genetics D . All of the above

Last Answer : D . All of the above

The minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The recursion proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree as the recursion unwinds. a) True b) False

Description : The minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The ... are backed up through the tree as the recursion unwinds. a) True b) False

Last Answer : a) True

Which of the following is an extension of the semantic network? a) Expert Systems b) Rule Based Expert Systems c) Decision Tree Based networks d) Partitioned Networks

Description : Which of the following is an extension of the semantic network? a) Expert Systems b) Rule Based Expert Systems c) Decision Tree Based networks d) Partitioned Networks

Last Answer : d) Partitioned Networks

Which of the following are the applications of Expert systems? a) Disease Diagnosis b) Planning and Scheduling c) Decision making d) All of the mentioned

Description : Which of the following are the applications of Expert systems? a) Disease Diagnosis b) Planning and Scheduling c) Decision making d) All of the mentioned

Last Answer : d) All of the mentioned

A Personal Consultant knowledge base contain information in the form of __________ a) parameters b) contexts c) production rules d) all of the mentioned

Description : A Personal Consultant knowledge base contain information in the form of __________ a) parameters b) contexts c) production rules d) all of the mentioned

Last Answer : d) all of the mentioned

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

Aristotle’s theory of syllogism and Descartes and kant’s critic of pure reasoning made knowledge on _____. A. Logic B. Computation logic C. Cognition logic D. All of above

Description : Aristotle’s theory of syllogism and Descartes and kant’s critic of pure reasoning made knowledge on _____. A. Logic B. Computation logic C. Cognition logic D. All of above 

Last Answer : A. Logic 

Geographic Information Systems can assist the location decision by a. ion by a. automating cen ating center of gr ter of gravity pro avity problems b. computerizing factor rating analysis computerizing factor rating analysis c. combining geography with demographic analysis d. updating updating transportation transportation method solutions e. giving good Internet Internet placement placement for virtual virtual storefronts

Description : Geographic Information Systems can assist the location decision by a. ion by a. automating cen ating center of gr ter of gravity pro avity problems b. computerizing factor ... transportation method solutions e. giving good Internet Internet placement placement for virtual virtual storefronts

Last Answer : c. combining geography with demographic analysis

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

Which of the following is the model used for learning? a) Decision trees b) Neural networks c) Propositional and FOL rules d) All of the mentioned

Description : Which of the following is the model used for learning? a) Decision trees b) Neural networks c) Propositional and FOL rules d) All of the mentioned

Last Answer : d) All of the mentioned

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

It has been seen that the students lose much of their learning during summer vacation, which one of following shows the least depreciation over the summer months? Options: A) Arithmetic computation B) Arithmetic reasoning C) Historical dates and places D) Rules of punctuation and grammar

Description : It has been seen that the students lose much of their learning during summer vacation, which one of following shows the least depreciation over the summer months? Options: A) Arithmetic computation B) Arithmetic reasoning C) Historical dates and places D) Rules of punctuation and grammar

Last Answer : B) Arithmetic reasoning 

A knowledge engineer has the job of extracting knowledge from an expert and building the expert system knowledge base. a) True b) False

Description : A knowledge engineer has the job of extracting knowledge from an expert and building the expert system knowledge base. a) True b) False

Last Answer : a) True

Which of the following, is a component of an expert system? a) inference engine b) knowledge base c) user interface d) all of the mentioned

Description : Which of the following, is a component of an expert system? a) inference engine b) knowledge base c) user interface d) all of the mentioned

Last Answer : d) all of the mentioned

The explanation facility of an expert system may be used to ____________ a) construct a diagnostic model b) expedite the debugging process c) explain the system’s reasoning process d) explain the system’s reasoning process & expedite the debugging process

Description : The explanation facility of an expert system may be used to ____________ a) construct a diagnostic model b) expedite the debugging process c) explain the system’s reasoning process d) explain the system’s reasoning process & expedite the debugging process

Last Answer : d) explain the system’s reasoning process & expedite the debugging process

________ is/are the well known Expert System/s for medical diagnosis systems. a) MYSIN b) CADUCEUS c) DENDRAL d) SMH.PAL

Description : ________ is/are the well known Expert System/s for medical diagnosis systems. a) MYSIN b) CADUCEUS c) DENDRAL d) SMH.PAL

Last Answer : a) MYSIN

The explanation facility of an expert system may be used to __________ a) construct a diagnostic model b) expedite the debugging process c) explain the system’s reasoning process d) expedite the debugging process & explain the system’s reasoning process

Description : The explanation facility of an expert system may be used to __________ a) construct a diagnostic model b) expedite the debugging process c) explain the system’s reasoning process d) expedite the debugging process & explain the system’s reasoning process

Last Answer : d) expedite the debugging process & explain the system’s reasoning process

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 search agent operates by interleaving computation and action? a) Offline search b) Online search c) Breadth-first search d) Depth-first search

Description : Which search agent operates by interleaving computation and action? a) Offline search b) Online search c) Breadth-first search d) Depth-first search

Last Answer : b) Online search

Charles Babbage and Boole who demonstrate the power of _______ A. Logic B. Computation logic C. Cognition logic D. All of above

Description : Charles Babbage and Boole who demonstrate the power of _______ A. Logic B. Computation logic C. Cognition logic D. All of above

Last Answer : B. Computation logic 

The core components are constituents of AI are derived from A. Concept of logic B. Cognition C. Computation D. All of above

Description : The core components are constituents of AI are derived from A. Concept of logic B. Cognition C. Computation D. All of above

Last Answer : D. All of above 

An expert system differs from a database program in that only an expert system _____________ a) contains declarative knowledge b) contains procedural knowledge c) features the retrieval of stored information d) expects users to draw their own conclusions

Description : An expert system differs from a database program in that only an expert system _____________ a) contains declarative knowledge b) contains procedural knowledge c) features the retrieval of stored information d) expects users to draw their own conclusions

Last Answer : b) contains procedural knowledge

What is the name of the computer program that contains the distilled knowledge of an expert? a) Database management system b) Management information System c) Expert system d) Artificial intelligence

Description : What is the name of the computer program that contains the distilled knowledge of an expert? a) Database management system b) Management information System c) Expert system d) Artificial intelligence

Last Answer : c) Expert system

Generality is the measure of _____________ a) Ease with which the method can be adapted to different domains of application b) The average time required to construct the target knowledge structures from some specified initial structures c) A learning system to function with unreliable feedback and with a variety of training examples d) The overall power of the system

Description : Generality is the measure of _____________ a) Ease with which the method can be adapted to different domains of application b) The average time required to construct the target knowledge structures ... unreliable feedback and with a variety of training examples d) The overall power of the system

Last Answer : a) Ease with which the method can be adapted to different domains of application

What is the name of the computer program that simulates the thought processes of human beings? a) Human logic b) Expert reason c) Expert system d) Personal information

Description : What is the name of the computer program that simulates the thought processes of human beings? a) Human logic b) Expert reason c) Expert system d) Personal information

Last Answer : c) Expert system

Which modifies the performance element so that it makes better decision? a) Performance element b) Changing element c) Learning element d) None of the mentioned

Description : Which modifies the performance element so that it makes better decision? a) Performance element b) Changing element c) Learning element d) None of the mentioned

Last Answer : c) Learning element

What can operate over the joint state space? a) Decision-making algorithm b) Learning algorithm c) Complex algorithm d) Both Decision-making & Learning algorithm

Description : What can operate over the joint state space? a) Decision-making algorithm b) Learning algorithm c) Complex algorithm d) Both Decision-making & Learning algorithm

Last Answer : d) Both Decision-making & Learning algorithm

Which modifies the performance element so that it makes better decision? a) Performance element b) Changing element c) Learning element d) None of the mentioned

Description : Which modifies the performance element so that it makes better decision? a) Performance element b) Changing element c) Learning element d) None of the mentioned

Last Answer : c) Learning element

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

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

Last Answer : c) Successor function, which takes current action and returns next immediate state

Define Artificial Intelligence formulated by Haugeland.

Description : Define Artificial Intelligence formulated by Haugeland.

Last Answer : The exciting new effort to make computers think machines with minds in the full and literal sense. 

____________ 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

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

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

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

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

Last Answer : d) Less memory & Finds a solution in large infinite space

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

______ 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 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.

Which of the following is the component of learning system? a) Goal b) Model c) Learning rules d) All of the mentioned

Description : Which of the following is the component of learning system? a) Goal b) Model c) Learning rules d) All of the mentioned

Last Answer : d) All of the mentioned

Which of the following is the component of learning system? a) Goal b) Model c) Learning rules d) All of the mentioned

Description : Which of the following is the component of learning system? a) Goal b) Model c) Learning rules d) All of the mentioned

Last Answer : d) All of the mentioned

This strategy is an expression of desired strategic direction deliberately formulated & planned in terms of resource allocation, control systems, organizational structure etc. A. Intended strategy B. Realized strategy C. Emergent strategy D. None of these options are valid.

Description : This strategy is an expression of desired strategic direction deliberately formulated & planned in terms of resource allocation, control systems, organizational structure etc. A. Intended strategy B. Realized strategy C. Emergent strategy D. None of these options are valid.

Last Answer : Intended strategy

This strategy is an expression of desired strategic direction deliberately formulated & planned in terms of resource allocation, control systems, organizational structure etc. A. Intended strategy B. Realized strategy C. Emergent strategy D. None of these options are valid.

Description : This strategy is an expression of desired strategic direction deliberately formulated & planned in terms of resource allocation, control systems, organizational structure etc. A. Intended strategy B. Realized strategy C. Emergent strategy D. None of these options are valid.

Last Answer : Intended strategy

Computational learning theory analyzes the sample complexity and computational complexity of a) Unsupervised Learning b) Inductive learning c) Forced based learning d) Weak learning e) Knowledge based learning

Description : Computational learning theory analyzes the sample complexity and computational complexity of a) Unsupervised Learning b) Inductive learning c) Forced based learning d) Weak learning e) Knowledge based learning

Last Answer : b) Inductive learning