Q. If two cycle graphs Gm and Gn are joined together with a vertex, the number of spanning trees in the new graph is ______

View solution

Q. For an n-vertex undirected graph, the time required to find a cycle is ____________

View solution

Q. A binary cycle space forms a ______ over the two element field.

View solution

Q. If G is a simple graph with n-vertices and n>=3, the condition for G has a Hamiltonian circuit is __________

View solution

Q. What is a separable graph?

View solution

Q. How many edges are there in a complete graph of order 9?

View solution

Q. How many cycles are there in a wheel graph of order 5?

View solution

Q. The time complexity to find a Eulerian path in a graph of vertex V and edge E is _____________

View solution

Q. The time complexity to find shortest distances by using Dijkstra’s algorithm is __________

View solution

Q. Topological sorting of a graph represents _______ of a graph.

View solution

Q. In preorder traversal of a binary tree the second step is ____________

View solution

Q. An important application of binary tree is ______

View solution

Q. From the following code identify the which traversal of a binary tree is this __________

//if node has left child
order(node.left)
//if node has right child
order(node.right)
visit(node)

View solution

Q. What is the minimum height for a binary search tree with 60 nodes?

View solution

Q. From the following code identify the which traversal of a binary tree is this __________
function traversal(node)

{
//Input:root node of the tree
//Output:None
visitLeft(node)
//if node has left child
traversal(node.left)
visit_Below(node)
//if node has right child
traversal(node.right)
visitRight(node)
}

View solution

Q. For the expression (7-(4*5))+(9/3) which of the following is the post order tree traversal?

View solution

Q. The time complexity of calculating the sum of all leaf nodes in an n-order binary tree is __________

View solution

Q. An immediate application of a Depth First Search traversal is __________

View solution

Q. Breadth First Search traversal of a binary tree finds its application in __________

View solution

Q. Worst case complexity of Breadth First Search traversal __________

View solution