BSc CSIT (TU) Science Discrete Structure (BSc CSIT, CSC160) Question Paper 2075
This is the official BSc CSIT (TU) (Science stream) Discrete Structure (BSc CSIT, CSC160) question paper for 2075, 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 2075 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt any TWO questions.
What are rules of inference? Show that the premises (p \rightarrow q), (q \rightarrow r) and (p) lead to the conclusion r using rules of inference.
Define recurrence relation. Solve the recurrence relation (a_n = 5a_{n-1} - 6a_{n-2}) with initial conditions (a_0 = 1) and (a_1 = 0).
Define tree and spanning tree. Explain Kruskal's algorithm to find a minimum spanning tree with a suitable example.
Section B: Short Answer Questions
Attempt any EIGHT questions.
Show that (p \rightarrow q) is logically equivalent to (\neg p \lor q).
Define power set. Write the power set of {a, b, c}.
What is a partial order relation? Give an example.
State the pigeonhole principle with an example.
Define complete graph and bipartite graph.
Find the number of edges in a complete graph with 6 vertices.
Define a tree and state its basic properties.
What is a tautology and a contradiction? Give one example of each.
Define the composition of two functions with an example.