dddDynamic ...

Breadth first search

• Scans each incident node along with its children

• Scans all incident edges before moving to other node

• is same as backtracking

• Scans all the nodes in random order

The optimal solution to a problem is a combination of optimal solutions to its sub-problems. This is known as

• Principle of Duality

• Principle of Feasibility

• Principle of Optimality

• Principle of Dynamicity

Identify correct application/problem for multistage graph

• Resource allocation problem

• Travelling salesperson problem

• Producer Consumer problem

• Barber's problem

DFS uses ____ as an auxiliary structure to hold nodes for future processing

• Stack

• Linked List

• Graph

• Queue

BFS is best compared with DFS in the case of

• The Graph's width is large

• The Graph's depth is large

• The graph consists of many nodes

• The graph is complex

_____is an algorithm design method that can be used when the solution to a problem can be viewed as the result of a sequence of decisions

• Dynamic programming

• Backtracking

• Branch and Bound

• Greedy Method

The in-order traversal of tree gives a sorted list of elements of tree in .......

• Binary Tree

• Binary Search Tree

• Heap

• Binary Heap

Graph G is _______ if and only if it contains no Articulation point

• Connected

• Bi Connected

• Biparite

• Directed

____ is a permutation problem solved using dynamic programming

• 0/1 Knapsack problem

• Fractional Knapsack Problem

• Travelling Salesperson Problem

• Merge Sort

If binary search tree has n identifiers then it will have exactly _____ internal nodes and _____ external nodes

• n+1 , n-1

• n , n-1

• n , n

• n , n+1