BSc CSIT (TU) Science Discrete Structure (BSc CSIT, CSC160) Question Paper 2078
This is the official BSc CSIT (TU) (Science stream) Discrete Structure (BSc CSIT, CSC160) question paper for 2078, 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 2078 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt any TWO questions.
Define logical equivalence. Using laws of logic (without truth table), show that (\neg(p \lor (\neg p \land q))) is logically equivalent to (\neg p \land \neg q).
What is a function? Explain one-to-one, onto and bijective functions with examples. When does the inverse of a function exist? Find the inverse of (f(x) = 2x + 3).
Explain Dijkstra's algorithm for finding the shortest path in a weighted graph. Apply it to find the shortest path from a source vertex to all other vertices in a given example graph.
Section B: Short Answer Questions
Attempt any EIGHT questions.
Define quantifiers with examples.
What is a recursive function? Give an example.
Define cardinality of a set. What are countable and uncountable sets?
State and explain the addition and multiplication rules of counting.
Define isomorphic graphs with an example.
What is a binary search tree? Give an example.
Prove that the sum of degrees of all vertices in a graph is even.
Define modular arithmetic. Compute (17 \bmod 5) and (-7 \bmod 3).
State the rules of inference: modus ponens and modus tollens.