CSIT 2nd Semester
Discrete Structure Board Question Paper 2080 Old Course


CSC 165-2080 ✡
Tribhuvan University
Institute of Science and Technology
2080
Bachelor Level/First Year/Second Semester/Science
Computer Science Information Technology (CSC 165)
(Discrete Structure)
(Old Course)
Full Marks:60 Pass Marks:24 Time:3 hours

Candidates are required to give their answers in their own words as for as practicable.
The figures in the margin indicate full marks

Section A
Long Answer Questions
Attempt any Two question.
[2x10=20]
1.

Explain proof by contraposition and proof by contradiction. Show that if n is an integer and n� + 5 is odd, then n is even using a) a proof by contraposition, b) a proof by contradiction.

2.

Define recurrence relation. Compare linear homogeneous recurrence relation with linear nonhomogeneous recurrence relation. What is the solution of the recurrence relation a? = -4a??1 � 4a??2 for n = 2, a0 = 0, a1 = 1?

3.

Explain graph as models of flow of Commodities. How do you find maximal flow in the transport network? State max-flow min-cut theorem.

Section B

Attempt any Eight questions

[8x5=40]
4.

How can you represent sets using bit strings? Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}. What bit strings represent the subset of all odd integers in U, the subset of all even integers in U, and the subset of integers not exceeding 5 in U?

5.

Define floor and ceiling function. What do you mean by exponential function?

6.

Define summation. What is the value of the double sum ?�??1 ?�??1(i + j)?

7.

Explain Euclidean algorithm. Use this algorithm to find gcd(111, 201).

8.

Find the Boolean product of A =

10
01
10
and B =
110
011
.

9.

Define predicate. Compare existential quantifier with universal quantifier.

10.

What is structural induction? Explain.

11.

What is the probability that a positive integer selected at random from the set of positive integers not exceeding 100 is divisible by either 2 or 5?

12.

Explain Hamilton path and circuit with suitable example.