0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
What is the difference between blind search and heuristic search?
Heuristic search algorithms have knowledge of where the goal or finish of the graph. For example, in a maze, they would know which path leads in the direction of the goal. Blind search algorithms have no knowledge of where the goal is, and wander "blindly" through the graph. Blind search techniques include Breadth-first, Depth-first search, etc. Heuristic search techniques include Best-first, A*, etc.
What is Heuristic knowledge in ai?
Heuristic refers to experience-based techniques for problem solving, learning, and discovery. Where an exhaustive search is impractical, heuristic methods are used to speed up the process of finding a satisfactory solution.
Discuss the heuristic search as applied to an ANDOR graph?
mujhe pata hota to search karti,,,saalon
What assumption about the list is made when binary search is conducted?
Binary search requires that the list be in search key order.
What is the use of binary?
Binary trees are commonly used to implement binary search tree and binary heaps.
A binary search of an orderd set of elements in an array or a sequential search of the elements.Which one is faster?
A binary search is much faster.
What is the binary number for decimal 191?
It is 10111111 in binary. Try a search for '191 to binary'.
Items that are not suitable for a binary search?
The only items suitable for a binary search are those which are in a sorted order.
Does binary tree and binary search tree same?
no they are not same
What is heuristic search technologies?
To understand what heuristic search is, we need to understand that a heuristic is a method for quick problem solving that uses previous experience to infer a solution. Heuristics provide this time savings at some costs, such as having a solution that is less accurate or complete. Taking this into consideration, we can understand that in its most simplest form heuristic searching, which is a part of artificial intelligence, uses educated guessing to find results. They may not be the best results, but they will be found quickly.
What are the drawbacks of the binary search?
The only drawback I know of is that binary search requires that the list already be sorted. So if you have a really large unsorted list than binary search would not be the best option.
How do you print all data in a Binary Search Tree?
By using Depth First Search or Breadth First search Tree traversal algorithm we can print data in Binary search tree.
