GATE CS 2025 (Afternoon) — Question 42

Discrete MathematicsSets, Relations, Functions, Partial Orders, LatticesMSQ2 marksHard

Let \( F \) be the set of all functions from \( \{1, \dots, n\} \) to \( \{0, 1\} \). Define the binary relation \( \preceq \) on \( F \) as follows: \( \forall f, g \in F, f \preceq g \) if and only if \( \forall x \in \{1, \dots, n\}, f(x) \le g(x) \), where \( 0 \le 1 \). Which of the following statement(s) is/are TRUE?
  1. A
    \( \preceq \) is a symmetric relation
  2. B
    \( (F, \preceq) \) is a partial order
  3. C
    \( (F, \preceq) \) is a lattice
  4. D
    \( \preceq \) is an equivalence relation
Practise the full 2025-AN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkDiscrete Mathematics and Its Applications (Rosen)Logic, sets, relations, combinatorics and graph theory, with worked examples.
Practise more on Sets, Relations, Functions, Partial Orders, LatticesTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group