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

GATE 2017-2018 :: GATE CSE

  1. What is the correct translation of the following statement into mathematical logic? 
    "Some real numbers are rational
  2. A.
    ÆŽx (real(x) á´  rational(x))
    B.
    Ǝx (real(x) →
    C.
    ÆŽx (real(x) á´§ rational(x))
    D.
    Ǝx (rational(x) →

    View Answer

    Workspace

    Discuss Discuss in Forum


  3. Given the basic ER and relational models, which of the following is INCORRECT?
  4. A.
    An attribute of an entity can have more than one value
    B.
    An attribute of an entity can be composite
    C.
    In a row of a relational table, an attribute can have more than one value
    D.
    In a row of a relational table, an attribute can have exactly one value or a NULL value

    View Answer

    Workspace

    Discuss Discuss in Forum


  5. Which of the following statements are TRUE about an SQL query? 
    P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause 
    Q: An SQL query can contain a HAVING clause only if it has a GROUP BY clause 
    R : All attributes used in the GROUP BY clause must appear in the SELECT clause 
    S : Not all attributes used in the GROUP BY clause need to appear in the SELECT clause
  6. A.
    P and R
    B.
    P and S
    C.
    Q and R
    D.
    Q and S

    View Answer

    Workspace

    Discuss Discuss in Forum


  7. The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is
  8. A.
    T(n) = 2T(n − 2) + 2
    B.
    T(n) = 2T(n − 1) + n
    C.
    T(n) = 2T(n/2) + 1
    D.
    T(n) = 2T(n − 1) + 1

    View Answer

    Workspace

    Discuss Discuss in Forum


  9. Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to
  10. A.
    3
    B.
    4
    C.
    5
    D.
    6

    View Answer

    Workspace

    Discuss Discuss in Forum


  11. Let W(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. Which of the following is ALWAYS TRUE?
  12. A.
    A(n) = Ω (W(n))
    B.
    A(n) = Θ (W(n))
    C.
    A(n) = O (W(n))
    D.
    A(n) = o (W(n))

    View Answer

    Workspace

    Discuss Discuss in Forum


  13. The amount of ROM needed to implement a 4 bit multiplier is
  14. A.
    64 bits
    B.
    128 bits
    C.
    1 Kbits
    D.
    2 Kbits

    View Answer

    Workspace

    Discuss Discuss in Forum


  15. Register renaming is done in pipelined processors
  16. A.
    as an alternative to register allocation at compile time
    B.
    for efficient access to function parameters and local variables
    C.
    to handle certain kinds of hazards
    D.
    as part of address translation

    View Answer

    Workspace

    Discuss Discuss in Forum


  17. Consider a random variable X that takes values +1 and −1 with probability 0.5 each. The values of the cumulative distribution function F(x) at x = −1 and +1 are
  18. A.
    0 and 0.5
    B.
    0 and 1
    C.
    0.5 and 1
    D.
    0.25 and 0.75

    View Answer

    Workspace

    Discuss Discuss in Forum


  19. Which of the following transport layer protocols is used to support electronic mail?
  20. A.
    SMTP
    B.
    IP
    C.
    TCP
    D.
    UDP

    View Answer

    Workspace

    Discuss Discuss in Forum