Q1.
a) Show that the outcomes of inserting the keys F, S, Q, K, C, L, H, T, V, W, M, R, N, P, A, B, X, Y, D, Z, E, I in order to an empty B tree of minimum degree 3. Just draw the configurations of the tree just before some node should split and as well draw the final configuration.
b) What do you mean by the term backtracking? Find out a solution to 4-Queens problem by using backtracking strategy. Draw the solution space by using essential bounding function.
Q2. prepare detail notes on any three.
a) Prefix Function in the KMP algorithm
b) Hash Functions
c) Depth First Search
d) The Complexity Class NP