Discrete mathematics MCQ Electrical Engineering

Attempt now to check your rank among 35 students! 50 Questions 30 Mins

About Discrete mathematics

Following are some of the multiple choice questions on the Discrete mathematics with answers that will help the students in developing their knowledge.

Discrete mathematics MCQ

1. Order of the power set of a set of order n is

  • nnn
  • 2n2n2n
  • n2n^2n2
  • 2n2^n2n

2. What is the minimum height for a binary search tree with 60 nodes?

  • 1
  • 3
  • 4
  • 2

3. A sublattice(say, S) of a lattice(say, L) is a convex sublattice of L if__________

  • x>=z, where x in s implies z in s, for every element x, y in l
  • x=y and y
  • x
  • x=y and y>=z, where x, y in s implies z in s, for every element x, y, z in l

4. Which of the following regular expressions identifiers are true?

  • (r*)* = r
  • (r+s)* = r* . s*
  • r*.s* = r* + s*
  • (r.s)* = r*/s*

5. Which of the following is Absorption Law?

  • a*a a
  • a+(a*b) a
  • a*b a*a
  • (a*b)*c a*(b*c)

6. If an edge e is said to join the vertices u and v then the vertices u and v are called __.

  • initial vertices
  • terminal vertices
  • ends of e
  • all the above

7. In an undirected graph the number of nodes with odd degree must be

  • Zero
  • Odd
  • Prime
  • Even

8. A relation R is defined on the set of integers as xRy if and only if (x+y) is even. Which ofthe following statement is TRUE?

  • R is not an equivalence relation.
  • R is an equivalence relation having one equivalence classes
  • R is an equivalence relation having two equivalence classes
  • R is an equivalence relation having three equivalence classes

9. Which of the following traversal techniques lists the nodes of binary search in ascendingorder?

  • pre order
  • post order
  • in order
  • root order

10. A cycle on n vertices is isomorphic to its complement. What is the value of n?

  • 5
  • 32
  • 17
  • 8

11. Which of the following statement regarding sets is false?

  • a ∩ a = a
  • a u a = a
  • a – (b ∩ c) = (a – b) u (a –c)
  • (a u b)’ = a’ u b’

12. What is a circle group?

  • a subgroup complex numbers having magnitude 1 of the group of nonzero complex elements
  • a subgroup rational numbers having magnitude 2 of the group of real elements
  • a subgroup irrational numbers having magnitude 2 of the group of nonzero complex elements
  • a subgroup complex numbers having magnitude 1 of the group of whole numbers

13. If every two elements of a poset are comparable then the poset is called                  

  • sub ordered poset
  • totally ordered poset
  • sub lattice
  • semigroup

14. The______________of all the variables in direct or complemented from is a maxterm.

  • addition
  • product
  • moduler
  • subtraction

15. What is the simplification value of MN(M+ N’) + M(N + N’)?

  • m
  • mn+m’n’ c) (1+m)
  • d
  • m+n’

16. If P then Q is called _________ statement

  • Conjunction
  • disjunction
  • conditional
  • bi conditional

17. A class of machine which accepts a ________ language is called finite state automata.

  • type 0
  • type 1
  • type 2
  • type 3

18. What is multiplication of the sequence 1, 2, 3, 4,… by the sequence 1, 3, 5, 7, 11,….?

  • 1, 5, 14, 30,…
  • 2, 8, 16, 35,…
  • 1, 4, 7, 9, 13,…
  • 4, 8, 9, 14, 28,…

19. What is the solution to the recurrence relation an=5an-1+6an-2?

  • 2n2
  • 6n
  • (3/2)n
  • n!*3

20. Every poset that is a complete semilattice must always be a                

  • sublattice
  • complete lattice
  • free lattice
  • partial lattice

21. A____________has a greatest element and a least element which satisfy 0

  • semilattice
  • join semilattice
  • meet semilattice
  • bounded lattice

22. What is the definition of Boolean functions?

  • an arithmetic function with k degrees such that f:y–>yk
  • a special mathematical function with n degrees such that f:yn–>y
  • an algebraic function with n degrees such that f:xn–>x
  • a polynomial function with k degrees such that f:x2–>xn

23. Which of the following is a Simplification law?

  • m.(~m+n) = m.n
  • m+(n.o) = (m+n)(m+o) c) ~(m+n) = ~m.~n
  • d) m.(n.o) = (m.n
  • .o

24. What are the canonical forms of Boolean Expressions?

  • or and xor
  • nor and xnor
  • max and min
  • som and pom

25. Which of the following is/are the universal logic gates?

  • or and nor
  • and
  • nand and nor
  • not

26. What is the use of Boolean identities?

  • minimizing the boolean expression
  • maximizing the boolean expression
  • to evaluate a logical identity
  • searching of an algebraic expression

27. How many different non-isomorphic Abelian groups of order 8 are there?

  • 5
  • 4
  • 2
  • 3

28. A __________ is a complemented distributive lattice.

  • boolean homomorphism
  • boolean algebra
  • boolean isomorphism
  • boolean function

29. A connected graph that has no cut vertices is called a ________.

  • block
  • bond
  • cycle
  • tour

30. PDNF is also called _____________

  • sum of product canonical form
  • product of sum canonical form
  • sum canonical form
  • product canonical form

31. PCNF is also called _______.

  • sum of product canonical form.
  • product of sum canonical form
  • sum canonical form
  • product canonical form

32. A state from which a deterministic finite state automata can never come out is called a____________.

  • trape state
  • starting symbol
  • transition table
  • transition diagram

33. What is the value of x after this statement, assuming the initial value of x is 5?‘If x equals to one then x=x+2 else x=0’.

  • 1
  • 3
  • 2
  • None of these

34. (b.c) = (a.b).c is the representation for which property?

  • g-ii
  • g-iii
  • r-ii
  • r-iii

35. The negation of the statement is formed by introducing ___________.

  • if
  • and
  • or
  • not

36. The statements formed from atomic statements are called _________statements.

  • molecular
  • compound
  • atomic
  • simple

37. The statements that we consider initially are simple statements called_________statements.

  • molecular
  • compound
  • atomic
  • simple

38. Each loop counting has _________ edges.

  • 1
  • 2
  • 3
  • 4

39. If the vertices of a walk W are distinct then W is called __________.

  • path
  • trial
  • walk
  • tour

40. If the edges of a walk W are distinct then W is called _________.

  • path
  • trial
  • walk
  • tour

41. The degree of vertex v in G is __________.

  • number of edges of G incident with v
  • number of loops in G
  • number of links in G
  • number of sub graph in G

42. Edges intersect only at their ends are called ________.

  • planar
  • loop
  • link
  • non plannar

43. If the graph G1 and G2 has no vertex in common then it is said to be ______.

  • disjoint
  • edge disjoint
  • union
  • intersection

44. If H is a sub graph of G then G is a ______ of H.

  • proper sub grapth
  • inducted sub graph
  • spanning subgraph
  • super graph

45. To any graph G there corresponds a vertex in a matrix called ________matrix.

  • incidence
  • adjacency
  • square
  • null

46. An edge with same ends is called ___________.

  • complete graph
  • bipartite graph
  • loops
  • link

47. In a graph if few edges have directions and few do not have directions then the graph iscalled _________.

  • multi graph
  • directed graph
  • undirected graph
  • mixed graph

48. Two vertices which are incident with the common edge are called______________vertices.

  • distinct
  • directed
  • adjacent
  • loops

49. The graph defined by the vertices and edges of a __________ is bipartite.

  • square
  • cube
  • single
  • both square and cube

50. An edge with identical ends is called _________.

  • complete graph
  • bipartite graph
  • loops
  • link

Enjoyed the Quiz. Share this with friends

Comments

Add Your Review

Your email address will not be published.

Subscribe to Newsletter!

Subscribe to get latest updates and information.