Gate IT 2005

Last Updated :
Discuss
Comments

Question 1

Which of the following statements is FALSE regarding a bridge?

  • Bridge is a layer 2 device

  • Bridge reduces collision domain

  • Bridge is used to connect two or more LAN segments

  • Bridge reduces broadcast domain

Question 2

Which of the following statements is TRUE about CSMA/CD  

  • IEEE 802.11 wireless LAN runs CSMA/CD protocol

  • Ethernet is not based on CSMA/CD protocol

  • CSMA/CD is not suitable for a high propagation delay network like satellite network

  • There is no contention in a CSMA/CD network

Question 3

A network with CSMA/CD protocol in the MAC layer is running at 1 Gbps over a 1 km cable with no repeaters. The signal speed in the cable is 2 x 108 m/sec. The minimum frame size for this network should be 

 
 

  • 10000 bits
     

  • 10000 bytes
     

  • 5000 bits
     

  • 5000 bytes
     

Question 4

A channel has a bit rate of 4 kbps and one-way propagation delay of 20 ms. The channel uses stop and wait protocol. The transmission time of the acknowledgement frame is negligible. To get a channel efficiency of at least 50%, the minimum frame size should be  

  • 80 bytes

  • 80 bits

  • 160 bytes

  • 160 bits

Question 5

In a TDM medium access control bus LAN, each station is assigned one time slot per cycle for transmission. Assume that the length of each time slot is the time to transmit 100 bits plus the end-to-end propagation delay. Assume a propagation speed of 2 x 108 m/sec. The length of the LAN is 1 km with a bandwidth of 10 Mbps. The maximum number of stations that can be allowed in the LAN so that the throughput of each station can be 2/3 Mbps is

  • 3

  • 5

  • 10

  • 20

Question 6

Consider the following message M = 1010001101. The cyclic redundancy check (CRC) for this message using the divisor polynomial x5 + x4 + x2 + 1 is :  

  • 01110

  • 01011

  • 10101

  • 10110

Question 7

A function f defined on stacks of integers satisfies the following properties. f(∅) = 0 and f (push (S, i)) = max (f(S), 0) + i for all stacks S and integers i.

If a stack S contains the integers 2, -3, 2, -1, 2 in order from bottom to top, what is f(S)?

  • 6

  • 4

  • 3

  • 2

Question 8

In the following table, the left column contains the names of standard graph algorithms and the right column contains the time complexities of the algorithms. Match each algorithm with its time complexity.

 1. Bellman-Ford algorithm 2. Kruskal’s algorithm 3. Floyd-Warshall algorithm 4. Topological sorting A : O ( m log n) B : O (n3) C : O (nm) D : O (n + m)

  • 1→ C, 2 → A, 3 → B, 4 → D

  • 1→ B, 2 → D, 3 → C, 4 → A

  • 1→ C, 2 → D, 3 → A, 4 → B

  • 1→ B, 2 → A, 3 → C, 4 → D

Question 9

Let T(n) be a function defined by the recurrence T(n) = 2T(n/2) + √n for n ≥ 2 and T(1) = 1 Which of the following statements is TRUE?  

  • T(n) = θ(log n)

  • T(n) = θ(√n)

  • T(n) = θ(n)

  • T(n) = θ(n log n)

Question 10

Let a be an array containing n integers in increasing order. The following algorithm determines whether there are two distinct numbers in the array whose difference is a specified number S > 0.

C 
i = 0;
j = 1;
while (j < n )
{
    if (E) j++;
    else if (a[j] - a[i] == S) break;
    else i++;
}
if (j < n)
    printf("yes")
else
   printf ("no");

Choose the correct expression for E.

  • a[j] - a[i] > S

  • a[j] - a[i] < S

  • a[i] - a[j] < S

  • a[i] - a[j] > S

Tags:
GATE

There are 90 questions to complete.

Take a part in the ongoing discussion