BSc CSIT (TU) Science Discrete Structure (BSc CSIT, CSC160) Question Paper 2077
This is the official BSc CSIT (TU) (Science stream) Discrete Structure (BSc CSIT, CSC160) question paper for 2077, 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 2077 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt any TWO questions.
Define quantifiers. Translate the following into logical expressions using predicates and quantifiers, and find their negations: (a) Every student in this class has studied calculus. (b) Some student in this class owns a computer.
State and explain the pigeonhole principle. How many cards must be selected from a standard deck of 52 cards to guarantee that at least three cards of the same suit are chosen? Also solve a generalized example.
Define relation. Explain reflexive, symmetric, antisymmetric and transitive relations with examples. What is an equivalence relation? Show that congruence modulo m is an equivalence relation.
Section B: Short Answer Questions
Attempt any EIGHT questions.
State De Morgan's laws for sets and for logic.
Define onto and one-to-one functions.
Solve (a_n = a_{n-1} + 2n), (a_0 = 1) for (a_3).
What is the degree of a vertex? State the handshaking theorem.
Define a subgroup with an example.
Differentiate between a tree and a graph.
Write the contrapositive, converse and inverse of 'If it rains then the ground is wet'.
How many bit strings of length 8 contain exactly three 1's?
Define adjacency matrix of a directed graph with an example.