BIT152 Discrete Structure

Discrete Structure old question papers

Pick a year on the left to see the full paper, exactly as it was set. 2 questions have come up in more than one paper.

12 questionsSit this paper (timed)

Tribhuvan University

Bachelor of Information Technology

Semester 2 · TU Board 2080

Course Title: Discrete Structure (BIT152)

Full Marks: 60Pass Marks: 24Time: 3 hours

Candidates are required to give their answers in their own words as far as practicable.

Group A

Attempt any Two questions.(2 × 10 = 20)

  1. 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.

    10
  2. 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.

    10
  3. 3.

    What does connectivity in graphs mean? Differentiate between permutation and combination. Solve the recurrence relation with initial conditions and .

    10

Group B

Attempt any Eight questions(8 × 5 = 40)

  1. 4.

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

    5
  2. 5.

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

    5
  3. 6.

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

    5
  4. 7.

    Prove that is irrational number.

    5
  5. 8.

    Solve the system of following congruences using Chinese Remainder theorem.

    5
  6. 9.

    What is pigeonhole principle? Show that where and are positive integers with .

    5
  7. 10.

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

    5
  8. 11.

    Explain incidence matrix representation of a graph with example.

    5
  9. 12.

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

    5

— The End —