GATE CSE 2020


Q1.

Assume that you have made a request for a web page through your web browser to a web server. Initially the browser cache is empty. Further, the browser is configured to send HTTP requests in non-persistent mode. The web page contains text and five very small images.The minimum number of TCP connections required to display the web page completely in your browser is__________.
GateOverflow

Q2.

Consider the following C program. #include < stdio.h > int main () { int a[4] [5] = {{1, 2, 3, 4, 5}, {6, 7,8, 9, 10}, {11, 12, 13, 14, 15}, {16, 17,18, 19, 20}}; printf("%d\n", *(*(a+**a+2)+3)); return(0); }The output of the program is _______.
GateOverflow

Q3.

The preorder traversal of a binary search tree is 15,10,12,11,20,18,16,19. Which one of the following is the postorder traversal of the tree?
GateOverflow

Q4.

In a balanced binary search tree with n elements, what is the worst case time complexity of reporting all elements in range [a,b]? Assume that the number of reported elements is k.
GateOverflow

Q5.

What is the worst case time complexity of inserting n^2 elements into an AVL-tree with n elements initially?
GateOverflow

Q6.

A direct mapped cache memory of 1 MB has a block size of 256 bytes. The cache has an access time of 3 ns and a hit rate of 94%. During a cache miss, it takes 20 ns to bring the first word of a block from the main memory, while each subsequent word takes 5 ns. The word size is 64 bits. The average memory access time in ns (round off to 1 decimal place) is______.
GateOverflow

Q7.

A computer system with a word length of 32 bits has a 16 MB byte- addressable main memory and a 64 KB, 4-way set associative cache memory with a block size of 256 bytes. Consider the following four physical addresses represented in hexadecimal notation. A1=0x42C8A4, A2=0x546888, A3=0x6A289C, A4=0x5E4880 Which one of the following is TRUE?
GateOverflow

Q8.

Consider the functions I. e^{-x} II. x^2-\sin x III. \sqrt{x^3+1} Which of the above functions is/are increasing everywhere in [0,1] ?
GateOverflow

Q9.

The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L's are indistinguishable, is ______.
GateOverflow

Q10.

Consider the following languages. L_1=\{wxyx|w,x,y \in (0+1)^+\} L_2=\{xy|x,y \in (a+b)^*,|x|=|y|,x\neq y\} Which one of the following is TRUE?
GateOverflow