GATE CS Sets, Relations and Functions questions
Practise Sets, Relations and Functions questions for GATE CS. Explore official PYQs and original topic-wise quizzes, check answers and view available solutions. Free, no sign-in.
Subject, topic, year and type filter the full library. Match any choice within a filter, and all selected filter categories. Search, source and sort apply to this page.
20 on this page
A polynomial satisfies the following: The minimum degree of such a polynomial is
Let be a set with a relation which is transitive, anti-symmetric and reflexive and for any two elements , let the least upper bound and the greatest lower bound exist. Which of the following is/are true?
The number of binary relations on a set with elements is:
In a room containing people, there are people who speak English, people who speak Hindi and people who speak Kannada. persons speak both English and Hindi, persons speak both Hindi and Kannada whereas persons speak both Kannada and English. How many speak all three languages?
The binary relation on the set is
The number of functions from an element set to an element set is
Let and be two equivalence relations on a set. Consider the following assertions: is an equivalence relation is an equivalence relation Which of the following is correct?
Suppose is a finite set with elements. The number of elements in the largest equivalence relation of A is
A polynomial is such that and . The minimum degree it should have is
Let be a non-empty relation on a collection of sets defined by if and only if . Then, (pick the true statement)
Let denote the set of real numbers. Let be a bijective function defined by . The inverse function of is given by
Suppose and are sets and are their respective cardinality. It is given that there are exactly functions from to . From this one can conclude that
Let and be sets and let and denote the complements of the sets and . The set is equal to
Determine the number of positive integers which are not divisible by any of or
Determine the number of divisors of
The number of elements in the power set of the set is:
Let be a symmetric and transitive relation on a set . Then
Every subset of a countable set is countable. State whether the above statement is true or false with reason.
Let and be sets with cardinalities and respectively. The number of one-one mappings from to , when , is
Let be an infinite set and be sets such that . Then
