Description : A perceptron is a ______________ a) Feed-forward neural network b) Backpropagation algorithm c) Backtracking algorithm d) Feed Forward-backward algorithm
Last Answer : a) Feed-forward neural network
Description : The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is ... also possible to go all the way to set of variable that caused failure. a) True b) False
Last Answer : a) True
Description : How many successors are generated in backtracking search? a) 1 b) 2 c) 3 d) 4
Last Answer : a) 1
Description : Define Backtracking search.
Last Answer : The variant of depth first search called backtracking search. Only one successor is generated at a time rather than all successor, partially expanded node remembers which successor generate next is called Backtracking search.
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
Description : The company that grew out of research at the MIT AI lab is ____________ a) AI corp b) LMI c) Symbolics d) Both LMI & Symbolics
Last Answer : d) Both LMI & Symbolics
Description : The process by which the brain orders actions needed to complete a specific task is referred as ____________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning
Last Answer : d) Both Planning problem & Partial order planning
Description : Web Crawler is a/an ____________ a) Intelligent goal-based agent b) Problem-solving agent
Last Answer : a) Intelligent goal-based agent
Description : Dijkstra’s algorithm is based on (1) Divide and conquer paradigm (2) Dynamic Programming (3) Greedy Approach (4) Backtracking paradigm
Last Answer : 3
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
Description : The truth values of traditional set theory is ____________ and that of fuzzy set is __________ a) Either 0 or 1, between 0 & 1 b) Between 0 & 1, either 0 or 1 c) Between 0 & 1, between 0 & 1 d) Either 0 or 1, either 0 or 1
Last Answer : a) Either 0 or 1, between 0 & 1
Description : A production rule consists of ____________ a) A set of Rule b) A sequence of steps c) Set of Rule & sequence of steps d) Arbitrary representation to problem
Last Answer : c) Set of Rule & sequence of steps
Description : The truth values of traditional set theory is ____________ and that of fuzzy set is __________ a) Either 0 or 1, between 0 & 1 b) Between 0 & 1, either 0 or 1 c) Between 0 & 1, between 0
Description : . In an Unsupervised learning ____________ a) Specific output values are given b) Specific output values are not given c) No specific Inputs are given d) Both inputs and outputs are given
Last Answer : b) Specific output values are not given
Description : Searching using query on Internet is, use of ___________ type of agent. a) Offline agent b) Online agent c) Both Offline & Online agent d) Goal Based & Online agent
Last Answer : d) Goal Based & Online agent
Description : The cray X-MP, IBM 3090 and connection machine can be characterized as ____________ a) SISD b) SIMD c) MISD d) MIMD
Last Answer : b) SIMD
Description : The Newell and Simon program that proved theorems of Principal Mathematical was ____________ a) Elementary Perceiver b) General Problem Solver c) Logic Theorist d) Boolean Algebra
Last Answer : c) Logic Theorist
Description : The primary method that people use to sense their environment is ____________ a) reading b) writing c) speaking d) seeing
Last Answer : d) seeing
Description : An algorithm is complete if ____________ a) It terminates with a solution when one exists b) It starts with a solution c) It does not terminate with a solution d) It has a loop
Last Answer : a) It terminates with a solution when one exists
Description : For speech understanding systems to gain widespread acceptance in office automation, they must feature ____________ a) speaker independence b) speaker dependence c) isolated word recognition d) all of the mentioned
Last Answer : a) speaker independence
Description : The characteristics of the computer system capable of thinking, reasoning and learning are known as ____________ a) machine intelligence b) human intelligence c) artificial intelligence d) virtual intelligence
Last Answer : c) artificial intelligence
Description : Special programs that assist programmers are called ____________ a) heuristic processors b) symbolic programmers c) intelligent programming tools d) program recognizers
Last Answer : c) intelligent programming tools
Description : If a robot can alter its own trajectory in response to external conditions, it is considered to be ____________ a) intelligent b) mobile c) open loop d) non-servo
Last Answer : a) intelligent
Description : Prior to the invention of time-sharing, the prevalent method of computer access was ____________ a) batch processing b) telecommunication c) remote access d) all of the mentioned
Last Answer : a) batch processing
Description : Many words have more than one meaning; we have to select the meaning which makes the most sense in context. This can be resolved by ____________ a) Fuzzy Logic b) Word Sense Disambiguation c) Shallow Semantic Analysis d) All of the mentioned
Last Answer : b) Word Sense Disambiguation
Description : ____________ is measured by the number of mental structures we use, how abstract they are, and how elaborate they interact to shape our perceptions. a) intrapersonal structure b) perceptual set c) self-justification d) none of the mentioned
Last Answer : d) none of the mentioned
Description : The process by which you become aware of messages through your sense is called ____________ a) Organization b) Sensation c) Interpretation-Evaluation d) Perception
Last Answer : d) Perception
Description : Decision Nodes are represented by ____________ a) Disks b) Squares c) Circles d) Triangles
Last Answer : b) Squares
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 : ____________ planning allows the agent to take advice from the domain designer in the form of decomposition rules. a) GraphPlan b) Hierarchical task network (HTN) c) SatPlan d) None of the mentioned
Last Answer : b) Hierarchical task network (HTN)
Description : The famous spare tire problem or Scheduling classes for bunch of students or Air cargo transport are the best example of ____________ a) Planning problem b) Partial Order planning problem c) Total order planning d) None of the mentioned
Last Answer : a) Planning problem
Description : A constructive approach in which no commitment is made unless it is necessary to do so, is ____________ a) Least commitment approach b) Most commitment approach c) Nonlinear planning d) Opportunistic planning
Last Answer : a) Least commitment approach
Description : A plan that describe how to take actions in levels of increasing refinement and specificity is ____________ a) Problem solving b) Planning c) Non-hierarchical plan d) Hierarchical plan
Last Answer : d) Hierarchical plan
Description : The statement comprising the limitations of FOL is/are ____________ a) Expressiveness b) Formalizing Natural Languages c) Many-sorted Logic d) All of the mentioned
Last Answer : d) All of the mentioned
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 : Adversarial search problems uses ____________ a) Competitive Environment b) Cooperative Environment c) Neither Competitive nor Cooperative Environment d) Only Competitive and Cooperative Environment
Last Answer : a) Competitive Environment
Description : General games involves ____________ a) Single-agent b) Multi-agent c) Neither Single-agent nor Multi-agent d) Only Single-agent and Multi-agent
Last Answer : d) Only Single-agent and Multi-agent
Description : ____________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment. a) Static CSPs b) Dynamic CSPs c) Flexible CSPs d) None of the mentioned
Last Answer : b) Dynamic CSPs
Description : To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ____________ a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals
Last Answer : a) Forward Searching
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
Description : The Task Environment of an agent consists of ____________ a) Sensors b) Actuators c) Performance Measures d) All of the mentioned
Description : Agents behavior can be best described by ____________ a) Perception sequence b) Agent function c) Sensors and Actuators d) Environment in which agent is performing
Last Answer : b) Agent function
Description : What are the two major aspects which combines AI Planning problem? a) Search & Logic b) Logic & Knowledge Based Systems c) FOL & Logic d) Knowledge Based Systems
Last Answer : a) Search & Logic
Description : Merge sort uses a) Divide-and-conquer b) Backtracking c) Heuristic approach d) Greedy approach
Last Answer : a) Divide-and-conquer
Description : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method
Last Answer : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method
Description : The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.
Last Answer : (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm.
Description : What is difference between recursion and tail recursion?
Last Answer : Tail recursion is a compiler optimisation. When the final statement of a function is a recursive call into the same function, the compiler can eliminate that call completely. Consider the (simplified) ... instance. That being the case, instead of calling the function a second time and thus crea
Description : What is recursion?
Last Answer : Recursion is when a method calls itself.
Description : Define what is recursion?
Last Answer : C language a function may call another function. When a function calls itself, it is referred to as recursive call and the process is known as recursion. C provides very good facilities for recursion.
Description : What is the difference between recursion and iteration?
Last Answer : A: Recursion is usually slower than iteration due to overhead of maintaining stack, whereas, Iteration does not use stack so it's faster than recursion. Recursion uses more memory than ... whereas, Iteration consume less memory. Recursion makes code smaller, whereas, Iteration makes code longer.