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 : Which of the following algorithm is generally used CSP search algorithm? a) Breadth-first search algorithm b) Depth-first search algorithm c) Hill-climbing search algorithm d) None of the mentioned
Last Answer : b) Depth-first search algorithm
Description : The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign. a) Forward search b) Backtrack search c) Hill algorithm d) Reverse-Down-Hill search
Last Answer : b) Backtrack search
Description : Constraint Propagation technique actually modifies the CSP problem. a) True b) False
Last Answer : a) True
Description : Which of the Following problems can be modeled as CSP? a) 8-Puzzle problem b) 8-Queen problem c) Map coloring problem d) All of the mentioned
Last Answer : d) All of the mentioned
Description : What among the following constitutes to the incremental formulation of CSP? a) Path cost b) Goal cost c) Successor function d) All of the mentioned
Description : Define CSP.
Last Answer : Constraint Satisfaction problem (CSP) is defined by a set of variables X1,X2,…Xn and set of constraints C1,C2,…Cm.
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 : To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s. a) Stacks b) Queue c) BST (Binary Search Tree) d) Planning Graphs
Last Answer : d) Planning Graphs
Description : Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned
Last Answer : b) Graphplan
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
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
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
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)
Description : The component of an ICAI (Intelligent Computer Assisted Instruction) presenting information to the student is the? a) Student model b) Problem solving expertise c) Tutoring module d) All of the mentioned
Last Answer : c) Tutoring module
Description : __________ algorithm translates a planning problem in to prepositional axioms. a) GraphPlan b) SatPlan c) Greedy d) None of the mentioned
Last Answer : b) SatPlan
Description : Planning problem can be described as a propositional logic. a) True b) False
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 : 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 : Which kind of problem are suitable for planning graph? a) Propositional planning problem b) Planning problem c) Action problem d) None of the mentioned
Last Answer : a) Propositional planning problem
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 process by which the brain incrementally 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 : b) Partial order planning
Description : What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem? a) Success b) Error c) Compilation d) Termination
Last Answer : d) Termination
Description : Which cannot be taken as advantage for totally ordered plan search? a) Composition b) State search c) Problem decomposition d) None of the mentioned
Last Answer : c) Problem decomposition
Description : A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned
Description : Which search uses the problem specific knowledge beyond the definition of the problem? a) Informed search b) Depth-first search c) Breadth-first search d) Uninformed search
Last Answer : a) Informed search
Description : Which algorithm is used to solve any kind of problem? a) Breadth-first algorithm b) Tree algorithm c) Bidirectional search algorithm d) None of the mentioned
Last Answer : b) Tree algorithm
Description : The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. a) Finding shortest path between a source and a destination b) Travelling ... c) Map coloring problem d) Depth first search traversal on a given map represented as a graph
Last Answer : b) Travelling Salesman problem
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
Description : A search algorithm takes _________ as an input and returns ________ as an output. a) Input, output b) Problem, solution c) Solution, problem d) Parameters, sequence of actions
Last Answer : b) Problem, solution
Description : The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the ... . This process of looking for such a sequence is called Search. a) True b) False
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
Description : A ____ is a rule of thumb, strategy, trick, simplification, or any other kind of device which drastically limits search for solutions in large problem spaces. A. Heuristic B. Critical C. Value based D. Analytical
Last Answer : A. Heuristic
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 : Consider the following statements: In the bar chart planning 1. Interdependence of the operations cannot be portrayed. 2. Progress of work can be measured. 3. Spare time of the activities can be determined. 4. ... and 4 are correct (C) 2, 3 and 4 are correct (D) 1, 2 and 4 are correct
Last Answer : (B) 1 and 4 are correct
Description : What is meant by simulated annealing in artificial intelligence? a) Returns an optimal solution when there is a proper cooling schedule b) Returns an optimal solution when there is no proper cooling ... not return an optimal solution when there is a proper cooling schedule d) None of the mentioned
Last Answer : a) Returns an optimal solution when there is a proper cooling schedule
Description : Subsequent to preparing ____, the team plans the project schedule and budget
Last Answer : Ans. Work Breakdown Structure
Description : Gantt chart (or Bar chart) is helpful in (A) Efficient utilisation of manpower and machines (B) Preparing production schedule (C) Efficient despatching of products (D) Inventory control
Last Answer : (B) Preparing production schedule
Description : Perceptron is A. General class of approaches to a problem. B. Performing several computations simultaneously C. Structures in a database those are statistically relevant D. Simple forerunner of modern neural networks, without hidden layers
Last Answer : D. Simple forerunner of modern neural networks, without hidden layers
Description : Why are linearly separable problems of interest of neural network researchers? a) Because they are the only class of problem that network can solve successfully b) Because they are the only ... mathematical functions that are continue d) Because they are the only mathematical functions you can draw
Last Answer : b) Because they are the only class of problem that Perceptron can solve successfully
Description : One the main drawback of this type of planning system is that it requires a lot of computational powers at each node. a) True b) False
Description : How do I kick an IP/MAC address from a network with backtrack 4.
Last Answer : answer:Can't really answer this question without more information about your network, but basically you need to set netfilter to drop all packets going to / coming from the unauthorized host on the gateway ... offer the option to block by MAC addresses. Or you could just ping-flood them, I guess
Description : BackTrack Linux, what am I doing wrong?
Last Answer : This is probably occurring because Qt3 is installed to a different path from the one the configure' script is expecting. I advise you to open up the file and look for the section where it checks for ... Then you can edit the configure' file to reflect the true path, and the error should go away.
Description : Connecting to WiFi network in Backtrack 4?
Last Answer : answer:Hmm. Any chance I could see what the spam was mods?
Description : Need help logging in to backtrack 4 from a thumb drive?
Last Answer : You should be able to type startx to start the X server. That should bring you to a desktop, if you have a GUI installed. Be very careful though - the root user can change just about anything on the ... , I'm just making a few assumptions given the question. If startx doesn't work, let us know.
Description : Is the brain in th CSP system?
Last Answer : What is the answer ?
Description : Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion. a) Evaluation function returning lowest evaluation b) Evaluation function ... c) Evaluation function returning lowest & highest evaluation d) None of them is applicable
Last Answer : a) Evaluation function returning lowest evaluation
Description : An AI system developed by Daniel Bobrow to read and solve algebra word problems. a) SHRDLU b) SIMD c) BACON d) STUDENT
Last Answer : d) STUDENT
Description : Translate the following statement into FOL. “For every a, if a is a PhD student, then a has a master degree” a) ∀ a PhD(a) -> Master(a) b) ∃ a PhD(a) -> Master(a) c) A is true, B is true d) A is false, B is false
Last Answer : a) ∀ a PhD(a) -> Master(a)
Description : An Artificial Intelligence system developed by Terry A. Winograd to permit an interactive dialogue about a domain he called blocks-world. a) SHRDLU b) SIMD c) BACON d) STUDENT
Last Answer : a) SHRDLU