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
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.
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
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
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.
Description : What are the two main features of Genetic Algorithm? a) Fitness function & Crossover techniques b) Crossover techniques & Random mutation c) Individuals among the population & Random mutation d) Random mutation & Fitness function
Last Answer : a) Fitness function & Crossover techniques
Description : How the new states are generated in genetic algorithm? a) Composition b) Mutation c) Cross-over d) Both Mutation & Cross-over
Last Answer : d) Both Mutation & Cross-over
Description : What is the significance of mutation and repair of mutations to evolution of sexual reproduction?
Last Answer : meow
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
Description : A change in genetic constitution, which arises suddenly and not to segregation and recombination of genes in sexual reproduction is called as: a. Hybridization b. Bud variation c. Mutation d. Non of them
Last Answer : Mutation
Description : _______________ acts to inhibit reproductive isolation. A) Mutation B) Natural selection C) Genetic drift D) Gene flow
Last Answer : D) Gene flow
Description : Modern NLP algorithms are based on machine learning, especially statistical machine learning. a) True b) False
Last Answer : a) True
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
Description : Standard planning algorithms assumes environment to be ___________ a) Deterministic b) Fully observable c) Single agent d) Stochastic
Last Answer : a) Deterministic
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
Description : Which can be adapted for planning algorithms? a) Most-constrained variable b) Most-constrained literal
Last Answer : a) Most-constrained variable
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
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
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.
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
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
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
Description : What are the 2 types of memory bounded heuristic algorithms?
Last Answer : i. Recursive Best First Search(RBFS) ii. Memory bounded A*(MA*)
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
Description : The major phenomenon responsible for micro evolution and mega evolution a. Genetic drift b. Adaptative radiation c. Natural selection d. None of the above
Last Answer : c. Natural selection
Description : he major phenomenon responsible for micro evolution and mega evolution a. Genetic drift b. Adaptative radiation c. Natural selection d. None of the above
Description : In genetic engineering, a DNA segment (gene) of interest, is transferred to the host cell through a vector. Consider the following four agents (i-iv) in this regard and select the correct option about which one or more of these ... ii) and (iv) (b) (i) only (c) (i) and (iii) (d) (ii) and (iv)
Last Answer : (d) (ii) and (iv)
Description : Which of the following algorithms has lowest worst case time complexity? a) Insertion sort b) Selection sort c) Quick sort d) Heap sort
Last Answer : d) Heap sort
Description : Which of the following algorithms sort n integers, having the range 0 to (n2 -1), in ascending order in O(n) time ? (A) Selection sort (B) Bubble sort (C) Radix sort (D) Insertion sort
Last Answer : (C) Radix sort
Description : Which of the following is the correct sequence of events in the origin of life? I. Formation of protobionts II. Synthesis of organic monomers III. Synthesis of organic polymers IV. Formation of DNA-based genetic systems (a) I, II, III, IV (b) I, III, II, IV (c) II, III, I, IV (d) II, III, IV, I
Last Answer : c) II, III, I, IV
Description : Idempotency law is I. P Ú P = P. II. P Ù P = P. III. P + P = P. a) Only (I) b) Only (II) c) Only (III) d) Both (I) and (II)
Last Answer : a) Only (I)
Description : Knowledge may be I. Declarative. II. Procedural. III. Non-procedural. a) Only (I) b) Only (II) c) Only (III) d) Both (I) and (II)
Last Answer : d) Both (I) and (II)
Description : What are the advantages of neural networks over conventional computers? (i) They have the ability to learn by example (ii) They are more fault tolerant (iii)They are more suited for real time operation due to their high ... true b) (i) and (iii) are true c) Only (i) d) All of the mentioned
Description : Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move. a) True b) False
Description : Which of the following is true? Single layer associative neural networks do not have the ability to: (i) perform pattern recognition (ii) find the parity of a picture (iii)determine whether two or more shapes in ... ) are true b) (ii) is true c) All of the mentioned d) None of the mentioned
Last Answer : a) (ii) and (iii) are true
Description : Which of the following is true? (i) On average, neural networks have higher computational rates than conventional computers. (ii) Neural networks learn by example. (iii) Neural networks mimic the way the human brain works. ... ) are true c) (i), (ii) and (iii) are true d) None of the mentioned
Last Answer : a) All of the mentioned are true
Description : Which of the following is true? Single layer associative neural networks do not have the ability to: (i) perform pattern recognition (ii) find the parity of a picture (iii)determine whether two or more shapes in a ... ) are true b) (ii) is true c) All of the mentioned d) None of the mentioned
Description : Which of the following is true for neural networks? (i) The training time depends on the size of the network. (ii) Neural networks can be simulated on a conventional computer. (iii) Artificial neurons are identical in ... b) (ii) is true c) (i) and (ii) are true d) None of the mentioned
Last Answer : c) (i) and (ii) are true
Description : Which of the following is true? (i) On average, neural networks have higher computational rates than conventional computers. (ii) Neural networks learn by example. (iii) Neural networks mimic the way the human brain works ... ) are true c) (i), (ii) and (iii) are true d) None of the mentioned
Description : Choose the option that lists the set of statements that are NOT TRUE according to the poem. I. The tiger is in quiet rage because he has been imprisoned. II. A tiger is caged and kept in the zoo. III. He criticises the brilliant stars ... edge. (a) II & V (b) I, IV & V (c) I, II & III (d) III & V
Last Answer : (d) III & V
Description : Hogo de Vries gave his mutation theory on organic evolution while working on `:`
Last Answer : Hogo de Vries gave his mutation theory on organic evolution while working on `:` A. ... Drosophila melanogaster C. Pisum stivum D. Althena rosea
Description : Mutation theory to explain mechanism of evolution was given by Hugo de Vries and he experimented on the :
Last Answer : Mutation theory to explain mechanism of evolution was given by Hugo de Vries and he experimented on ... Fruit fly C. China rose D. Evening primerose
Description : What is a mutation and how does it relate to evolution?
Last Answer : A mutation is any change in the DNA. Mutations provide the genetic variation that evolution by natural selection needs to select from.
Description : Which of the following process is not takes place in evolution of plants? (A)Crossing over (B) Mutation (C) Linkage (D) Coupling
Last Answer : (C) Linkage
Description : A genetic algorithm (or GA) 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. a) True b) False
Description : Three main basic features involved in characterizing membership function are A. Intution, Inference, Rank Ordering B. Fuzzy Algorithm, Neural network, Genetic Algorithm C. Core, Support , Boundary D. Weighted Average, center of Sums, Median
Last Answer : C. Core, Support , Boundary
Description : The new varieties of plants are produced by (a) introduction and mutation (b) selection and introduction (c) selection and hybridization (d) mutation and selection.
Last Answer : (c) selection and hybridization
Description : Industrial melanism is an example of (a) mutation (b) Neo-Lamarckism (c) Neo-Darwinism (d) natural selection.
Last Answer : (d) natural selection.