Scribd
Upload
21 views

Discrete Structure

Uploaded by

dilipbudhathoki519
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
21 views

Discrete Structure

Uploaded by

dilipbudhathoki519
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

National College of Computer Studies

(NCCS-College of IT & Management) Full Marks: 60


Pass Marks: 30
Final Examination (2023) Time: 3 hours
Set A BSc.CSIT/ Second Semester/ CSC 160: Discrete Structure
Candidates are required to answer the questions in their own words as far as practicable.

Group A
Long Answer Questions.
Attempt Any Two Questions [2×10=20]
1. 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 an = 6an-1 – 9an-2 with initial conditions a0 = 1 and
a1 = 6
2. 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 + 23 + 33 +
……………….. + n3 = (n2(n + 1) / 4) for n ≥ 1.
3. State division and remainder algorithm. Suppose that the domain of the propositional function P(x)
consists of the integer 0, 1, 2, 3 and 4. Write out each of the following propositions using disjunctions,
conjunctions and negations.
a. ∃x P(x)
b. ∀x P(x)
c. ∃x ¬P(x)
d. ∀x ¬P(x)
e. ¬∃x P(x)
f. ¬∀x P(x)

Group B
Short Answer Questions.
Attempt Any Eight Questions: [8×5=40]
4. List any one example of tautology. Represent the following sentences into predicate logic.
a. Not all employees are loyal
b. All students having good attitude are lovable.
5. Prove that “If the product of two integers a and b is even then either a is even or b is even”, using
contradiction method.
6. 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).
7. State the necessary conditions for the graphs to be isomorphic.
8. State Generalized Pigeonhole Principle. Find the MST from following graph using Kruskal algorithm.

9. 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. Prove that if n is positive integer, then n is odd if and only if 5n + 6 is odd.
11. Given an example of fallacy. State the necessary and sufficient conditions for a graph to have Euler path
and Euler circuit.
12. Find the GCD of 24 and 32 using Extended Euclidean algorithm.

********
National College of Computer Studies
(NCCS-College of IT & Management) Full Marks: 60
Pass Marks: 30
Final Examination (2023) Time: 3 hours
Set B BSc.CSIT/ Second Semester/ CSC 160: Discrete Structure
Candidates are required to answer the questions in their own words as far as practicable.
Group A
Long Answer Questions.
Attempt Any Two Questions: [2×10=20]
1. State pigeonhole principle. Solve the recurrence relation an = 3an-1 – 3an-2 + an-3 with initial conditions a0 =1
, a1 = 3, a2 = 7.
2. Find the value of x such that x = 1 (mod 3), x = 1 (mod 4), x = 1 (mod 5) and x = 0 (mod 7) using
Chinese remainder theorem.
3. Consider a set U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}. What will be the computer representation for set
containing the numbers which are multiple of 3 not exceeding 6? Describe injective, Surjective and
bijective function with example.

Group B
Short Answer Questions.
Attempt Any Eight Questions: [8×5=40]
4. Prove that for every positive integer n ≥ 1, n +n is even integer using mathematical induction.
2

5. All over smart people are stupid. Children of stupid people are naughty. John is a child of Jane. Jane is
over smart. Represent these statements in FOPL and prove that John is naughty.
6. Which of the following are possets?
(Z, =)
(Z, ≠)
(Z, ⊆)
7. Define reflexive closure and symmetric closure. Find the remainder when 4x2 – x + 3 is divided by x + 2
using remainder theorem.
8. Define Euler path and Hamilton path. Give examples of both Euler and Hamilton path.
9. How many 3 digits numbers can be formed from the digits 1,2,3,4 and 5 assuming that:
a) Repetitions of digits are allowed
b) Repetitions of digits are not allowed
10. Illustrate the Dijkstra’s Algorithm to find the shortest path from source node to destination node with an
example.
11. Find the MST from following graph using Kruskal algorithm.

12. Define ceiling and floor function. Why do we need Inclusion – Exclusion principle? Make it clear with
suitable example.

********

You might also like