InterviewSolution
Saved Bookmarks
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. |
In the slow start phase of the TCP congestion control algorithm, the size of the congestion window(A) does not increase(B) increases linearly(C) increases quadratically(D) increases exponentially |
| Answer» | |
| 2. |
An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only if(A) the SLR(1) parser for G has S-R conflicts(B) the LR(1) parser for G has S-R conflicts(C) the LR(0) parser for G has S-R conflicts(D) the LALR(1) parser for G has reduce-reduce conflicts |
| Answer» None | |
| 3. |
A clustering index is defined on the fields which are of type(A) non-key and ordering(B) non-key and non-ordering(C) key and ordering(D) key and non-ordering |
| Answer» | |
| 4. |
Which of the following are NOT true in a pipelined processor?I. Bypassing can handle all RAW hazards.II. Register renaming can eliminate all register carried WAR hazards.III. Control hazard penalties can be eliminated by dynamic branch prediction.(A) I and II only(B) I and III only(C) II and III only(D) I, II and III |
| Answer» | |
| 5. |
The use of multiple register windows with overlap causes a reduction in the number of memory accesses forI. Function locals and parametersII. Register saves and restoresIII. Instruction fetches (A) I only(B) II only(C) III only(D) I, II and III |
| Answer» | |
| 6. |
You are given the postorder traversal, P, of a binary search tree on the n elements 1, 2, …, n. You have to determine the unique binary search tree that has P as its postorder traversal. What is the time complexity of the most efficient algorithm for doing this?(A) O(Logn)(B) O(n)(C) O(nLogn)(D) none of the above, as the tree cannot be uniquely determined. |
| Answer» | |
| 7. |
The cache hit ratio for this initialization loop is(A) 0%(B) 25%(C) 50%(D) 75% |
| Answer» | |
| 8. |
If P, Q, R are subsets of the universal set U, then(A) Qc U Rc(B) P U Qc U Rc(C) Pc U Qc U Rc(D) U |
| Answer» | |
| 9. |
P and Q are two propositions. Which of the following logical expressions are equivalent?(A) Only I and II(B) Only I, II and III(C) Only I, II and IV(D) All of I, II, III and IV |
| Answer» | |
| 10. |
(A) 1(B) -1(C) INF(D) -INF |
| Answer» | |
| 11. |
Let X be a random variable following normal distribution with mean +1 and variance 4. Let Y be another normal variable with mean -1 and variance unknown If P(X <=-1) = P(Y >=2). the standard deviation of Y is(A) 3(B) 2(C) sqrt(2)(D) 1 |
| Answer» | |
| 12. |
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is(A) Θ(n)(B) Θ(logn)(C) Θ(log*n)(D) Θ(1) |
| Answer» | |