Discrete Structures & Theory of Logic (BCS303) AKTU predicted paper 2026-27
AI-predicted paper for Discrete Structures & Theory of Logic based on 7 past papers (2020, 2021, 2022, 2023, 2024, 2025, 2026). NOT an official AKTU paper. Use as a revision tool only.
Paper pattern
- Section A: Attempt all questions. (14 marks)
- Section B: Attempt any THREE questions out of five. (21 marks)
- Section C: Attempt ONE question from each pair (a or b). (35 marks)
Why these questions
- Unit 3 (Theory of Logic) dominates — 26% avg weightage
- Asked every year: Relations, Functions
- Low priority (never asked): Graph Coloring
- Most repeated topic: Propositional Logic
Section A – 2-mark questions
- Define a lattice and state the meaning of upper bound and lower bound in a lattice.
- If P(x) represents "x is a prime number" and Q(x) represents "x is odd," write the following statements in predicate logic: (a) "There exists an even prime number." (b) "All prime numbers greater than 2 are odd."
- Construct inverse of the following statement “If I wake up early in the morning, then I will be healthy.”
- State and justify “Every cyclic group is an abelian group”.
- Explain pigeonhole principle with example.
- If L be a lattice, then for every a and b in L prove that a ˄ b = a if and only if a ≤ b.
- Let A = {1,2,3} and B = {a, b} Compute the total number of possible relations from A to B.
Section B – sample questions
- How many generators are there of the cyclic group G of order 10.
- Test the validity of the following argument. “If there was a ball game, then traveling was difficult. If they arrived on time, then traveling was not difficult. They arrived on time. Therefore, There was no ball game.”
- Define Modular Lattice. Justify that if ‘a’ and ‘b’ are the elements in a bounded distributive lattice and if ‘a’ has complement a′. then I) a ˅ (a′˄ b)=a˅ b II ) a˄ (a′˅ b)=a˄ b