GATE CSE 2013
Q31.
Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D.Q32.
In an IPv4 datagram, the M bit is 0, the value of HLEN is 10, the value of total length is 400 and the fragment offset value is 300. The position of the datagram, the sequence numbers of the first and the last bytes of the payload, respectively areQ33.
What is the logical translation of the following statement? "None of my friends are perfect."Q34.
Which one of the following is NOT logically equivalent to \neg \exists x(\forall y(\alpha )\wedge \forall z(\beta ))?Q35.
Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter. MultiDequeue(Q){ m = k while (Q is not empty) and (m > 0) { Dequeue(Q) m = m - 1 } } What is the worst case time complexity of a sequence of n queue operations on an initially empty queue?Q36.
Consider the languages L_{1}=\phi abd L_{2}=\{a\}. Which one of the following represents L_{1} L_{2}^{*} \cup L_{1}^{*}?Q37.
Consider a hard disk with 16 recording surfaces (0-15) having 16384 cylinders (0-16383) and each cylinder contains 64 sectors (0-63). Data storage capacity in each sector is 512 bytes. Data are organized cylinder-wise and the addressing format is (cylinder no., surface no., sector no.). A file of size 42797 KB is stored in the disk and the starting disk location of the file is (1200, 9, 40). What is the cylinder number of the last sector of the file, if it is stored in a contiguous manner?Q38.
A binary operation \oplus on a set of integers is defined as x \oplus y= x^{2}+y^{2}. Which one of the following statements is TRUE about \oplus ?Q39.
Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?Q40.
The number of elements that can be sorted in \Theta (log n) time using heap sort is