Interested to Buy Any Domain ? << Click Here >> for more details...
-
AI Algorithms (74) - AI Natural Language Processing (96)
- AI Knowledge Representation Reasoning (12)
- AI Robotics (183)
- AI Computer Vision (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)
- AI Deep Learning (111)
- Generative AI (153)
- AI Frameworks Libraries (197)
- AI Ethics Safety (100)
- AI Applications (427)
- 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
2142In 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
4877In 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
2072A* 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
2167What is the other name of informed search strategy? a) Simple search b) Heuristic search c) Online search d) None of the mentioned
5158What 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)
1493Which 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
2998Which 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
3880Which 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
4780In 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
2713Though 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
2152A 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
1976_______________ 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 2690
What is collaborative filtering in machine learning?
Give a general algorithm for converting a m-array tree to a 2-ary tree.
What prior knowledge is required to become data scientist?
What are the challenges of implementing AI on edge devices?
What is 'human-robot interaction'?
Describe different methods for model interpretability.
Explain reinforcement learning.
Which unit gives non-linearity to a neural network?
Which of the Following problems can be modeled as CSP? a) 8-Puzzle problem b) 8-Queen problem c) Map coloring problem d) Sudoku
Have you used sampling? What are the various types of sampling have you worked with?
Which language is best for text analytics? R or python?
Specify the agent architecture name that is used to capture all kinds of actions. a) Complex b) Relational c) Hybrid d) None of the mentioned
Explain the working of the Viterbi Algorithm and its use in Hidden Markov Models (HMMs).
What are spring annotations?
What is bidirectional search algorithm?
