Tribhuvan University
Bachelor of Science in Computer Science and Information Technology
Semester 2 · TU Board 2079
Course Title: Discrete Structure (CSC165)
Full Marks: 60Pass Marks: 24Time: 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.
Group A
(2 × 10 = 20)
- 1.10
How do you plot the function on graph? Determine whether the function f(x) = x^2 is injective, surjective or bijective with reasons. Solve the recurrence relation a_n = 6a_n-1 – 9a_n-2 with initial conditions a_0 = 1 and a_1 = 6.
- 2.10
A group of 8 scientist is composed of 5 chemist and 3 biologist. In how many ways can a committe of 5 be formed that has 3 chemist and 2 biologist? Using mathematical induction prove that 1^3 + 2^3 + 3^3 + ……………….. + n^3 = n^2(n + 1)^2 / 4) for n ≥ 1.
- 3.10
Show that the relation R = {(a, b): |a – b| is even} is an equivalence relation in the set of integers. Given the following transport network with the edges labeled with their capacities, find all S-D and their capacities and What is the minimum capacity?
[figure in the original paper]
Group B
(8 × 5 = 40)
- 4.5
List any one example of tautology. Represent the following sentences into predicate logic.
- Not all employees are loyal
- All students having good attitude are lovable.
- 5.5
Prove that "If the product of two integers a and b are even then either a is even or b is even", using the contradiction method.
- 6.5
Use Chinese Remainder Theorem to find the value of x such that x = 0 ( MOD 2) , x = 2 (MOD 3) and x = 3 (MOD 5).
Answer comingAlso asked in 2076, 2075
- 7.5
Define bipartile graph with example. State the necessary conditions for the graphs to be isomorphic.
Answer comingAlso asked in 2082
- 8.5
State Generalized Pigeonhole Principle. Find the MST from following graph using Kruskal algorithm.
[figure in the original paper]
- 9.5
Given the premises "If it rains or strike holds then the exam will be cancelled. If the doesn't rain then it will be sunny day. The exam was not cancelled. show that it is sunny day".
- 10.5
Find the value of -2 MOD 3 and 3^1^5 MOD 5. Illustrate an example to show the join operation between any two boolean matrixes.
- 11.5
Given an example of fallacy. State the necessary and sufficient conditions for a graph to have Euler path and Euler circuit.
- 12.5
Find the GCD of 24 and 32 using Extended Euclidean algorithm.
Answer comingAlso asked in 2082, 2081, 2080
— The End —