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 relations A, B, C. How many tuples does the result of the following relational algebra expression contain? Assume that the schema of A U B is the same as that of A.Table AId Name Age----------------12 Arun 6015 Shreya 2499 Rohit 11Table BId Name Age----------------15 Shreya 2425 Hari 4098 Rohit 2099 Rohit 11Table CId Phone Area-----------------10 2200 02 99 2100 01(A) 7(B) 4(C) 5(D) 9 |
| Answer» | |
| 2. |
The amount of ROM needed to implement a 4 bit multiplier is(A) 64 bits(B) 128 bits(C) 1 Kbits(D) 2 Kbits |
| Answer» | |
| 3. |
Consider the 3 processes, P1, P2 and P3 shown in the table.Process Arrival time Time Units Required P1 0 5 P2 1 7 P3 3 4The completion order of the 3 processes under the policies FCFS and RR2 (round robin scheduling with CPU quantum of 2 time units) are(A)FCFS: P1, P2, P3 RR2: P1, P2, P3(B) FCFS: P1, P3, P2 RR2: P1, P3, P2(C)FCFS: P1, P2, P3 RR2: P1, P3, P2(D)FCFS: P1, P3, P2 RR2: P1, P2, P3 |
| Answer» None | |
| 4. |
Suppose a fair six-sided die is rolled once. If the value on the die is 1, 2, or 3, the die is rolled asecond time. What is the probability that the sum total of values that turn up is at least 6?(A) 10/21(B) 5/12(C) 2/3(D) 1/6 |
| Answer» | |
| 5. |
Consider the above tables A, B and C. How many tuples does the result of the following SQL query contains?SELECT A.id FROM A WHERE A.age > ALL (SELECT B.age FROM B WHERE B. name = "arun") (A) 4(B) 3(C) 0(D) 1 |
| Answer» | |
| 6. |
Consider a random variable X that takes values +1 and −1 with probability 0.5 each. The values of the cumulative distribution function F(x) at x = −1 and +1 are(A) 0 and 0.5(B) 0 and 1(C) 0.5 and 1(D) 0.25 and 0.75 |
| Answer» | |
| 7. |
The truth tablerepresents the Boolean function(A) X(B) X+Y(C) X xor Y(D) Y |
| Answer» None | |
| 8. |
Consider the data given in previous question. The size of the cache tag directory is(A) 160 Kbits(B) 136 bits(C) 40 Kbits(D) 32 bits |
| Answer» | |
| 9. |
(A) Both I1 and I2 are correct inferences(B) I1 is correct but I2 is not a correct inference(C) I1 is not correct but I2 is a correct inference(D) Both I1 and I2 are not correct inferences |
| Answer» | |
| 10. |
Which of the following isTRUE?(A) Every relation in 3NF is also in BCNF(B) A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R(C) Every relation in BCNF is also in 3NF(D) No relation can be in both BCNF and 3NF |
| Answer» | |
| 11. |
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is(A) T(n) = 2T(n − 2) + 2(B) T(n) = 2T(n − 1) + n(C) T(n) = 2T(n/2) + 1(D) T(n) = 2T(n − 1) + 1 |
| Answer» | |
| 12. |
Which of the following statements are TRUE about an SQL query?P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clauseQ : An SQL query can contain a HAVING clause only if it has a GROUP BY clauseR : All attributes used in the GROUP BY clause must appear in the SELECT clauseS : Not all attributes used in the GROUP BY clause need to appear in the SELECT clause(A) P and R(B) P and S(C) Q and R(D) Q and S |
| Answer» None | |
| 13. |
Which of the following transport layer protocols is used to support electronic mail?(A) SMTP(B) IP(C) TCP(D) UDP |
| Answer» | |
| 14. |
What is the correct translation of the following statement into mathematical logic?“Some real numbers are rational”(A) A(B) B(C) C(D) D |
| Answer» None | |
| 15. |
Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph,then the number of bounded faces in any embedding of G on the plane is equal to(A) 3(B) 4(C) 5(D) 6 |
| Answer» None | |
| 16. |
The decimal value 0.5 in IEEE single precision floating point representation has(A) fraction bits of 000…000 and exponent value of 0(B) fraction bits of 000…000 and exponent value of −1(C) fraction bits of 100…000 and exponent value of 0(D) no exact representation |
| Answer» | |
| 17. |
A process executes the codefork();fork();fork(); The total number of child processes created is(A) 3(B) 4(C) 7(D) 8 |
| Answer» None | |
| 18. |
Consider the function f(x) = sin(x) in the interval [π/4, 7π/4]. The number and location(s) of the local minima of this function are(A) One, at π/2(B) One, at 3π/2(C) Two, at π/2 and 3π/2(D) Two, at π/4 and 3π/2 |
| Answer» | |
| 19. |
The protocol data unit (PDU) for the application layer in the Internet stack is(A) Segment(B) Datagram(C) Message(D) Frame |
| Answer» None | |
| 20. |
Consider the virtual page reference string1, 2, 3, 2, 4, 1, 3, 2, 4, 1On a demand paged virtual memory system running on a computer system that main memory size of 3 pages frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacements policy. Then(A) OPTIMAL < LRU < FIFO(B) OPTIMAL < FIFO < LRU(C) OPTIMAL = LRU(D) OPTIMAL = FIFO |
| Answer» | |
| 21. |
Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are(A) Full: (REAR+1) mod n == FRONT, empty: REAR == FRONT(B) Full: (REAR+1) mod n == FRONT, empty: (FRONT+1) mod n == REAR(C) Full: REAR == FRONT, empty: (REAR+1) mod n == FRONT(D) Full: (FRONT+1) mod n == REAR, empty: REAR == FRONT |
| Answer» None | |
| 22. |
A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is(A) O(n log n)(B) O(n2 log n)(C) O(n2 + log n)(D) O(n2) |
| Answer» | |