DISCRETE STRUCTURES ( CODE:BTCS 302) -NOTES 2-IMPORTANT & EXPECTED QUESTIONS FOR PTU/KUK EXAMS

DISCRETE STRUCTURES ( CODE:BTCS 302) 

( IMPORTANT & EXPECTED QUESTIONS FOR PTU/KUK)

SHORT ANSWER TYPE QUESTIONS   (2 MARKS EACH):

Q26. State Commutative laws for intersection and union of 2 sets.

Q27. Give an example of an Euclidean Domain.

Q28. Define a Boolean Algebra and Sub- Algebra.

Q29. Define a Semi-Group.

Q30. State Lagrange's Theorm on finite Groups.

Q31. What is Chromatic number of a circuit on 'n' vertices , 'n' even?

Q32. What is the no. of vertices in a tree with 'n' edges?

Q33. How many committee of 5 with a given chairperson can be selected from 12 persons?

Q34. Let R1 and R2 be two equivalence relations a Set. State whether  R1∩ R2 is an equivalence relation. Justify.

Q35. Prove Demorgan's Law.

Q36. What do you mean by Hamiltonian Circuit? Explain with Example.

Q37. How many different Boolean functions of degree 'n' exist?

Q38. Given A={x,y,z} and B={1,2,3}, Find A*B.

Q39. Let f be a function from {a,b,c,d} to {1,2,3,4} with f(a)=4, f(b)=2, f(c)=1 and f(d)= 3. Is f a Bijection?

Q40. Define Index and Indexed sets.

Q41. Define Bijective functions with examples.

Q42. Define Invertible functions with examples.

Q43. Define Quotient Ring.

Q44. Define order of Recurrence relations.

Q45. What is the power set of A={ 0,1,2}

Q46. Define a Ideal in a Ring R. Give an example of an ideal in the ring of Integers.

Q47. Find the values, if any, of any of the Boolean variable 'x' that satisfy the equation x+x=0.

Q48. What is the Generating function for the sequence 1,1,1,1............

Q49. How many connected graphs are there in a discrete graph on 'n' vertices?

Q50. Prove that the set of Integers under the Binary operation of Addition is a Group.