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 obtained by expanding a node are added to a FIFO (i.e., First In, First Out) queue. In typical implementations, nodes that have

_________ ______ ___ _____ _________ ________.
_____ ________ ______ _________ ___ ___ __________ _____.
____ _____ _______ _______ _________.
__________ _______ __________ ___ ______ ____ _______ __________ ____ __________.
_________ __________ _____ __________ _____ _________ _____ ____ ________ _________ _________ ___.
___ _________ ___ __________ ________ __________ ________ _____ ___.
_______ _____ ________ __________ ___ ______ _______ ______ ___ ______ _____.
___ __________ ______ _________ _____ _________ ___ _________.
_________ ________ ____ _______ ____ ___ ________ __________ _______ __________ __________ _______.
______ _____ __________ _________ _______ _________ _____ ______ __________.
__________ ________ ___ ______ __________ _______.
____ _________ ___ _________ ________ ______ ___ _________ _____ _______.
____ __________ ____ ______ ________ ____ ___ _____ ______ __________ _______.
______ _________ ________ ___ ________ ____ _______ _________.
_________ ____ __________ _______ _____ ___.
_______ __________ ____ _________ ______ ________.
_________ _______ _____ _____ ____ _________ ______ __________ ________.
_________ ________ _____ _____ ___.
___ ________ _________ __________ __________ __________ ______.
____ _______ ________ _________ ______ _____ ___ ________ ______ ________.
_______ _______ ____ ________ ______ ____ _________ _______ ______ _____ ___ ______.
_______ ______ ___ ____ _______ ______ ____.
_________ _______ ______ ________ _____ _____ ____.
______ _________ ______ ______ ____ ____ _______ ____.
________ _________ ______ _____ _________ _________.
_______ ____ _____ ______ ______ ________ ______ ____ ________ ___ _____.
__________ ____ _____ ________ __________ ____ _______ ______ _______ __________.
_____ __________ __________ ____ ______ ________ _______ ______.
_________ _________ ___ __________ ____.
_____ _____ ________ ____ _______ _________ ____.
_______ _______ ________ _________ __________ ________ ____ _______ __________ ________.
____ ________ _______ ______ ___ ______ ______ ______.
________ ________ ________ ____ ____.
_______ _____ _________ ___ _________ ____ ________ __________ ___ _________ ______.
______ ____ __________ _________ _____ ___ ___ __________ _____.
________ ________ ___ ______ _______ _________ _____ _________ _________ ______.
____ ______ _____ ________ _________ ________ _____ __________.
___ _______ ___ _______ _____ _____ _______ ___ ________ _______ ___ ___.
_________ _____ _____ ___ ___ _________.
_____ ___ __________ ____ _______ _____ ___ __________ _______ __________ _________.
_______ _________ ________ _____ __________ ___ __________.
___ _________ ________ ____ ________ ________ _____ _______.
_________ _____ _________ ______ ____ ____ _________ _________ _____.
___ __________ _________ _________ _____ _____ ___ ______ ___ ____.
_________ _____ _______ ______ ____ _________ ________.
_______ _________ __________ ________ _____ _______ ______ __________ ____ ______.
___ ________ ________ ____ ____ __________.
___ ___ __________ _________ _______ ___ _________ _____ _________ ________ _________ __________.
_____ ______ _____ ______ ___ ____ _______ ________ _______ _____.
___ _______ ________ _________ ________ _______ _______ ____ _________ __________.
_________ __________ _______ ____ ___ __________ ___ _______ ______ ___ _________.
____ _________ ________ ________ _______ ________ _____ ____ ______ ____ ___.
___ ____ _______ __________ ________ ___.
_________ ____ _____ _____ _______ _________ _________ ___ ______.
______ _________ ____ ___ ________.
_________ __________ _____ __________ ___.
_________ ____ ______ _________ ____ ____ ___ _____ _______ _____.
________ ________ ________.
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
→