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. |
An IP router with a Maximum Transmission Unit (MTU) of 1500 bytes has received an IP packet of size 4404 bytes with an IP header of length 20 bytes. The values of the relevant fields in the header of the third IP fragment generated by the router for this packet are(A) MF bit: 0, Datagram Length: 1444; Offset: 370(B) MF bit: 1, Datagram Length: 1424; Offset: 185(C) MF bit: 1, Datagram Length: 1500; Offset: 37(D) MF bit: 0, Datagram Length: 1424; Offset: 2960 |
| Answer» None | |
| 2. |
Every host in an IPv4 network has a 1-second resolution real-time clock with battery backup. Each host needs to generate up to 1000 unique identifiers per second. Assume that each host has a globally unique IPv4 address. Design a 50-bit globally unique ID for this purpose. After what period (in seconds) will the identifiers generated by a host wrap around?(A) 128(B) 64(C) 256(D) 512 |
| Answer» | |
| 3. |
Consider the following statements: P: Good mobile phones are not cheap Q: Cheap mobile phones are not good L: P implies Q M: Q implies P N: P is equivalent to Q Which one of the following about L, M, and N is CORRECT?(A) Only L is TRUE.(B) Only M is TRUE.(C) Only N is TRUE.(D) L, M and N are TRUE |
| Answer» None | |
| 4. |
Suppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checking that the vertex has not been visited earlier. Then the maximum possible recursion depth (including the initial call) is _________.(A) 17(B) 18(C) 19(D) 20 |
| Answer» | |
| 5. |
Consider the following combinational function block involving four Boolean variables x, y, a, b where x, a, b are inputs and y is the output.f (x, y, a, b){if (x is 1) y = a;else y = b;}Which one of the following digital logic blocks is the most suitable for implementing this function?(A) Full adder(B) Priority encoder(C) Multiplexer(D) Flip-flop |
|
Answer» Answer: (C) Explanation: This function can be interpreted as having two inputs a, b and select signal x. Output y will depend on the select signal x. Function will be like (ax+bx’) Its implementation will be like
|
|
| 6. |
Here, wr is the reverse of the string w. Which of these languages are deterministic Context-free languages?(A) None of the languages(B) Only L1(C) Only L1 and L2(D) All the three languages |
| Answer» | |
| 7. |
Consider the transactions T1, T2, and T3 and the schedules S1 and S2 given below.T1: r1(X); r1(Z); w1(X); w1(Z)T2: r2(Y); r2(Z); w2(Z)T3: r3(Y); r3(X); w3(Y)S1: r1(X); r3(Y); r3(X); r2(Y); r2(Z); w3(Y); w2(Z); r1(Z); w1(X); w1(Z)S2: r1(X); r3(Y); r2(Y); r3(X); r1(Z); r2(Z); w3(Y); w1(X); w2(Z); w1(Z) Which one of the following statements about the schedules is TRUE?(A) Only S1 is conflict-serializable.(B) Only S2 is conflict-serializable.(C) Both S1 and S2 are conflict-serializable.(D) Neither S1 nor S2 is conflict-serializable. |
| Answer» | |
| 8. |
Suppose we have a balanced binary search tree T holding n numbers. We are given two numbers L and H and wish to sum up all the numbers in T that lie between L and H. Suppose there are m such numbers in T. If the tightest upper bound on the time tocompute the sum is O(nalogb n + mc logd n), the value of a + 10b + 100c + 1000d is ____.(A) 60(B) 110(C) 210(D) 50 |
| Answer» None | |
| 9. |
Consider the decision problem 2CNFSAT defined as follows:(A) NP-Complete.(B) solvable in polynomial time by reduction to directed graph reachability.(C) solvable in constant time since any input instance is satisfiable.(D) NP-hard, but not NP-complete. |
| Answer» | |
| 10. |
The memory access time is 1 nanosecond for a read operation with a hit in cache, 5 nanoseconds for a read operation with a miss in cache, 2 nanoseconds for a write operation with a hit in cache and 10 nanoseconds for a write operation with a miss in cache. Execution of a sequence of instructions involves 100 instruction fetch operations, 60 memory operand read operations and 40 memory operand write operations. The cache hit-ratio is 0.9. The average memory access time (in nanoseconds) in executing the sequence of instructions is __________.(A) 1.26(B) 1.68(C) 2.46(D) 4.52 |
| Answer» None | |
| 11. |
Consider a paging hardware with a TLB. Assume that the entire page table and all the pages are in the physical memory. It takes 10 milliseconds to search the TLB and 80 milliseconds to access the physical memory. If the TLB hit ratio is 0.6, the effective memory access time (in milliseconds) is _________.(A) 120(B) 122(C) 124(D) 118 |
| Answer» | |
| 12. |
Which of the following problems is undecidable?(A) Deciding if a given context-free grammar is ambiguous.(B) Deciding if a given string is generated by a given context-free grammar.(C) Deciding if the language generated by a given context-free grammar is empty.(D) Deciding if the language generated by a given context-free grammar is finite. |
| Answer» | |
| 13. |
Consider the basic block given below. a = b + c c = a + d d = b + c e = d - b a = e + b The minimum number of nodes and edges present in the DAG representation of the above basic block respectively are(A) 6 and 6(B) 8 and 10(C) 9 and 12(D) 4 and 4 |
| Answer» | |
| 14. |
Consider the relational schema given below, where eId of the relation dependent is a foreign key referring to empId of the relation employee. Assume that every employee has at least one associated dependent in the dependent relation.employee (empId, empName, empAge)dependent(depId, eId, depName, depAge) Consider the following relational algebra query:The above query evaluates to the set of empIds of employees whose age is greater than that of(A) some dependent.(B) all dependents.(C) some of his/her dependents(D) all of his/her dependents. |
| Answer» None | |
| 15. |
Consider the following rooted tree with the vertex P labeled as rootThe order in which the nodes are visited during in-order traversal is(A) SQPTRWUV(B) SQPTURWV(C) SQPTWUVR(D) SQPTRUWV |
| Answer» None | |
| 16. |
You have an array of n elements. Suppose you implement quicksort by always choosing the central element of the array as the pivot. Then the tightest upper bound for the worst case performance is(A) O(n2)(B) O(nLogn)(C) Theta(nLogn)(D) O(n3) |
| Answer» | |
| 17. |
In the context of modular software design, which one of the following combinations is desirable?(A) High cohesion and high coupling(B) High cohesion and low coupling(C) Low cohesion and high coupling(D) Low cohesion and low coupling |
| Answer» | |
| 18. |
Which of the following statements are CORRECT? 1) Static allocation of all data areas by a compiler makes it impossible to implement recursion.2) Automatic garbage collection is essential to implement recursion.3) Dynamic allocation of activation records is essential to implement recursion.4) Both heap and stack are essential to implement recursion.(A) 1 and 2 only(B) 2 and 3 only(C) 3 and 4 only(D) 1 and 3 only |
| Answer» | |
| 19. |
Host A (on TCP/IP v4 network A) sends an IP datagram D to host B (also on TCP/IP v4 network B). Assume that no error occurred during the transmission of D. When D reaches B, which of the following IP header field(s) may be different from that of the original datagram D?(i) TTL (ii) Checksum (iii) Fragment Offset(A) (i) only(B) (i) and (ii) only(C) (ii) and (iii) only(D) (i), (ii) and (iii) |
| Answer» | |
| 20. |
Choose the word that is opposite in meaning to the word “coherent”.(A) sticky(B) well-connected(C) rambling(D) friendly |
| Answer» | |
| 21. |
There are two elements x, y in a group (G,∗) such that every element in the group can be written as a product of some number of x’s and y’s in some order. It is known that x ∗ x = y ∗ y = x ∗ y ∗ x ∗ y = y ∗ x ∗ y ∗ x = ewhere e is the identity element. The maximum number of elements in such a group is __________.(A) 2(B) 3(C) 4(D) 5 |
| Answer» None | |
| 22. |
Let S be the sample space and two mutually exclusive events A and B be such that A U B = S. If P(.) denotes the probability of the event. The maximum value of P(A)P(B) is ______(A) 0.5(B) 0.25(C) 0.225(D) 0.125 |
| Answer» | |
| 23. |
The value of integral given below is:(A)(B)(C)(D)(A) A(B) B(C) C(D) D |
| Answer» | |
| 24. |
If G is a forest with n vertices and k connected components, how many edges does G have?(A) floor(n/k)(B) ceil(n/k)(C) n-k(D) n-k+1 |
| Answer» | |
| 25. |
The minimum number of arithmetic operations required to evaluate the polynomial P(X) = X5 + 4X3 + 6X + 5 for a given value of X using only one temporary variable.(A) 6(B) 7(C) 8(D) 9 |
| Answer» None | |
| 26. |
A system uses 3 page frames for storing process pages in main memory. It uses the Least Recently Used (LRU) page replacement policy. Assume that all the page frames are initially empty. What is the total number of page faults that will occur while processing the page reference string given below?4, 7, 6, 1, 7, 6, 1, 2, 7, 2(A) 4(B) 5(C) 6(D) 7 |
| Answer» None | |
