Related InterviewSolutions

• Consider the following statements about user level threads and kernel level threads. Which one of the following statement is FALSE?(A) Context switch time is longer for kernel level threads than for user level threads.(B) User level threads do not need any hardware support.(C) Related kernel level threads can be scheduled on different processors in a multi-processor system.(D) Blocking one kernel level thread blocks all related threads.
• How many 3-to-8 line decoders with an enable input are needed to construct a 6-to-64 line decoder without using any other logic gates?(A) 7(B) 8(C) 9(D) 10
• Suppose only one multiplexer and one inverter are allowed to be used to implement any Boolean function of n variables. What is the minimum size of the multiplexer needed?(A) 2n line to 1 line(B) 2n+1 line to 1 line(C) 2n-1 line to 1 line(D) 2n-2 line to 1 line
• In a look-ahead carry generator, the carry generate function Gi and the carry propagate function Pi for inputs Ai and Bi are given by:Pi = Ai ⨁ Bi and Gi = AiBi The expressions for the sum bit Si and the carry bit Ci+1 of the look-ahead carry adder are given by:Si = Pi ⨁ Ci and Ci+1 = Gi + PiCi , where C0 is the input carry. Consider a two-level logic implementation of the look-ahead carry generator. Assume that all Pi and Gi are available for the carry generator circuit and that the AND and OR gates can have any number of inputs. The number of AND gates and OR gates needed to implement the look-ahead carry generator for a 4-bit adder with S3, S2, S1, S0 and C4 as its outputs are respectively:(A) 6, 3(B) 10, 4(C) 6, 4(D) 10, 5
• (A) A(B) B(C) C(D) D
• How many different non-isomorphic Abelian groups of order 4 are there(A) 2(B) 3(C) 4(D) 5
• In an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of time complexity by(A) Dijkstra’s algorithm starting from S.(B) Warshall’s algorithm(C) Performing a DFS starting from S.(D) Performing a BFS starting from S.
• Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the table.(A) 8, _, _, _, _, _, 10(B) 1, 8, 10, _, _, _, 3(C) 1, _, _, _, _, _,3(D) 1, 10, 8, _, _, _, 3
• The following postfix expression with single digit operands is evaluated using a stack:8 2 3 ^ / 2 3 * + 5 1 * - Note that ^ is the exponentiation operator. The top two elements of the stack after the first * is evaluated are:(A) 6, 1(B) 5, 7(C) 3, 2(D) 1, 5
• The inorder and preorder traversal of a binary tree are d b e a f c g and a b d e c f g, respectively. The postorder traversal of the binary tree is:(A) d e b f g c a(B) e d b g f c a(C) e d b f g c a(D) d e f g b c a