Worst case complexity of Breadth First Search traversal __________(a) O(n*n)(b) O(nlogn)(c) O(n^2 logn)(d) O(n^3)The question was asked in my homework.Question is from Tree Traversal topic in portion Trees of Discrete Mathematics

Worst case complexity of Breadth First Search traversal __________(a)

1.	Worst case complexity of Breadth First Search traversal __________(a) O(n*n)(b) O(nlogn)(c) O(n^2 logn)(d) O(n^3)The question was asked in my homework.Question is from Tree Traversal topic in portion Trees of Discrete Mathematics
Answer» Correct CHOICE is (b) O(nlogn) Easy explanation: In an n-ary binary TREE, we MUST have to visit all nodes from an adjacent node and repeat the same for next UNVISITED nodes. Hence, in worst case the TIME complexity should be O(nlogn).

Discussion

No Comment Found

Related InterviewSolutions

Prim’s algorithm can be implemented using _______(a) a stack data structure(b) radix sort(c) priority queue data structure(d) bubble sortI have been asked this question in a national level competition.My query is from Spanning Trees in division Trees of Discrete Mathematics
In a maximum spanning tree the weighted graph is of _______(a) maximum number of edges(b) maximum number of cyclic trees(c) minimum number of vertices(d) maximum weightThe question was asked in an online interview.This key question is from Spanning Trees in chapter Trees of Discrete Mathematics
The spanning tree will be maximally acyclic if ____________(a) one additional edge makes a cycle in the tree(b) two additional edges makes a cycle in the tree(c) removing one edge makes the tree cycle free(d) removing two edges make the tree cycle freeI have been asked this question in final exam.My question is based upon Spanning Trees topic in chapter Trees of Discrete Mathematics
A complete undirected graph of n nodes can have maximum ______ spanning trees.(a) n^n+1(b) n^n-2(c) \(\frac{n(n+1)}{2}\)(d) nThe question was posed to me during an online exam.Enquiry is from Spanning Trees topic in chapter Trees of Discrete Mathematics
An immediate application of minimum spanning tree ______(a) gesture analysis(b) handwriting recognition(c) fingerprint detection(d) soft computingI got this question by my school teacher while I was bunking the class.Query is from Spanning Trees in division Trees of Discrete Mathematics
If minimum cost edge of a graph is unique, then that edge will be added to any MST. Choose the correct option.(a) false(b) maximum cost edge is added(c) true(d) minimum cost edge need not be uniqueI got this question in examination.This question is from Spanning Trees in portion Trees of Discrete Mathematics
Time complexity of Prim’s algorithm is _________(a) O((V+E)logV)(b) O(E+V)(c) O(E)(d) O(V+1)I have been asked this question by my school teacher while I was bunking the class.Question is from Spanning Trees in division Trees of Discrete Mathematics
For every spanning tree with n vertices and n edges what is the least number of different Spanning trees can be formed?(a) 2(b) 5(c) 3(d) 4I have been asked this question in semester exam.This question is from Spanning Trees in portion Trees of Discrete Mathematics
What is the time complexity of Kruskal’s algorithm?(a) O(ElogV)(b) O(V+logE)(c) O(E+1)(d) O(V^2)I got this question in an online interview.This question is from Spanning Trees in division Trees of Discrete Mathematics
If the weight of an edge e of cycle C in a graph is larger than the individual weights of all other edges of C, then that edge ________(a) belongs to an minimum spanning tree(b) cannot belong to an minimum spanning tree(c) belongs to all MSTs of the graph(d) can not belong to the graphI had been asked this question in an international level competition.Query is from Spanning Trees in chapter Trees of Discrete Mathematics

Worst case complexity of Breadth First Search traversal __________(a) O(n*n)(b) O(nlogn)(c) O(n^2 logn)(d) O(n^3)The question was asked in my homework.Question is from Tree Traversal topic in portion Trees of Discrete Mathematics

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment