BSc CSIT (TU) Science Discrete Structure (BSc CSIT, CSC160) Question Paper 2074
This is the official BSc CSIT (TU) (Science stream) Discrete Structure (BSc CSIT, CSC160) question paper for 2074, 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 2074 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt any TWO questions.
Define proposition. Construct the truth table for the compound proposition ((p \rightarrow q) \leftrightarrow (\neg q \rightarrow \neg p)) and determine whether it is a tautology.
What is mathematical induction? Using the principle of mathematical induction, prove that (1 + 2 + 3 + \dots + n = n(n+1)/2) for all positive integers n.
Define a graph. Explain the different types of graphs with examples. Describe the adjacency matrix and incidence matrix representation of a graph.
Section B: Short Answer Questions
Attempt any EIGHT questions.
Convert the decimal number 245 into binary, octal and hexadecimal.
Define conjunction, disjunction and negation with truth tables.
What is a bijective function? Give an example.
State the principle of inclusion and exclusion.
Explain the difference between a walk, path and circuit in a graph.
Define equivalence relation with an example.
Solve the recurrence relation (a_n = 2a_{n-1}), (a_0 = 3).
What is a planar graph? State Euler's formula for planar graphs.
Find the number of ways to select 3 students from a group of 10.