CSC165 Discrete Structure

Discrete Structure TU Board 2078 question paper

12 questionsSit this paper (timed)

Tribhuvan University

Bachelor of Science in Computer Science and Information Technology

Semester 2 · TU Board 2078

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

    Prove that for all integers x and y, if x^2 + y^2 is even then x + y is even. Using induction prove that 1^3 + 2^3 + 3^3 + ………………. + n^3 = n^2(n + 1)^2 / 4

    10
  2. 2.

    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.

    1. ∃x P(x)
    2. ∀x P(x)
    3. ∃x ¬P(x)
    4. ∀x ¬P(x)
    5. ¬∃x P(x)
    6. ¬∀x P(x)
    10
  3. 3.

    List all the necessary conditions for the graph to be isomorphic with an example. Find the maximal flow from the node SOURCE to SINK in the following network flow.

    [figure in the original paper]

    10

Group B

(8 × 5 = 40)

  1. 4.

    What is the coefficient of x^2 in (1 + x)^11? Describe how relation can be represented using matrix.

    5
  2. 5.

    Solve the recurrence relation a_n = 5a_n-1 – 6a_n-2 with initial conditions a_0 = 1, a_1 = 4.

    5
  3. 6.

    Prove that if n is positive integer, then n is odd if and only if 5n + 6 is odd.

    5
  4. 7.

    Define preposition. Consider the argument "John, a student in this class knows how to write program in C. Everyone who knows how to write program in C can get a high paying job. Therefore, someone in this class can get high paying job". Now, explain which rules of inferences are sed for each step.

    5
  5. 8.

    Show that if there are 30 students in a class, then at least two have same names that begin with the same letter. Explain the pascal's triangle.

    5
  6. 9.

    Illustrate the Dijkstra's Algorithm to find the shortest path from source node to destination node with an example.

    5
  7. 10.

    What are the significance of Minimum Spanning Tree? Describe how Kruskal's algorithm can be used to find the MST.

    5
  8. 11.

    Define zero-one matrix. Explain the types of function.

    5
  9. 12.

    Represent any three set operations using Venn-diagram. Give a recursive defined function to find the factorial of any given positive integer.

    5

— The End —