BSc CSIT (TU) Science Discrete Structure (BSc CSIT, CSC160) Question Paper 2081
This is the official BSc CSIT (TU) (Science stream) Discrete Structure (BSc CSIT, CSC160) question paper for 2081, as set in the regular annual examination. It carries 60 full marks and a time allowance of 180 minutes, across 12 questions. On Kekkei you can attempt this Discrete Structure (BSc CSIT, CSC160) past paper online with a timer, get instant AI feedback and step-by-step solutions, and track the topics where you lose marks — completely free. Whether you are revising for your BSc CSIT (TU) Discrete Structure (BSc CSIT, CSC160) exam or solving previous years' question papers, this 2081 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt any TWO questions.
Define lattice. Explain partially ordered sets (poset) and draw a Hasse diagram for the divisibility relation on the set {1, 2, 3, 6, 12, 24, 36}. Identify the maximal, minimal, greatest and least elements.
What is generating function? Use generating functions to solve the recurrence relation (a_n = 3a_{n-1} + 2) with (a_0 = 1).
Explain Euler and Hamiltonian paths and circuits with examples. State the necessary and sufficient conditions for the existence of an Euler circuit in a connected graph.
Section B: Short Answer Questions
Attempt any EIGHT questions.
Differentiate between proof by contradiction and proof by contraposition.
Define the inverse and identity functions.
What is the symmetric difference of two sets? Give an example.
Define a poset and Hasse diagram.
State Dijkstra's algorithm in brief.
What is a rooted tree? Define the height of a tree.
Define a cyclic group with an example.
Use the Euclidean algorithm to find gcd(414, 662).
Find the coefficient of (x^5) in ((1+x)^{10}).