BIT 2nd Semester
Discrete Structure Board Question Paper 2080

Views: ...

BIT 152-2080 ✡

Tribhuvan University

Institute of Science and Technology

TUpapers.com TUpapers.com
Bachelor Level/First Year/Second Semester/Science
Bachelors in Information Technology (BIT 152)
(Discrete Structure)
Full Marks: 60 Pass Marks: 24 Time: 3 hours

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

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

Explain how set operations can be represented using venn diagram with example. Convert the following sentences using quantifier.
a. Not all good peoples are heroes.
b. Every peoples in our country are loyal.
c. Some people hate good people.

2.

State ceiling function and floor function with examples. How mathematical induction can be used to prove the correctness of recursive algorithm? Illustrate with an example.

3.

What does connectivity in graphs mean? Differentiate between permutation and combination. Solve the recurrence relation \( a_n = 7a_{n-1} - 10a_{n-2} \) with initial conditions \( a_0 = 2 \) and \( a_1 = 3 \).

Section B

Attempt any Eight questions

[8×5=40]
4.

Describe pre-order, postorder and inorder traversal of a tree with an example.

5.

Explain one-to-one and onto function with example. What is identity function?

6.

How can you represent relations using matrices? Explain with suitable example.

7.

Prove that \(\sqrt{2}\) is irrational number.

8.

Solve the system of following congruences using Chinese Remainder theorem.
\[ x \equiv 2 \, (\text{mod} \, 3) \]\[ x \equiv 3 \, (\text{mod} \, 5) \]\[ x \equiv 2 \, (\text{mod} \, 7) \]

9.

What is pigeonhole principle? Show that \( \binom{n+1}{k} = \binom{n}{k-1} + \binom{n}{k} \) where \( n \) and \( k \) are positive integers with \( n \geq k \).

10.

What is permutation? What is the next permutation in lexicographic order after 362541?

11.

Explain incidence matrix representation of a graph with example.

12.

Define tree traversal. Explain pre-order traversal with example.