InterviewSolution
Saved Bookmarks
InterviewSolution
This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
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. |
| Answer» | |
| 2. |
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 |
| Answer» | |
| 3. |
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 |
| Answer» | |
| 4. |
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 |
| Answer» None | |
| 5. |
(A) A(B) B(C) C(D) D |
| Answer» | |
| 6. |
How many different non-isomorphic Abelian groups of order 4 are there(A) 2(B) 3(C) 4(D) 5 |
| Answer» None | |
| 7. |
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. |
| Answer» | |
| 8. |
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 |
| Answer» | |
| 9. |
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 |
| Answer» | |
| 10. |
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 |
| Answer» | |
| 11. |
Which one of the following uses UDP as the transport protocol?(A) HTTP(B) Telnet(C) DNS(D) SMTP |
| Answer» | |
| 12. |
A complete n-ary tree is a tree in which each node has n children or no children. Let I be the number of internal nodes and L be the number of leaves in a complete n-ary tree. If L = 41, and I = 10, what is the value of n?(A) 3(B) 4(C) 5(D) 6 |
| Answer» None | |
| 13. |
Let G be the non-planar graph with the minimum possible number of edges. Then G has(A) 9 edges and 5 vertices(B) 9 edges and 6 vertices(C) 10 edges and 5 vertices(D) 10 edges and 6 vertices |
| Answer» | |
| 14. |
Consider a 4-way set associative cache consisting of 128 lines with a line size of 64 words. The CPU generates a 20-bit address of a word in main memory. The number of bits in the TAG, LINE and WORD fields arerespectively:(A) 9,6,5(B) 7, 7, 6(C) 7, 5, 8(D) 9, 5, 6 |
| Answer» None | |
| 15. |
Let A be a 4 x 4 matrix with eigenvalues -5, -2, 1, 4. Which of the following is an eigenvalue of [A I][I A] where I is the 4 x 4 identity matrix?(A) -5(B) -7(C) 2(D) 1 |
| Answer» | |
| 16. |
Which of the following graphs has an Eulerian circuit?(A) Any k-regular graph where kis an even number.(B) A complete graph on 90 vertices(C) The complement of a cycle on 25 vertices(D) None of the above |
| Answer» | |
| 17. |
Suppose we uniformly and randomly select a permutation from the 20! Permutations of 1, 2, 3 ,…..,20. What is the probability that 2 appears at an earlier position than any other even number in the selected permutation?(A) 1/2(B) 1/10(C) 9!/20!(D) Node of the above |
| Answer» | |
| 18. |
Consider the data given in above question.Least Recently Used (LRU) page replacement policy is a practical approximation to optimal page replacement. For the above reference string, how many more page faults occur with LRU than with the optimal page replacement policy?(A) 0(B) 1(C) 2(D) 3 |
| Answer» | |