clara


{ City } hyderabad
< Country > india
* Profession * student
User No # 61953
Total Questions Posted # 169
Total Answers Posted # 38

Total Answers Posted for My Questions # 81
Total Views for My Questions # 611324

Users Marked my Answers as Correct # 243
Users Marked my Answers as Wrong # 27
Questions / { clara }
Questions Answers Category Views Company eMail

 What among the following constitutes to the incremental formulation of CSP? a) Path cost b) Goal cost c) Successor function d) Objective function e) Initial state

AI Robotics 1789

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

1 AI Robotics 3188

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

AI Robotics 1823

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

1 AI Robotics 2017

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 called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure. State whether True or False. a) True b) False

AI Robotics 1385

Consider a problem of preparing a schedule for a class of student. This problem is a type of a) Search Problem b) Backtrack Problem c) CSP d) Planning Problem

AI Robotics 3303

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) DFS/BFS Search Algorithms

AI Robotics 1764

Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size. a) P complete b) NP complete c) NP hard d) Domain dependent

AI Robotics 1944

 ____________ 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 above

1 AI Robotics 3127

Fuzzy logic is a form of a) Two-valued logic b) Crisp set logic c) Many-valued logic d) Binary set logic

AI Fuzzy Logic 1800

Traditional set theory is also known as Crisp Set theory. a) True b) False

1 AI Fuzzy Logic 7321

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

1 AI Fuzzy Logic 7271

Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth. a) True b) False

1 AI Fuzzy Logic 3171

How many types of random variables are available? a) 1 b) 2 c) 3 d) 4

AI Fuzzy Logic 1313

The room temperature is hot. Here the hot (use of linguistic variable is used) can be represented by _______ . a) Fuzzy Set b) Crisp Set

1 AI Fuzzy Logic 4159


Prev    1   2   3   4   5   6   7   8    [9]   10   11   12    Next