Related InterviewSolutions

• The read access times and the hit ratios for different caches in a memory hierarchy are as given below:The read access time of main memory in 90 nanoseconds. Assume that the caches use the referred-word-first read policy and the writeback policy. Assume that all the caches are direct mapped caches. Assume that the dirty bit is always 0 for all the blocks in the caches. In execution of a program, 60% od memory reads are for instruction fetch and 40% are for memory operand fetch. The average read access time in nanoseconds (up to 2 decimal places) is _________Note: This question appeared as Numerical Answer Type.(A) 2.74(B) 4.72(C) 3.10(D) 2.67
• Consider the following languages.L1 = {ap | p is a prime number}L2 = {anbmc2m | n >= 0, m >= 0}L3 = {anbnc2n | n >= 0}L4 = {anbn | n >= 1}Which of the following are CORRECT ?I. L1 is context free but not regular.II. L2 is not context free.III. L3 is not context free but recursive.IV. L4 is deterministic context free.(A) I, II and IV only(B) II and III only(C) I and IV only(D) III and IV only
• Consider the following snippet of a C program. Assume that swap(&x, &y) exchanges the contents of x and y.int main(){ int array[] = {3, 5, 1, 4, 6, 2}; int done = 0; int i; while (done == 0) { done = 1; for (i = 0; i <= 4; i++) { if (array[i] = 1; i--) { if (array[i] > array[i-1]) { swap(&array[i], &array[i-1]); done = 0; } } } printf("%d", array[3]);}The output of the program is _____.Note: This question appeared as Numerical Answer Type.(A) 1(B) 2(C) 3(D) 4
• Consider the following function implemented in C:void printxy(int x, int y){ int *ptr; x = 0; ptr = &x; y = *ptr; *ptr = 1; printf("%d,%d", x, y);}The output of the printxy(1,1) is(A) 0,0(B) 0,1(C) 1,0(D) 1,1
• The minimum number of ordered pairs that need to be added to R to make (X, R) a lattice is _____.Note: This question appeared as Numerical Answer Type.(A) 0(B) 1(C) 2(D) 3
• If w, x, y, z are boolean variables, then which of the following in INCORRECT?(A) wx + w(x+y) + x(x+y) = x + wy(B) (wx'(y + z’))’ + w’x = w’ + x + y’z(C) (wx'(y + xz’) + w’x’)y = xy’(D) (w + y)(wxy + wyz) = wxy + wyz
• The pre-order traversal of a binary search tree is given by 12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20.Then the post-order traversal of this tree is:(A) 2, 6, 7, 8, 9, 10, 12, 15, 16, 17, 19, 20(B) 2, 7, 6, 10, 9, 8, 15, 17, 20, 19, 16, 12(C) 7, 2, 6, 8, 9, 10, 20, 17, 19, 15, 16, 12(D) 7, 6, 2, 10, 9, 8, 15, 16, 17, 20, 19, 12
• Which of the following is/are shared by all the threads in a process?I. Program CounterII. StackIII. Address spaceIV. Registers(A) I and II only(B) III only(C) IV only(D) III and IV only
• Consider a machine with byte addressable memory of 232 bytes divided into blocks of size 32 bytes. Assume a direct mapped cache having 512 cache lines is used with this machine. The size of tag field in bits is _____(A) 12(B) 16(C) 18(D) 24
• There are 3 red socks, 5 green socks and 3 blue socks. You choose 2 socks. The probability that they are of the same color is(A) 1/5(B) 7/30(C) 1/4(D) 16/55