BSc CSIT (TU) Science Discrete Structure (BSc CSIT, CSC160) Question Paper 2079
This is the official BSc CSIT (TU) (Science stream) Discrete Structure (BSc CSIT, CSC160) question paper for 2079, 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 2079 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt any TWO questions.
Define a set. Explain set operations with Venn diagrams. State and prove the principle of inclusion-exclusion for two and three sets.
What is a Boolean algebra? Explain Boolean functions. Minimize the Boolean function (F(x,y,z) = \Sigma(0,2,4,6)) using a Karnaugh map.
Define permutation and combination. In how many ways can the letters of the word 'COMPUTER' be arranged? How many of these arrangements begin with a vowel?
Section B: Short Answer Questions
Attempt any EIGHT questions.
Construct the truth table for (p \oplus q) (exclusive or).
Define floor and ceiling functions with examples.
What is a multiset? Give an example.
Find the gcd of 252 and 198 using the Euclidean algorithm.
Define weighted graph and give a real-life application.
What is a spanning tree? How many spanning trees does (K_3) have?
State the conditions for a graph to be Eulerian.
Define a Boolean expression and simplify (x + x'y).
How many ways can 5 people be seated around a circular table?