GATE CSE 2014 SET-2
Q31.
Each of the nine words in the sentence "The quick brown fox jumps over the lazy og" is written on a separate piece of paper. These nine pieces of paper are kept in a box. One of the pieces is drawn at random from the box. The expected length of the word drawn is _____________. (The answer should be rounded to one decimal place)Q32.
The probability that a given positive integer lying between 1 and 100 (both inclusive) is NOT divisible by 2, 3 or 5 is ______ .Q33.
The security system at an IT office is composed of 10 computers of which exactly four are working. To check whether the system is functional, the officials inspect four of the computers picked at random (without replacement). The system is deemed functional if at least three of the four computers inspected are working. Let the probability that the system is deemed functional be denoted by p. Then 100p= _____________.Q34.
Consider the procedure below for the Producer-Consumer problem which uses semaphores: Which one of the following is TRUE?Q35.
In the diagram shown below, L1 is an Ethernet LAN and L2 is a Token-Ring LAN. An IP packet originates from sender S and traverses to R, as shown. The links within each ISP and across the two ISPs, are all point-to-point' optical links. The initial value of the TTL field is 32. The maximum possible value of the TTL field when R receives the datagram is ____________.Q36.
Which one of the following is TRUE about the interior gateway routing protocols - Routing Information Protocol (RIP) and Open Shortest Path First (OSPF)?Q38.
Which one of the following correctly determines the solution of the recurrence relation with T(1) = 1? T(n)=2T(\frac{n}{2})+lognQ39.
If L_{1}=\{a^{n}|n\geq 0\} and L_{2}=\{b^{n}|n\geq 0 \}, Consider (I) L_{1}\cdot L_{2} is a regular language (II) L_{1} \cdot L_{2}= \{a^{n}b^{n}|n \geq 0\} Which one of the following is CORRECT?Q40.
Consider a join (relation algebra) between relations r(R)and s(S) using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for intermediate results. Assuming size(r(R))\ltsize(s(S)), the join will have fewer number of disk block accesses if