Q. Construct a B+ tree for (1, 4, 7, 10, 17, 21, 31, 25, 19, 20, 28, 42) with n = 4. What is the key value at the root node?

View solution

Q. Calculate the order of B – tree using the following:

Block size = 512 bytes
Record pointer = 7 bytes
Block pointer = 6 bytes
Key filed = 9 bytes

View solution

Q. How many B+ trees of order 3 can be constructed using 3 district keys?

View solution

Q. Find the order of B+ tree leaf node using the following:

Block size = 512 bytes
Record pointer = 7 bytes
Block pointer = 6 bytes
Key field = 9 bytes

View solution

Q. What is the name for the adjacency matrix?

View solution

Q. To identify articulation points in a graph, ……….is very useful?

View solution

Q. The name backtrack was first coined by ………..

View solution

Q. In the backtracking Method, the modified criterion function is also known as………

View solution

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