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. |
The maximum number of superkeys for the relation schema R(E,F,G,H) with E as the key is(A) 5(B) 6(C) 7(D) 8 |
| Answer» | |
| 2. |
If the matrix A is such thatthen the determinant of A is equal to(A) 0(B) 1(C) 2(D) 3 |
| Answer» | |
| 3. |
The product of the non-zero eigenvalues of the matrix1 0 0 0 10 1 1 1 00 1 1 1 00 1 1 1 01 0 0 0 1is ______(A) 4(B) 5(C) 6(D) 7 |
| Answer» | |
| 4. |
The probability that a given positive integer lying between 1 and 100 (both inclusive) is NOT divisible by 2, 3 or 5 is ______ .(A) 0.259(B) 0.459(C) 0.325(D) 0.225 |
| Answer» None | |
| 5. |
Each of the nine words in the sentence ”The quick brown fox jumps over the lazy dog” is written on a separate piece of paper. These nine pieces of paper are kept in a box. One of the pieces is drawn at random from the box. The expected length of the word drawn is _____________. (The answer should be rounded to one decimal place.)(A) 3.8 to 3.9 |
| Answer» | |
| 6. |
A FAT (file allocation table) based file system is being used and the total overhead of each entry in the FAT is 4 bytes in size. Given a 100 x 106 bytes disk on which the file system is stored and data block size is 103 bytes, the maximum size of a file that can be stored on this disk in units of 106 bytes is ____________.(A) 99.55 to 99.65(B) 100.5 to 101.4(C) 97.2 to 98.5(D) 89.1 to 91.2 |
| Answer» None | |
| 7. |
The security system at an IT office is composed of 10 computers of which exactly four are working. To check whether the system is functional, the officials inspect four of the computers picked at random (without replacement). The system is deemed functional if at least three of the four computers inspected are working. Let the probability that the system is deemed functional be denoted by p. Then 100p = _____________.(A) 11.85 |
| Answer» None | |
| 8. |
The number of people diagnosed with dengue fever (contracted from the bite of a mosquito) in north India is twice the number diagnosed last year. Municipal authorities have concluded that measures to control the mosquito population have failed in this region. Which one of the following statements, if true, does not contradict this conclusion?(A) A high proportion of the affected population has returned from neighbouring countries where dengue is prevalent(B) More cases of dengue are now reported because of an increase in the Municipal Office’s administrative efficiency(C) Many more cases of dengue are being diagnosed this year since the introduction of a new and effective diagnostic test(D) The number of people with malarial fever (also contracted from mosquito bites) has increased this year |
| Answer» | |
| 9. |
A graphical HTML browser resident at a network client machine Q accesses a static HTML webpage from a HTTP server S. The static HTML page has exactly one static embedded image which is also at S. Assuming no caching, which one of the following is correct about the HTML webpage loading (including the embedded image)?(A) Q needs to send at least 2 HTTP requests to S, each necessarily in a separate TCP connection to server S(B) Q needs to send at least 2 HTTP requests to S, but a single TCP connection to server S is sufficient(C) A single HTTP request from Q to S is sufficient, and a single TCP connection between Q and S is necessary for this(D) A single HTTP request from Q to S is sufficient, and this is possible without any TCP connection between Q and S |
| Answer» | |
| 10. |
Consider the procedure below for the Producer-Consumer problem which uses semaphores:Which one of the following is TRUE?(A) The producer will be able to add an item to the buffer, but the consumer can never consume it.(B) The consumer will remove no more than one item from the buffer.(C) Deadlock occurs if the consumer succeeds in acquiring semaphore s when the buffer is empty.(D) The starting value for the semaphore n must be 1 and not 0 for deadlock-free operation. |
| Answer» | |
| 11. |
Consider a join (relation algebra) between relations r(R)and s(S) using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for intermediate results. Assuming size(r(R)) < size(s(S)), the join will have fewer number of disk block accesses if(A) relation r(R) is in the outer loop.(B) relation s(S) is in the outer loop.(C) join selection factor between r(R) and s(S) is more than 0.5.(D) join selection factor between r(R) and s(S) is less than 0.5. |
| Answer» | |
| 12. |
A 4-way set-associative cache memory unit with a capacity of 16 KB is built using a block size of 8 words. The word length is 32 bits. The size of the physical address space is 4 GB. The number of bits for the TAG field is _____(A) 5(B) 15(C) 20(D) 25 |
| Answer» | |
| 13. |
The value of a float type variable is represented using the single-precision 32-bit floating point format IEEE-754 standard that uses 1 bit for sign, 8 bits for biased exponent and 23 bits for mantissa. A float type variable X is assigned the decimal value of −14.25. The representation of X in hexadecimal notation is(A) C1640000H(B) 416C0000H(C) 41640000H(D) C16C0000H |
| Answer» None | |
| 14. |
Consider the equation (123)5 = (x8)y with x and y as unknown. The number of possible solutions is _____ .(A) 1(B) 2(C) 3(D) 4 |
| Answer» | |
| 15. |
In the Newton-Raphson method, an initial guess of x0 = 2 is made and the sequence x0, x1, x2 … is obtained for the function 0.75x3 – 2x2 – 2x + 4 = 0Consider the statements(I) x3 = 0.(II) The method converges to a solution in a finite number of iterations. Which of the following is TRUE?(A) Only I(B) Only II(C) Both I and II(D) Neither I nor II |
| Answer» None | |
| 16. |
Consider the following schedule S of transactions T1, T2, T3, T4:Which one of the following statements is CORRECT?(A) S is conflict-serializable but not recoverable(B) S is not conflict-serializable but is recoverable(C) S is both conflict-serializable and recoverable(D) S is neither conflict-serializable nor is it recoverable |
| Answer» | |
| 17. |
Suppose P, Q, R, S, T are sorted sequences having lengths 20, 24, 30, 35, 50 respectively. They are to be merged into a single sequence by merging together two sequences at a time. The number of comparisons that will be needed in the worst case by the optimal algorithm for doing this is ____.(A) 358(B) 438(C) 568(D) 664 |
| Answer» | |
| 18. |
The number of distinct minimum spanning trees for the weighted graph below is ____(A) 4(B) 5(C) 6(D) 7 |
| Answer» | |
| 19. |
The ratio of male to female students in a college for five years is plotted in the following line graph. If the number of female students doubled in 2009, by what percent did the number of male students increase in 2009?(A) 120(B) 140(C) 160(D) 180 |
| Answer» None | |
| 20. |
At what time between 6 a.m. and 7 a.m. will the minute hand and hour hand of a clock make an angle closest to 60o(A) 6:22 am(B) 6:27 am(C) 6:38 am(D) 6:45 am |
| Answer» None | |
| 21. |
If x is real and |x2 – 2x + 3| = 11, then possible values of |- x3 + x2 – x| include(A) 2, 4(B) 2, 14(C) 4, 52(D) 14, 52 |
| Answer» None | |
| 22. |
For a C program accessing X[i][j][k], the following intermediate code is generated by a compiler. Assume that the size of an integer is 32 bits and the size of a character is 8 bits. t0 = i ∗ 1024 t1 = j ∗ 32 t2 = k ∗ 4 t3 = t1 + t0 t4 = t3 + t2 t5 = X[t4] Which one of the following statements about the source code for the C program is CORRECT?(A) X is declared as “int X[32][32][8]”.(B) X is declared as “int X[4][1024][32]”.(C) X is declared as “char X[4][32][8]”.(D) X is declared as “char X[32][16][2]”. |
| Answer» None | |
| 23. |
A computer has twenty physical page frames which contain pages numbered 101 through 120. Now a program accesses the pages numbered 1, 2, …, 100 in that order, and repeats the access sequence THRICE. Which one of the following page replacement policies experiences the same number of page faults as the optimal page replacement policy for this program?(A) Least-recently-used(B) First-in-first-out(C) Last-in-first-out(D) Most-recently-used |
| Answer» | |
| 24. |
Three processes A, B and C each execute a loop of 100 iterations. In each iteration of the loop, a process performs a single computation that requires tc CPU milliseconds and then initiates a single I/O operation that lasts for tio milliseconds. It is assumed that the computer where the processes execute has sufficient number of I/O devices and the OS of the computer assigns different I/O devices to each process. Also, the scheduling overhead of the OS is negligible. The processes have the following characteristics: Process id tc tio A 100 ms 500 ms B 350 ms 500 ms C 200 ms 500 msThe processes A, B, and C are started at times 0, 5 and 10 milliseconds respectively, in a pure time sharing system (round robin scheduling) that uses a time slice of 50 milliseconds. The time in milliseconds at which process C would complete its first I/O operation is ___________.(A) 500(B) 1000(C) 2000(D) 10000 |
| Answer» None | |
| 25. |
Choose the most appropriate phrase from the options given below to complete the following sentence.India is a post-colonial country because(A) it was a former British colony(B) Indian Information Technology professionals have colonized the world(C) India does not follow any colonial practices(D) India has helped other countries gain freedom |
| Answer» | |
| 26. |
Who ___________ was coming to see us this evening?(A) you said(B) did you say(C) did you say that(D) had you |
| Answer» | |
| 27. |
Match the columns. Column 1 Column 21) eradicate P) misrepresent2) distort Q) soak completely3) saturate R) use4) utilize S) destroy utterly (A) 1:S, 2:P, 3:Q, 4:R(B) 1:P, 2:Q, 3:R, 4:S(C) 1:Q, 2:R, 3:S, 4:P(D) 1:S, 2:P, 3:R, 4:Q |
| Answer» | |
| 28. |
What is the average of all multiples of 10 from 2 to 198?(A) 90(B) 100(C) 110(D) 120 |
| Answer» None | |
| 29. |
(A) 3.464(B) 3.932(C) 4.000(D) 4.444 |
| Answer» None | |
| 30. |
Which one of the following is CORRECT?(A) Only (I)(B) Only (II)(C) Both (I) and (II)(D) Neither (I) nor (II) |
| Answer» | |
| 31. |
Suppose implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?(A) A queue cannot be implemented using this stack.(B) A queue can be implemented where ENQUEUE takes a single instruction and DEQUEUE takes a sequence of two instructions.(C) A queue can be implemented where ENQUEUE takes a sequence of three instructions and DEQUEUE takes a single instruction.(D) A queue can be implemented where both ENQUEUE and DEQUEUE take a single instruction each. |
| Answer» | |
| 32. |
Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected, undirected graph. The tree T formed by the tree arcs is a data structure for computing.(A) the shortest path between every pair of vertices.(B) the shortest path from W to every vertex in the graph.(C) the shortest paths from W to only those nodes that are leaves of T.(D) the longest path in the graph |
| Answer» | |
| 33. |
The dual of a Boolean function f(x1, x2, … , xn, +, ∙ , ′ ), written as FD, is the same expressionas that of F with + and . swapped. F is said to be self-dual if F = FD. The number of self-dualfunctions with n Boolean variables is(A) 2n(B) 2n-1(C) 22n(D) 22n-1 |
| Answer» | |
| 34. |
Consider the C function given below.int f(int j){static int i = 50;int k;if (i == j){printf(“something”);k = f(i);return 0;}else return 0;}Which one of the following is TRUE?(A) The function returns 0 for all values of j.(B) The function prints the string something for all values of j.(C) The function returns 0 when j = 50.(D) The function will exhaust the runtime stack or run into an infinite loop when j = 50 |
| Answer» | |
| 35. |
Let k = 2n. A circuit is built by giving the output of an n-bit binary counter as input to an n-to-2n bit decoder. This circuit is equivalent to a(A) k-bit binary up counter.(B) k-bit binary down counter.(C) k-bit ring counter.(D) k-bit Johnson counter. |
| Answer» | |
| 36. |
Consider the following functiondouble f(double x){if (abs(x*x - 3) < 0.01) return x;else return f(x/2 + 1.5/x);}Give a value q (to 2 decimals) such that f(q) will return q:_____.(A) 1.73(B) 2.24(C) 4.22(D) 3.42 |
| Answer» | |
| 37. |
Which one of the following correctly determines the solution of the recurrence relation with T(1) = 1?T(n) = 2T(n/2) + Logn (A) Θ(n)(B) Θ(nLogn)(C) Θ(n*n)(D) Θ(log n) |
| Answer» None | |
| 38. |
Consider two strings A = “qpqrr” and B = “pqprqrp”. Let x be the length of the longest common subsequence (not necessarily contiguous) between A and B and let y be the number of such longest common subsequences between A and B. Then x + 10y = ___.(A) 33(B) 23(C) 43(D) 34 |
|
Answer» Answer: (D) Explanation: //The LCS is of length 4. There are 3 LCS of length 4 “qprr”, “pqrr” and qpqr |
|