GATE Engineering Mathematics: Discrete Mathematics: Sets, Relations, Functions, Partial Orders and Lattices – Previous Year Questions
16 GATE previous year questions on Discrete Mathematics: Sets, Relations, Functions, Partial Orders and Lattices (Engineering Mathematics, Computer Science) with answers and explanations, from every paper.
- GATE 2016 CS Q38 – A function f : N+ N+, defined on the set of positive integers N+, satisfies the following properties: f(n) = f(n/2) if n is even f(n) = f(n+5) if n is…
- GATE 2015 CS Q11 – If g(x) = 1 - x and h(x) = xx-1, then g(h(x))h(g(x)) is:
- GATE 2015 CS Q20 – For a set A, the power set of A is denoted by 2A. If A = \5, \6\, \7\\, which of the following options are TRUE? I. 2A II. 2A III. \5, \6\\ 2A IV. \5,…
- GATE 2015 CS Q42 – Suppose L = \p, q, r, s, t\ is a lattice represented by the following Hasse diagram: [Hasse diagram: p is the bottom, t is the top, and q, r, s are…
- GATE 2018 CS Q37 – Let N be the set of natural numbers. Consider the following sets. P: Set of Rational numbers (positive and negative) Q: Set of functions from \0,1\ to…
- GATE 2019 CS Q31 – The value of 351 mod 5 is .
- GATE 2019 CS Q64 – In an RSA cryptosystem, the value of the public modulus parameter n is 3007. If it is also known that (n)=2880, where () denotes Euler's Totient…
- GATE 2026 CS (CS2) Q26 – Let R be a binary relation on the set \1,2,,10\, where (x,y) R if the product xy is the square of an integer. Which of the following properties is/are…
- GATE 2025 CS (CS2) Q42 – Let F be the set of all functions from \1,,n\ to \0,1\. Define the binary relation on F as follows: f, g F,\ f g if and only if x \1,,n\,\ f(x) g(x),…
- GATE 2025 CS (CS1) Q17 – g(.) is a function from A to B, f(.) is a function from B to C, and their composition defined as f(g(.)) is a mapping from A to C. If f(.) and f(g(.))…
- GATE 2025 CS (CS1) Q58 – Consider a probability distribution given by the density function P(x). P(x) = cases Cx2, & for 1 x 4 \\ 0, & for x < 1 or x > 4 cases The probability…
- GATE 2024 CS (CS2) Q34 – Let P be the partial order defined on the set \1,2,3,4\ as follows: P=\(x,x) x\1,2,3,4\\\(1,2),(3,2),(3,4)\. The number of total orders on \1,2,3,4\…
- GATE 2024 CS (CS1) Q32 – Let A and B be non-empty finite sets such that there exist one-to-one and onto functions (i) from A to B and (ii) from A A to A B. The number of…
- GATE 2023 CS Q49 – Let f: A B be an onto (or surjective) function, where A and B are nonempty sets. Define an equivalence relation on the set A as a 1 a 2 if f(a 1) =…
- GATE 2021 CS Q53 – A relation R is said to be circular if aRb and bRc together imply cRa. Which of the following options is/are correct?
- GATE 2020 CS Q27 – Let R be the set of all binary relations on the set \1,2,3\. Suppose a relation is chosen from R at random. The probability that the chosen relation…