Q. The spanning tree will be maximally acyclic if ____________

View solution

Q. A complete undirected graph of n nodes can have maximum ______ spanning trees.

View solution

Q. If minimum cost edge of a graph is unique, then that edge will be added to any MST. Choose the correct option.

View solution

Q. An immediate application of minimum spanning tree ______

View solution

Q. What is the time complexity of Kruskal’s algorithm?

View solution

Q. Time complexity of Prim’s algorithm is _________

View solution

Q. For every spanning tree with n vertices and n edges what is the least number of different Spanning trees can be formed?

View solution

Q. 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 ________

View solution

Q. Spanning trees have a special class of depth-first search trees named _________

View solution

Q. Prefix expression can be evaluated _________

View solution

Q. What is the postfix expression of the given expression, (2*4-(5+7/3^4)-8)10?

View solution

Q. Convert the following expression into prefix notation.

(g-(f^e/d+c)-ba)

View solution

Q. What is the postfix expression of (A+B)-C*(D/E))+F?

View solution

Q. What is the postfix expression of 9+3*5/(10-4)?

View solution

Q. Conversion from prefix to postfix expression can be done _______________

View solution

Q. Infix to prefix conversion can be done using __________

View solution

Q. What is the output of the following if funct1(7)?

View solution

Q. Evaluation of 4*5+3/2-9 in prefix notation.

View solution

Q. Evaluation of expression a/b+c*d-e in postfix notation.

View solution

Q. Worst case complexity of Breadth First Search traversal __________

View solution