TGPSC HMWSSB Manager Discrete Mathematics previous year questions with answers
Every Discrete Mathematics question asked in the TGPSC HMWSSB Manager (Engineering) papers on this site, grouped by topic. Answers come from TSPSC's final key; each has a short explanation (free here for a sample, all of them in the practice app).
Practise Discrete Mathematics onlineSets, Relations & Functions
Which of the following are partitions of {1,2,......8}?
- {{1,3,5},{1,2,6},{4,7,8}}
- {{1,3,5},{2,6,7},{4,8}}
- {{1,3,5},{2,6},{2,6},{4,7,8}}
- {{1,5},{2,6},{4,8}}
Show answer
Answer: (2) {{1,3,5},{2,6,7},{4,8}}
A partition of a set is a collection of non-empty, pairwise disjoint blocks whose union is the whole set. In (2) the blocks {1,3,5}, {2,6,7}, {4,8} share no element and together contain 1 to 8, so it is a partition. (1) has 1 in two blocks; (3) lists the block {2,6} twice, so its listed blocks are not pairwise disjoint (read strictly as a set, the repeated block would collapse into one, but the examiner treats the repetition as overlapping blocks); (4) leaves out 3 and 7.
Let A = {0,1} × {0,1} and B = {a, b, c}. Suppose A is listed in lexicographic order based on 0 < 1 and B is in alphabetic order. If A × B × A is listed in lexicographic order, then the next element after ((1,0), c, (1,1)) is ________.
- ((1,0), a, (0,0))
- ((1,1), c, (0,0))
- ((1,1) a, (0,0))
- ((1,1), a, (1,1))
Show answer
Answer: (3) ((1,1) a, (0,0))
A in lexicographic order is (0,0), (0,1), (1,0), (1,1). In ((1,0), c, (1,1)) the last component (1,1) is the largest element of A and c is the largest element of B, so both "roll over" to their smallest values (0,0) and a, and the first component moves up from (1,0) to (1,1). The next element is ((1,1), a, (0,0)).
Let P(A) denote the power set of A. If P(A) ⊆ B then
- 2^|A| ≤ |B|
- 2^|A| ≥ |B|
- 2^|A| ≥ 2^|B|
- 2|A| < |B|
Show answer
Answer: (1) 2^|A| ≤ |B|
The power set of A has 2^|A| elements. If P(A) is a subset of B, then B has at least as many elements as P(A), so |P(A)| = 2^|A| ≤ |B|.
The inverse of the function f(x) = x² − 5 is
- f⁻¹(y) = √(y + 5)
- f⁻¹(y) = √(y − 5)
- f⁻¹(y) = √y − 5
- f⁻¹(y) = √y + 5
Show answer
Answer: (1) f⁻¹(y) = √(y + 5)
Put y = x² − 5 and solve for x: x² = y + 5, so x = √(y + 5) (taking the non-negative root, i.e. treating f on x ≥ 0, where it is one-one). Check: f(√(y + 5)) = (y + 5) − 5 = y.
Mathematical Logic
A sufficient condition that a triangle T be a right triangle is that a² + b² + = c². An equivalent statement is
- If T is a right triangle then a² + b² = c²
- If a² + b² = c² then T is a right triangle
- T is a right triangle only if a² + b² = c²
- T is a right triangle unless a² + b² = c²
Show answer
Answer: (2) If a² + b² = c² then T is a right triangle
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
Consider the statement, "Given that people who are in need of refuge and consolation are apt to do odd things, it is clear that people who are apt to do odd things are in need of refuge and consolation." This statement, of the form (P ⇒ Q) ⇒ (Q ⇒ P)
- People who are in need of refuge and consolation are not apt to do odd things
- People are apt to do odd things if and only if they are in need of refuge and consolation
- People who are apt to do odd things are in need of refuge and consolation
- People who are in need of refuge and consolation are apt to do odd things
Show answer
Answer: (3) People who are apt to do odd things are in need of refuge and consolation
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
Consider the logical statement q → (p → q) Which of the following statements is true about the above statement?
- It is a Contradiction.
- It is a Tautology
- It is not a well formed statement
- It is a Inverse
Show answer
Answer: (2) It is a Tautology
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
Combinatorics & Probability
Let S = {1,2,..., n}. Let S₁ be the set of all subsets of S that contain 1. Let T₁ denote the set of all subsets of S that don't contain 1. Which of the following statement is correct?
- |T₁| = |S₁| = 2⁽ⁿ⁻¹⁾
- |T₁| ≠ |S₁|
- |T₁| + |S₁| = 2⁽ⁿ⁻¹⁾
- |T₁| + |S₁| = 2ⁿ
Show answer
Answer: (1) |T₁| = |S₁| = 2⁽ⁿ⁻¹⁾ / (4) |T₁| + |S₁| = 2ⁿ
A subset of S that contains 1 is fixed by choosing any subset of the other n − 1 elements, so |S₁| = 2ⁿ⁻¹; likewise a subset without 1 is any subset of {2,...,n}, so |T₁| = 2ⁿ⁻¹. Hence statement (1) is true, and since every subset of S falls in exactly one of the two classes, |T₁| + |S₁| = 2ⁿ⁻¹ + 2ⁿ⁻¹ = 2ⁿ, so statement (4) is also true. Because both are correct, TSPSC accepted both (1) and (4); (2) and (3) are false.
The number of ways of placing 7-similar balls in 5 distinct boxes is
- C(11,7)
- C(12,7)
- C(11,5)
- C(12,5)
Show answer
Answer: (1) C(11,7)
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
The number of ways of forming 5-member committee consisting of 2 girls and 3 boys from 10 girls and 20 boys
- C(10,2)+C(20,3)
- P(10,2)+P(20,3)
- P(10,2)P(20,3)
- C(10,2)C(20,3)
Show answer
Answer: (4) C(10,2)C(20,3)
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
How many terms will be there in the expansion of (x + y + z)⁶
- 15
- 28
- 35
- 45
Show answer
Answer: (2) 28
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
The mean of the distribution whose probability density function f(x) = {αe^(−αx), x ≥ 0; 0, x < 0} is
- 0
- 1
- 1/α
- α
Show answer
Answer: (3) 1/α
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
For a poisson distribution
- Mean = standard deviation
- Mean = variance
- Mean = mean deviation
- Mean = median
Show answer
Answer: (2) Mean = variance
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
Graph Theory
The chromatic number of null graph Nₙ is
- 0
- 1
- 2
- 3
Show answer
Answer: (2) 1
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
A connected graph contains 'n' vertices and 'm' edges then circuit rank is
- n−m
- m−(n−1)
- n−(m−1)
- m+n
Show answer
Answer: (2) m−(n−1)
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
A connected planar graph has 35 regions with degree 6 each, then number of vertices is____
- 35
- 70
- 72
- 96
Show answer
Answer: (3) 72
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
If G is a connected plane graph with E edges, V vertices and R regions, then the following is true
- |V| − |E| = 2
- |V| − |E| + |R| = 1
- |V| − |E| = 2 + |R|
- |V| + |R| = |E| + 2
Show answer
Answer: (4) |V| + |R| = |E| + 2
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
The minimum number of colours required to colour any connected planar graph is
- 3
- 4
- 5
- Connot decide
Show answer
Answer: (2) 4
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
Lattices & Algebraic Structures
Let D₃₀ = {1,2,3,5,6,10,15,30} and let the relation / (divides) be a partial order relation on D₃₀. Which of the following statements is correct?
- All the lower bounds of 10 and 15 are 1,2,3,5,6
- All the lower bounds of 10 and 15 are 1,2,3,5
- All the lower bounds of 10 and 15 are 1,5
- All the lower bounds of 10 and 15 are 2,3,5
Show answer
Answer: (3) All the lower bounds of 10 and 15 are 1,5
Under divisibility, a lower bound of 10 and 15 is an element of D₃₀ that divides both 10 and 15, i.e. a common divisor. The divisors of 10 are 1, 2, 5, 10 and of 15 are 1, 3, 5, 15, so the common ones are 1 and 5 (the greatest lower bound is 5 = gcd(10, 15)). 2, 3 and 6 each fail to divide one of the two numbers.
Let P(S) be the power set of S = {1,2,3}, and then define a lattice L under partial ordering of set inclusion induced on P(S). Which of the following sets are the sub-lattices of L. A = {∅, {1,2}, {2,3}, {1,2,3}} B = {∅, {1},{1,2}, {1,2,3}} C = {∅, {3}, {1,3}, {1,2,3}} D = {{1}, {3}, {1,3}, {1,2,3}} E = {∅,{3}, {1,2}, {1,2,3}}
- A and D are sub-lattices of L
- B and C are sub-lattices of L
- A is a sub-lattice of L
- D is a sub-lattice of L
Show answer
Answer: (2) B and C are sub-lattices of L
In L the join is ∪ and the meet is ∩, and a sub-lattice must be closed under both. B and C are chains (∅ ⊆ {1} ⊆ {1,2} ⊆ {1,2,3} and ∅ ⊆ {3} ⊆ {1,3} ⊆ {1,2,3}), and a chain is always closed under ∪ and ∩, so both are sub-lattices. A is not, because {1,2} ∩ {2,3} = {2} ∉ A, and D is not, because {1} ∩ {3} = ∅ ∉ D. (E is also closed under ∪ and ∩, but no option mentions it.)
A group has 11 elements. The number of proper sub-groups it can have is
- 0
- 4
- 5
- 8
Show answer
Answer: (1) 0
By Lagrange's theorem the order of a subgroup divides the order of the group. Since 11 is prime, the only subgroups are {e} (order 1) and the whole group (order 11), which are the trivial (improper) subgroups, so the group has no proper (non-trivial) subgroup. (Under the convention that {e} counts as proper there would be exactly one, which is not offered.)