HamroCSIT Logo
HAMRO CSIT
  • Course New
  • Entrance
    • Entrance Preparation
    • MCQ Questions
    • Colleges
    • Entrance Class
    • Entrance Books
    • Free Entrance Video Course
  • Semester
    • First Semester
    • Second Semester
    • Third Semester
    • Fourth Semester
    • Fifth Semester
    • Sixth Semester
    • Seventh Semester
    • Eight Semester
  • Questions
  • Subscription Automated
  • Notices
  • Articles
  • More
    • Ask Question
    • College Ambassadors
    • Financial Support Program
    • Contribute
    • Contact Us
Login Register
Hamro CSIT User Account
  • Sign In
  • Create Account


Shape | Hamro CSIT Shape | Hamro CSIT Shape | Hamro CSIT Shape | Hamro CSIT
Subject

Discrete Structure

The course covers fundamental concepts of discrete structure like introduce logic, proofs, sets, relations, functions, counting, and probability, with an emphasis on applications in computer science.

Subject Image | Hamro CSIT
  • Chapters
  • Syllabus
  • Question Banks
  • Questions
  • Text Book
  • Practical
  • Viva

Exam Year

  • DS Question Bank 2082
  • DS Question Bank 2081
  • DS Question Bank 2080(new)
  • DS Question Bank 2080
  • DS Question Bank 2079
  • DS Question Bank 2075
  • DS Question Bank 2076
  • DS Question Bank 2078

Tribhuvan University

Institute of Science and Technology

2081

Bachelor Level / second-semester / Science

Computer Science and Information Technology( CSC165 )

Discrete Structure

Full Marks: 60 + 20 + 20

Pass Marks: 24 + 8 + 8

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

Attempt any TWO question.

1

list any four rules of inference. Using direct and indirect proof show that, for any real number x, if x3 – 7x2 + x – 7 = 0, then x = 7.

2

What are the necessary and sufficient conditions for graphs to have Euler path only and Euler circuit? Let R be a relation defined on set of natural numbers N, such that a,b∈N,aRb  ⟺  ab=2k, where k ∈ {0,1,2,…}. Show that R is a partial ordering relation on N.

3

Determine whether the function f(x) = x-1, from set of integers to the set of integers is injective, surjective or bijective. Write the type of Fuzzy set operations with their defination. Give the floor and ceiling value of 1.2 and -1.2.

SECTION B

Attempt any EIGHT question.

4

Find the GCD of 12 and 16 using Extended Euclidean Algorithm.

5

Using mathematical induction show that $$2+5+8+…+(3n−1) = \frac{{n(3n+1)}}{{2​}}.$$

6

State sum rule and product rule. If 26 integers are chosen from the set of consecutive integers {1,2,3,…,50}, prove that there are sure to be two numbers so that one is multiple of the other.

7

Discuss about meet and join operation between Boolean matrices. What are the values of 5 mod 75 and −5 mod 7?

8

Define chromatic number. How does Kruskal’s algorithm find Minimum Spanning Tree?

9

Solve the recurrence relation an = an−1 + 2an−2 with initial conditions a0​ = 2 and a1​ = 7.

10

What is network flow? Give an example of saturated edge, unsaturated edge, and slack.

11

When do we use permutation rather than combination? How many 5-digit numbers can be generated using the digits 0 to 9, if each number starts with 98 and no digit appears more than once?

12

Define subset and power set. How do you prove correctness of recursive algorithm using Induction? Illustrate with an example.

Discrete Structure Question Bank Solution 2081
Solution Video
Solution
Share

Share this link via

Or copy link

logoHAMROCSIT

Hamro CSIT is a comprehensive web and mobile platform that provides B.Sc. CSIT students with resources like notes, syllabi, question banks, solved past papers, practical files, and free entrance preparation materials — all in one place.

  • [email protected]
Semester
  • First Semester
  • Second Semester
  • Third Semester
  • Fourth Semester
  • Fifth Semester
  • Sixth Semester
  • Seventh Semester
  • Eighth Semester
Links
  • About Us
  • FAQs
  • Sitemap
  • Privacy Policy
  • Terms and Conditions
  • College Ambassadors
  • Financial Support Program
Hits Counter
20237380
Google Play App Store
Follow Us

Copyright 2026 | HAMROCSIT | All Right Reserved

Official Payment Partner Esewa Logo
HAMROCSIT.COM

Copyright 2024 | HAMROCSIT.COM | All Right Reserved - Nymna Technology