Discrete Structures & Theory of Logic Unit 1 – Set Theory, Relations, POSET & Lattices: AKTU previous year questions
36 AKTU questions from Unit 1 (Set Theory, Relations, POSET & Lattices) asked in 2020–2026, tagged by marks, year and topic. In short: about 32 marks of every paper come from this unit; the most asked topic is Relations (15 times); 8 questions came back in a later year. The latest ones are listed below; on the page you can filter them by 2-mark or long questions, topic and repeats.
Unit 1 previous year questions
- Define Lattice and the properties of lattice. (7 marks, 2026, Lattices)
- If R is an equivalence relation on A, then prove that R-1 is also equivalence relation on A. (7 marks, 2026, Relations)
- Define a lattice and state the meaning of upper bound and lower bound in a lattice. (2 marks, 2026, Lattices)
- Explain the following terms: (i) POSET (ii) Hasse Diagram (7 marks, 2026, POSET & Hasse Diagram)
- Let A = {x: x is a prime number less than 20} and B = {x: x is an odd number less than 20} Compute A U B and A ∩ B. (2 marks, 2025, Set Theory)
- Let A = {1,2,3} and B = {a, b} Compute the total number of possible relations from A to B. (2 marks, 2025, Relations)
- Examine R = {(a, b) | a ≡ b (mod m)} is an equivalence relation on Z. Also ensure that if x1 ≡ y1 and x2 ≡ y2 then (x1 + x2) ≡ (y1 + y2). (7 marks, 2025, Relations)
- Let R = {(1, 2), (2, 3), (3, 1)} defined on A = {1, 2, 3}. Calculate the transitive closure of R using Warshall’s algorithm. (7 marks, 2025, Relations)
- i) Justify that (D42, \) is lattice. ii) Let L1 be the lattice defined as D6 and L2 be the lattice (P(S), ≤), where P(S) be the power set defined on set S = {a, b}. Justify that the two lattices are isomorphic. (7 marks, 2025, Lattices)
- Determine the greatest lower bound and least upper bound of the set {2, 3, 6}, if they exist, in the Poset (D24, /). (2 marks, 2024, POSET & Hasse Diagram)
- Express power set of each of these sets. 1) {Ø,{ Ø}} 2) {a,{a}} (2 marks, 2024, Set Theory)
- Construct the Hasse Diagram for (P(S), ⊆) where P(S) is a power set defined on set S={a, b, c}. Determine whether it is a Lattice or not. (7 marks, 2024, POSET & Hasse Diagram)
Most asked Unit 1 topics
- Relations – asked 15 times
- Set Theory – asked 8 times
- Lattices – asked 8 times
Unit 1 question pattern
- 2-mark questions: 14 asked in 2020–2026
- 7-mark questions: 9 asked in 2020–2026
- 10-mark questions: 13 asked in 2020–2026
- About 32 marks from Unit 1 in every paper
- 8 questions were asked again in a later year
Unit 1 questions year by year
- 2026: 4 Unit 1 questions asked (23 marks across that year's papers)
- 2025: 5 Unit 1 questions asked (25 marks across that year's papers)
- 2024: 5 Unit 1 questions asked (25 marks across that year's papers)
- 2023: 7 Unit 1 questions asked (38 marks across that year's papers)
- 2022: 4 Unit 1 questions asked (32 marks across that year's papers)
- 2021: 6 Unit 1 questions asked (44 marks across that year's papers)
- 2020: 5 Unit 1 questions asked (34 marks across that year's papers)