Discrete mathematics MCQ Electrical Engineering

Attempt now to check your rank among 30 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____________has a greatest element and a least element which satisfy 0

  • semilattice
  • join semilattice
  • meet semilattice
  • bounded lattice

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

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

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

  • addition
  • product
  • moduler
  • subtraction

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

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

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

  • not
  • and
  • or
  • if

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

  • not
  • and
  • or
  • if

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

  • molecular
  • compound
  • atomic
  • simple

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

  • molecular
  • compound
  • atomic
  • simple

11. Each loop counting has _________ edges.

  • 1
  • 2
  • 3
  • 4

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

  • path
  • trial
  • walk
  • tour

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

  • path
  • trial
  • walk
  • tour

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

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

  • disjoint
  • edge disjoint
  • union
  • intersection

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

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

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

  • incidence
  • adjacency
  • square
  • null

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

  • square
  • cube
  • single
  • both square and cube

19. Each edge has one end in set X and one end in set Y then the graph (X, Y) is called_____graph.

  • bipartite
  • simple
  • complete
  • trivial

20. If two edges have same vertices as its terminal vertices those edges are called ____.

  • parallel
  • adjacent
  • incident
  • distinct

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

22. An edge with same ends is called ___________.

  • complete graph
  • bipartite graph
  • loops
  • link

23. An edge with identical ends is called _________.

  • complete graph
  • bipartite graph
  • loops
  • link

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

  • distinct
  • directed
  • adjacent
  • loops

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

  • planar
  • loop
  • link
  • non plannar

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

27. A regular grammar contain rules of the form is _____.

  • A tends to AB
  • AB tends to a
  • A tends to aB
  • AB tends to CD

28. A regular grammar contain rules of the form is _____.

  • A tends to AB
  • AB tends to a
  • A tends to aB
  • AB tends to CD

29. The production S tends to A is of the type _____grammar.

  • 0
  • 1
  • 2
  • all the above

30. The production S tends to aB is of the type ________grammar.

  • 0
  • 1
  • 2
  • all the above

31. There are only five distinct Hasse diagrams for partially ordered sets that contain_______elements.

  • 2
  • 3
  • 4
  • 6

32. A = {1,3,5,7,9} is a __________.

  • null set
  • finite set
  • singleton set
  • infinite set

33. Boolean expression except 0 expressed in an equivalent form is called _____.

  • canonical
  • sum
  • product
  • standard

34. _________relations are useful in solving certain minimization problems of switchingtheory.

  • Void
  • Universal
  • Compatibility
  • Equivalence

35. The number of elements in a square matrix of order n is _____.

  • n power 3
  • n power 4
  • n power 5
  • n power 2

36. Every non-trivial tree has at least _____ vertices of degree one.

  • 1
  • 2
  • 3
  • 4

37. A ____ is an edge e such that w(G-e)>w(G).

  • cut vertex of G
  • cut edge of G
  • ends of G
  • path of G

38. A ____ is an edge e such that w(G-e)>w(G).

  • cut vertex of G
  • cut edge of G
  • ends of G
  • path of G

39. Every connected graph contains a ________.

  • tree
  • sub tree
  • spanning tree
  • spanning subtree

40. A minimal non-empty edge cut of G is called a _________.

  • bond
  • cycle
  • path
  • tour

41. Every block with at least three vertices are __________connected.

  • 1
  • 2
  • 3
  • 4

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

  • block
  • bond
  • cycle
  • tour

43. To prove the statement P tautologically implies the statement Q, it is enough to prove that_________.

  • P conditional Q is a contradiction
  • P conditional Q is a tautology
  • P biconditional is a contradiction
  • P biconditional Q is a tautology

44. To prove the statement P is tautologically equivalent to the statement Q, it is enough toprove that _______.

  • P conditional Q is a contradiction
  • P conditional Q is a tautology
  • P biconditional Q is a contradiction
  • P biconditional Q is a tautology

45. Let R={(1,2),(3,4),(2,6.} and S={(4,3),(2,5),(6,6)} be a relation then R composite S=____.

  • {(1,5),(3,3),(2,6)}
  • {(1,5),(3,6),(2,5)}
  • {(4,4),(2,5),(3,3)}
  • {(1,1),(3,3),(2,2)}

46. The binary relation R = {(0, 0), (1, a)} on A = {0, 1, 2, 3, } is _______.

  • reflexive, not symmetric, transitive
  • not reflexive, symmetric, transitive
  • reflexive, symmetric, not transitive
  • reflexive, not symmetric, not transitive

47. If in the truth table the answer column has the truth values both TRUE and FALSE then itis said to be ________.

  • tautology
  • contradiction
  • contingency
  • equivalence relation

48. The binary relation R = {(0, 0), (1, a)} on A = {0, 1, 2, 3, } is _______.

  • reflexive, not symmetric, transitive
  • not reflexive, symmetric, transitive
  • reflexive, symmetric, not transitive
  • reflexive, not symmetric, not transitive

49. A graph is Eulerian if it contains __________.

  • Euler tour
  • Euler trail
  • Hamiltonian path
  • Euler path

50. Hamilton cycle is a cycle that contains every ________of G.

  • path
  • cycle
  • vertex
  • edge

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.