Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


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


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More AI Robotics Interview Questions

What are difficulties in nlu?

0 Answers  


for online search in ‘artificial intelligence’ which search agent operates by interleaving computation and action?

0 Answers  


How to send information from the robot sensors to the robot controllers?

0 Answers  


What is the use of the microcontroller in the robotics?

0 Answers  


Which depends on the percepts and actions available to the agent? a) Agent b) Sensor c) Design problem d) None of the mentioned

0 Answers  


Which functions are used as preferences over state history? a) Award b) Reward c) Explicit d) Implicit

0 Answers  


What is the function of the third component of the planning system?

0 Answers  


For building a bayes model how many terms are required?

0 Answers  


What kind of behavior does the stochastic environment posses? a) Local b) Deterministic c) Ratioanl d) Primary

0 Answers  


What is a robot locomotion?

0 Answers  


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

0 Answers  


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

0 Answers  


Categories
  • AI Algorithms Interview Questions AI Algorithms (74)
  • AI Natural Language Processing Interview Questions AI Natural Language Processing (96)
  • AI Knowledge Representation Reasoning Interview Questions AI Knowledge Representation Reasoning (12)
  • AI Robotics Interview Questions AI Robotics (183)
  • AI Computer Vision Interview Questions AI Computer Vision (13)
  • AI Neural Networks Interview Questions AI Neural Networks (66)
  • AI Fuzzy Logic Interview Questions AI Fuzzy Logic (31)
  • AI Games Interview Questions AI Games (8)
  • AI Languages Interview Questions AI Languages (141)
  • AI Tools Interview Questions AI Tools (11)
  • AI Machine Learning Interview Questions AI Machine Learning (659)
  • Data Science Interview Questions Data Science (671)
  • Data Mining Interview Questions Data Mining (120)
  • AI Deep Learning Interview Questions AI Deep Learning (111)
  • Generative AI Interview Questions Generative AI (153)
  • AI Frameworks Libraries Interview Questions AI Frameworks Libraries (197)
  • AI Ethics Safety Interview Questions AI Ethics Safety (100)
  • AI Applications Interview Questions AI Applications (427)
  • AI General Interview Questions AI General (197)
  • AI AllOther Interview Questions AI AllOther (6)