Home / GATE 2017-2018 / GATE CSE :: Practice Test Paper 2

GATE 2017-2018 :: GATE CSE

  1. A binary operation ⊕ on a set of integers is defined as x⊕y = x2 + y2 . Which one of the following statements is TRUE about ⊕?
  2. A.
    Commutative but not associative
    B.
    Both commutative and associative
    C.
    Associative but not commutative
    D.
    Neither commutative nor associative

  3. Suppose p is the number of cars per minute passing through a certain road junction between 5 PM and 6 PM, and p has a Poisson distribution with mean 3. What is the probability of observing fewer than 3 cars during any given minute in this interval?
  4. A.
    8/(2e3)
    B.
    9/(2e3)
    C.
    17/(2e3)
    D.
    26/(2e3)

  5. Which one of the following does NOT equal  ?
  6. A.
    .

    B.
    .

    C.
    .

    D.
    .


  7. In the following truth table, V = 1 if and only if the input is valid.

    What function does the truth table represent?
  8. A.
    Priority encoder
    B.
    Decoder
    C.
    Multiplexer
    D.
    Demultiplexer

  9. Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?
  10. A.
    O(log n)
    B.
    O(n)
    C.
    O(n log n)
    D.
    O(n2)

  11. Consider the languages L1 = φ and L2 ={a}. Which one of the following represents L1L2* ᴜ L3* ?
  12. A.
    {Ñ”}
    B.
    Φ
    C.
    a*
    D.
    {Ñ”, a}

  13. What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production (i.e., of type A → є and A → a) to parse a string with n tokens?
  14. A.
    n/2
    B.
    n - 1
    C.
    2n-1
    D.
    2n

  15. A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?
  16. A.
    This algorithm is equivalent to the first-come-first-serve algorithm.
    B.
    This algorithm is equivalent to the round-robin algorithm.
    C.
    This algorithm is equivalent to the shortest-job-first algorithm.
    D.
    This algorithm is equivalent to the shortest-remaining-time-first algorithm.

  17. Match the problem domains in GROUP I with the solution technologies in GROUP II.
    GROUP I                                            GROUP II
    (P) Service oriented computing       (1) Interoperability
    (Q) Heterogeneous communicating
          systems                                          (2) BPMN
    (R) Information representation        (3) Publish-find-bind
    (S) Process description                      (4) XML
  18. A.
    P-1, Q-2, R-3, S-4
    B.
    P-3, Q-4, R-2, S-1
    C.
    P-3, Q-1, R-4, S-2
    D.
    P-4, Q-3, R-2, S-1

  19. The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are
  20. A.
    TCP, UDP, UDP and TCP
    B.
    UDP, TCP, TCP and UDP
    C.
    UDP, TCP, UDP and TCP
    D.
    TCP, UDP, TCP and UDP