-
AI Algorithms (74) - AI Language Processing (96)
- AI Knowledge Representation (12)
- AI Robotics (183)
- AI Recognition (13)
- AI Neural Networks (66)
- AI Fuzzy Logic (31)
- AI Games (8)
- AI Languages (141)
- AI Tools (11)
- AI Machine Learning (659)
- Data Science (671)
- Data Mining (120)
- TensorFlow (197)
- AI Deep Learning (111)
- AI General (197)
- AI AllOther (6)
Optimality of BFS is a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) Both a & c
1779In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
4434In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
1663A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False
1659What is the other name of informed search strategy? a) Simple search b) Heuristic search c) Online search d) None of the mentioned
4752What is the heuristic function of greedy best-first search? a) f(n) != h(n) b) f(n) < h(n) c) f(n) = h(n) d) f(n) > h(n)
1122Which search uses only the linear space for searching? a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned
2622Which method is used to search better by learning? a) Best-first search b) Depth-first search c) Metalevel state space d) None of the mentioned
3444Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned
4280In many problems the path to goal is irrelevant, this class of problems can be solved using, a) Informed Search Techniques b) Uninformed Search Techniques c) Local Search Techniques d) Only a and b
2372Though 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) No optimum solution
1823A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. State whether True or False. a) True b) False
1648_______________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill a) Up-Hill Search b) Hill-Climbing c) Hill algorithm d) Reverse-Down-Hill search
1 2197
What are the best public data sets for machine learning?
What are artificial intelligence career domains?
Write the formula to calculate r-square?
what is the function of ‘unsupervised learning’?
What do you mean by dropout?
What do you know about bayesian networks?
What is artificial intelligence in simple words?
Define a/b testing?
What language does google use for machine learning?
Describe the common steps to most tensorflow algorithms?
Why do ensembles typically have higher scores than individual models?
Why fuzzy logic?
Can you enumerate the various differences between supervised and unsupervised learning?
What is the difference between a.i. And machine learning, and has a.i. Been oversold for decades because of sci-fi?
What is the purpose of intelligence?
