GATE-CS-2007

Question 11

Consider a disk pack with 16 surfaces, 128 tracks per surface and 256 sectors per track. 512 bytes of data are stored in a bit serial manner in a sector. The capacity of the disk pack and the number of bits required to specify a particular sector in the disk are respectively:

• 256 Mbyte, 19 bits
• 256 Mbyte, 28 bits
• 512 Mbyte, 20 bits
• 64 Gbyte, 28 bit

Question 12

The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height h is:

• 2^h−1
• 2^h−1 -1
• 2^h+1-1
• 2^h+1

Question 13

The maximum number of binary trees that can be formed with three unlabeled nodes is:

• 1
• 5
• 4
• 3

Question 14

Which of the following sorting algorithms has the lowest worst-case complexity?

• Merge sort
• Bubble Sort
• Quick Sort
• Selection Sort

Question 15

Consider the following segment of C-code:

  int j, n;
  j = 1;
  while (j <= n)
        j = j*2; 

The number of comparisons made in the execution of the loop for any n > 0 is: Base of Log is 2 in all options.

• CEIL(logn) + 2
• n
• CEIL(logn)
• FLOOR(logn) + 2

Question 16

Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in Group 1 to entries in Group 2.

     Group I                          Group II
(P) Gang Scheduling              (1) Guaranteed Scheduling
(Q) Rate Monotonic Scheduling    (2) Real-time Scheduling
(R) Fair Share Scheduling        (3) Thread Scheduling

• P – 3 Q – 2 R – 1

• P – 1 Q – 2 R – 3

• P – 2 Q – 3 R – 1

• P – 1 Q – 3 R – 2

Question 17

Consider the following statements about user level threads and kernel level threads. Which one of the following statement is FALSE?

• Context switch time is longer for kernel level threads than for user level threads.
• User level threads do not need any hardware support.
• Related kernel level threads can be scheduled on different processors in a multi-processor system.
• Blocking one kernel level thread blocks all related threads.

Question 18

Which one of the following is a top-down parser?

• Recursive descent parser.
• Operator precedence parser.
• An LR(k) parser.
• An LALR(k) parser

Question 19

In Ethernet when Manchester encoding is used, the bit rate is:

• Half the baud rate.
• Twice the baud rate.
• Same as the baud rate.
• None of the above

Question 20

Which one of the following uses UDP as the transport protocol?

• HTTP
• Telnet
• DNS
• SMTP