Previous Year Very Short Questions of DS (B-TECH computer science engineering 3rd)

Discrete structures

Previous year question paper with solutions for Discrete structures

Our website provides solved previous year question paper for Discrete structures . Doing preparation from the previous year question paper helps you to get good marks in exams. From our DS question paper bank, students can download solved previous year question paper. The solutions to these previous year question paper are very easy to understand.

These Questions are downloaded from www.brpaper.com You can also download previous years question papers of 10th and 12th (PSEB & CBSE), B-Tech, Diploma, BBA, BCA, MBA, MCA, M-Tech, PGDCA, B-Com, BSc-IT, MSC-IT.

Print this page
  1. Prove that an undirected graph has an even number of vertices of odd degree
  2. Define the terms (i) Hamilton Path (ii) Hamilton Cycle
  3. Define a planar graph and give an example of a non-planar graph
  4. Define a rooted tree
  5. Define a partial order relation and give an example of the same.
  6. If (ab) = a 2 b 2  a,b  G, where G is a group, then show that G is commutative.
  7.  a,b  R where R is a ring , show that a.0 = 0
  8. Give an example of an infinite integral domain.
  9. In a Boolean algebra B, show that, a + l = 1aB
  10. What is the generating function for the sequence 1!nSn ?
  11. If H is a subgroup of the group G, among the right cosets of H in G, prove that ther is only one subgroup, viz. H
  12. Let f : X X;X = {0,1,2,3,4,5,6} defined by f (x) = 4x mod 5. Write the function f as a set of ordered pairs.
  13. Give an example of Hamiltonian graph
  14. Define semigroup.
  15. Find the number of distinct permutations that can be formed from all the letters of the word ‘MATHEMATICS’
  16. Show that the set of 2 × 2 non-singular matrices with rational entries is a group with respect to matrix multiplication.
  17. Let D70 = {1, 2, 5, 7, 10, 14, 35, 70} and define m n, if m divides n. Show that (D70, ) is a Boolean Algebra.
  18. Define chromatic number.
  19. What is the difference between a graph and a tree?
  20. If P(n, r) = 0, then what is the value of r?
  21. What do you mean by principle of inclusion-Exclusion?
  22. Is every function is a relation? Comment on it and explain your answer
  23. Determine whether the following function is a bijection from R to R. f(x) = - 3x2 + 7
  24. Determine whether the relation R on the set of nil people is reflexive, symmetric and/or transitive, where (a,b) ∈ R if and only if a is taller than b
  25. Prove that an undirected graph has an even number of vertices of odd degree.
  26. What do you mean by Euler Circuit? Explain with example
  27. Is K3,3 is a planar Graph? Explain your answer. Here K3,3 represent a Bipartite graph.
  28. Prove the absorption law x(x + y) = x using the other identities of Boolean algebra
  29. What is chromatic number of Kn graph (Complete Graph).
  30. Define monoid.