Q. A polytree is called _______________

View solution

Q. The tree elements are called __________

View solution

Q. In an n-ary tree, each vertex has at most ______ children.

View solution

Q. A linear graph consists of vertices arranged in a line.

View solution

Q. Two labeled trees are isomorphic if ____________

View solution

Q. A graph which consists of disjoint union of trees is called ______

View solution

Q. What is a bipartite graph?

View solution

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