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 a software program that is artificially seeded with 100 faults. While testing this program, 159 faults are detected, out of which 75 faults are from those artificially seeded faults. Assuming that both real and seeded faults are of same nature and have same distribution, the estimated number of undetected real faults is ____________.(A) 28(B) 175(C) 56(D) 84 |
| Answer» None | |
| 2. |
Consider three software items: Program-X, Control Flow Diagram of Program-Y and Control Flow Diagram of Program-Z as shown belowThe values of McCabe’s Cyclomatic complexity of Program-X, Program-Y and Program-Z respectively are(A) 4, 4, 7(B) 3, 4, 7(C) 4, 4, 8(D) 4, 3, 8 |
| Answer» None | |
| 3. |
Among simple LR (SLR), canonical LR, and look-ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the most powerful, in that order?(A) SLR, LALR(B) Canonical LR, LALR(C) SLR, canonical LR(D) LALR, canonical LR |
| Answer» | |
| 4. |
Consider the following code sequence having five instructions I1 to I5. Each of these instructions has the following format. OP Ri, Rj, Rk where operation OP is performed on contents of registers Rj and Rk and the result is stored in register Ri. I1 : ADD R1, R2, R3 I2 : MUL R7, R1, R3 I3 : SUB R4, R1, R5 I4 : ADD R3, R2, R4 I5 : MUL R7, R8, R9 Consider the following three statements:S1: There is an anti-dependence between instructions I2 and I5.S2: There is an anti-dependence between instructions I2 and I4.S3: Within an instruction pipeline an anti-dependence always creates one or more stalls. Which one of above statements is/are correct?(A) Only S1 is true(B) Only S2 is true(C) Only S1 and S2 are true(D) Only S2 and S3 are true |
| Answer» None | |
| 5. |
Given a hash table T with 25 slots that stores 2000 elements, the load factor α for T is __________(A) 80(B) 0.0125(C) 8000(D) 1.25 |
| Answer» | |
| 6. |
Two processes X and Y need to access a critical section. Consider the following synchronization construct used by both the processes.Here, varP and varQ are shared variables and both are initialized to false. Which one of the following statements is true?(A) The proposed solution prevents deadlock but fails to guarantee mutual exclusion(B) The proposed solution guarantees mutual exclusion but fails to prevent deadlock(C) The proposed solution guarantees mutual exclusion and prevents deadlock(D) The proposed solution fails to prevent deadlock and fails to guarantee mutual exclusion |
| Answer» | |
| 7. |
Consider the following C program.The output of the program is __________.# include <stdio.h>int f1(void);int f2(void);int f3(void);int x = 10;int main(){int x = 1;x += f1() + f2() + f3() + f2();pirntf("%d", x);return 0;}int f1(){int x = 25;x++;return x;}int f2( ){static int x = 50;x++;return x;}int f3( ){x *= 10;return x;}(A) 230(B) 131(C) 231(D) 330 |
| Answer» None | |
| 8. |
While inserting the elements 71, 65, 84, 69, 67, 83 in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is(A) 65(B) 67(C) 69(D) 83 |
| Answer» None | |
| 9. |
For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time?Process Arrival Time Processing Time A 0 3 B 1 6 C 4 4 D 6 2(A) First Come First Serve(B) Non-preemptive Shortest Job First(C) Shortest Remaining Time(D) Round Robin with Quantum value two |
| Answer» None | |
| 10. |
The Tamil version of ________ John Abraham-starrer Madras Cafe _____ cleared by the Censor Board with no cuts last week, but the film’s distributors ______ no takers among the exhibitors for a release in Tamil Nadu _________ this Friday.(A) Mr., was, found, on(B) a, was, found, at(C) the, was, found, on(D) a, being, find at |
| Answer» | |
| 11. |
If ROAD is written as URDG, then SWAN should be written as:(A) VXDQ(B) VZDQ(C) VZDP(D) UXDQ |
| Answer» | |
| 12. |
Consider the following recursive C function. If get(6) function is being called in main() then how many times will the get() function be invoked before returning to the main()?void get (int n){if (n < 1) return;get(n-1);get(n-3);printf("%d", n);}(A) 15(B) 25(C) 35(D) 45 |
| Answer» None | |
| 13. |
Language L1 is polynomial time reducible to language L2. Language L3 is polynomial time reducible to L2, which in turn is polynomial time reducible to language L4. Which of the following is/are True? I. If L4 ∈ P, L2 ∈ PII. If L1 ∈ P or L3 ∈ P, then L2 ∈ PIII. L1 ∈ P, if and only if L3 ∈ PIV. If L4 ∈ P, then L1 ∈ P and L3 ∈ P (A) II only(B) III only(C) I and IV only(D) I only |
| Answer» | |
| 14. |
The maximum number of processes that can be in Ready state for a computer system with n CPUs is(A) n(B) n2(C) 2n(D) Independent of n |
| Answer» | |
| 15. |
Consider the following C program.The output of the program is __________. # include <stdio.h> int f1(void); int f2(void); int f3(void); int x = 10; int main() { int x = 1; x += f1() + f2() + f3() + f2(); pirntf("%d", x); return 0; } int f1() { int x = 25; x++; return x; } int f2( ) { static int x = 50; x++; return x; } int f3( ) { x *= 10; return x; } (A) 230(B) 131(C) 231(D) 330 |
| Answer» None | |
| 16. |
The total number of prime implicants of the function f(w, x, y, z) = Σ(0, 2, 4, 5, 6, 10) is ________.(A) 2(B) 3(C) 4(D) 5 |
| Answer» | |
| 17. |
Consider the following policies for preventing deadlock in a system with mutually exclusive resources.I. Processes should acquire all their resources at the beginning of execution. If any resource is not available, all resources acquired so far are released.II. The resources are numbered uniquely, and processes are allowed to request for resources only in increasing resource numbers.III. The resources are numbered uniquely, and processes are allowed to request for resources only in decreasing resource numbers.IV. The resources are numbered uniquely. A process is allowed to request only for a resource with resource number larger than its currently held resources.Which of the above policies can be used for preventing deadlock?(A) Any one of I and III but not II or IV(B) Any one of I, III and IV but not II(C) Any one of II and III but not I or IV(D) Any one of I, II, III and IV |
| Answer» | |
| 18. |
Consider B+ tree in which the search key is 12 bytes long, block size is 1024 bytes, record pointer is 10 bytes long and block pointer is 8 bytes long. The maximum number of keys that can be accommodated in each non-leaf node of the tree is(A) 49(B) 50(C) 51(D) 52 |
| Answer» None | |
| 19. |
Consider the following reservation table for a pipeline having three stages S1, S2 and S3. Time -->----------------------------- 1 2 3 4 5-----------------------------S1 | X | | | | X | S2 | | X | | X | |S3 | | | X | | |The minimum average latency (MAL) is __________(A) 3(B) 2(C) 1(D) 4 |
| Answer» None | |
| 20. |
Let # be a binary operator defined as X # Y = X′ + Y′ where X and Y are Boolean variables. Consider the following two statements. S1: (P # Q) # R = P # (Q # R)S2: Q # R = R # Q Which of the following is/are true for the Boolean variables P, Q and R?(A) Only S1 is True(B) Only S2 is True(C) Both S1 and S2 are True(D) Neither S1 nor S2 are True |
| Answer» None | |