Question

Consider Best first search technique and Breadth first search technique.

Answer the following with respect to these techniques.

Give justification for your answer in each case.

03 Nov 2017
Answer :
Word Count : 739

We knew two of the systematic control strategies breadth first search (BFS) and depth first search (DFS). Another technique which is a new method called Best First Search which is a the combination of the advantages of both depth first search and breadth first search techniques into a single strategy.

• TWO systematic control strategies: BFS & DFS (of several variates, i.e. Heuristic techniques).

• BFS is a good search technique because it does not get trapped on the dead-end paths (the Merit is there is no delay with this technique)

• To combine these two, we have – follow a single path at a time, but we have to switch the paths whenever some competing path looks more promising than current the one does.

• DFS – good because it allow? a solution to be found without all competing branches having to be expanded.

Note: Demerit – time delay

• Another technique – BFS – combining the merits of DFS & BFS into a single method

BFS is an uninformed search method that aims to expand and examine all nodes of a graph or combination of sequences by systematically searching through every solution. In other words, it exhaustively searches the entire graph or sequence without considering the goal until it finds it. It does not use a heuristic algorithm.

From the standpoint of the algorithm, all child nodes

________ _____ _____ ______ __________.
_____ __________ ___ ____ _____.
_____ ______ ____ ________ ______ _______ ________ _______ _____.
______ _________ __________ ____ ______ _____ __________ ________ ____ _________ _____ ________.
________ _________ ___ ______ ________ ______ _________ __________.
___ __________ ____ _______ _______ _______ _____ ________ _________ _________ _________.
______ ____ ________ ________ ____.
___ ________ __________ _______ _______ _______ _____ __________ _______ ______ ______ ________.
_______ ____ _________ __________ _______ ______.
_____ ___ ____ _____ _____ _____.
_________ _____ ___ _________ _______ _______.
__________ ____ ______ _________ ______ ________.
_______ ___ _______ _____ _______ _________ _____ ____ ______ ____.
_________ _____ ________ _______ ________ _____ _____ ____ __________ ________ ______ _____.
__________ ____ _________ _____ _____ _______ ____ ________ _______.
_____ _________ ________ __________ _____ ___ __________.
_______ __________ __________ _________ __________ ________ ________.
___ ______ ___ _____ _________.
___ _______ ___ _______ _____ ___.
___ _____ _______ ________ _______ _____ ________ _____ ___ ______.
________ ______ __________ _____ ____ _____ __________ _________ _____ ________ ______.
________ ________ ________ __________ ____ _________ ________ ________ ______ _____.
__________ _______ ______ _____ _____ __________ _________ _______ __________ _____ ________.
________ ____ _____ _______ ____ ________ _________ _______.
_______ ______ _______ _____ __________.
_________ ______ __________ ____ ______.
_____ ______ ________ ________ __________ __________ ___ _______ ____ ___ _____ _____.
___ ___ ________ ______ _______ ___.
__________ __________ ___ ___ __________ ______.
____ ______ ___ ____ ___ _______ ____.
__________ ______ ___ _________ ___ ____.
_______ _______ ________ ______ ___ _________ __________.
_________ ___ _________ _______ _________ ______.
_______ ________ ______ ________ _____ ___ ______ _________ ___ __________ ____.
________ ___ ____ ________ ______.
____ _________ ____ _____ _________ ____ _______ _______.
_______ ________ ________ ___ ___ ______ ___ _____ ___ ___.
______ _____ ________ ___ _____.
_________ _________ ___ ________ _____ _________.
________ _______ ________ ____ _______ _____ _________.
_____ ____ _______ ____ _____ ___ _____ ____.
_______ ________ ________ ______ ________ __________.
____ _____ _____ ___ ______ _____ _________.
_________ ____ ________ ________ _____ ______ ________ _______ _____ ______ _____ _______.
______ _________ ________ ___ ___ ________ _____.
________ _______ ____ ___ ________ _______ __________.
___ _________ ________ ________ ___ ____ ____ ___ _______ _________.
_____ ______ ______ ____ ______ _________ __________ ____ __________ _________.
__________ ___ ____ ________ _______ _____ ____ _________ _____ __________.
_____ __________ ________ ________ ________ ______ ______ ______ ____ ___ ___.
__________ ____ ______ _____ ______ ______ __________ _______.
_____ __________ ___ __________ ____ ________ _______.
____ _____ ______ ___ ________ _________ _________ _________ _________ ______ _______ _______.
_________ _____ ________ _________ ___ __________ ___ ____ ___ ________ _______.
________ _________ ______ _________ ______.
______ ________ ________ _______ _________ _____ _____.
__________ _________ ____ ___ _____.
_________ ______ ___ __________ ______ ___.
_______ _____ ______ _______ ______.
_______ ____ _______ _____ ________ ____ _____ ________ ________.
_________ __________ _______ _______ ________ _________ _____.
__________ __________ ______ ________ _________ _____ _________ __________ _____ _________ ____ _________.
___ ___ ________ __________ ___.
________ _____ ___ ________ ____ _____ _____ ____.
__________ _______ _____ _____ _______ _____.
IGNOU ACADEMY
Your IGNOU journey, made easier.
  • Solved Assignments
  • Study Notes
  • Guess Papers
  • Question Papers
Skip in 10
Top
📞
Call Support Instant phone assistance IGNOU MCS 31 2011 - Consider Best first search technique and Breadth first search techniqu | IGNOU Academy
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→