Q. In backtracking, the function which needs to be maximized or minimized for a given problem is known as………….

View solution

Q. If we represent solution space in the form of a tree, then the tree is referred as………

View solution

Q. The solution space tree of 8 queens contain…………

View solution

Q. Each node in the tree organization defines………..

View solution

Q. In sum of subsets problem, if n weights are considered then, the solution space consists of………

View solution

Q. What is the time complexity of graph coloring problem?

View solution

Q. If d is the degree of the given graph, then it can be colored with…….colors.

View solution

Q. If n = 4 in the sum of subset problem, then the possible leaf nodes in the tree Organization are…….

View solution

Q. For N Queens problem, the time complexity is………

View solution

Q. The live node whose children are currently being generated is called…….

View solution

Q. In a binary tree, the number of terminal nodes (leaf nodes) are 10, then the numbers of nodes with two children are

View solution

Q. If S(n,e) represents the maximum additional space taken by DFS for an n-vertex, e-edge graph,  then what is the value of S(n,e), if adjacency lists are used.

View solution

Q. Breaking down a problem into several sub problems is known as…….

View solution

Q. Alpha cutoff and Beta cutoff are combined to get………

View solution

Q. A graph G is bi-connected if and only if ………..

View solution

Q. The common vertex of two bi connected components is called …………

View solution

Q. If two queens are placed at position (i, j) and (k,l). Then they are on the same Diagonal if and only if………

View solution

Q. A node which has been generated and all of whose children have not yet been generated is…….

View solution

Q. In the sum of subsets problem, if n=4, (w1, w2 w3, w4) = (11, 13, 24, 7) and m=31 then solutions are .........
(where 1 represents weight chosen and 0 represents weight is not choosen.)

View solution

Q. Painting all the verticies of a graph with colors such that no two adjacent vertices have the same color is called………of the graph.

View solution