n Depth First Search, how many times a node is visited?Marks : 1Negative Marks : 0Answer hereTwiceThriceEquivalent to number of indegree of the nodeOnce

Consider the following sequence of nodes for the undirected graph given below.a b e f d g ca b e f c g da d g e b c fa d b c g e fA Depth First Search (DFS) is started at node a. The nodes are listed in the order they are first visited. Which of the above is (are) possible output(s)?Marks : 1Negative Marks : 0Answer here2, 3, and 4 only1 and 3 only2 and 3 only1, 2, and 3

n Depth First Search we examine _____.a)The starting node and then go deeper and deeperb)All of its children’s and then examine the root nodec)The neighbours and then the root noded)The root node and then traverse the neighbours

Discuss the time complexity of searching for a node in a binary search give the answer for 5 marks

The time complexity of the Best-first search depends on..........................................a)the number of nodes in the graph.b)the branching factor of the graph.c)the depth of the solution.d)the heuristic function used.

How many edges will a tree consisting of N nodes have?ans.N + 1N – 1NLog(N) Previous Marked for Review Next