Related InterviewSolutions

• 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
• 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
• 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
• 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
• 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
• 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
• 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.
• 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
• 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.
• 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