Discrete Mathematics MCQs for Software Engineering Students

By: Prof. Dr. Fazal Rehman | Last updated: May 30, 2025

12 Score: 0 Attempted: 0/12 Subscribe
1. : The statement ~(~q) = q describes:





2. : A graph G is called a ….. if it is a connected acyclic graph:





3. : An argument is _____ if the conclusion is not true when all the premises are true:





4. : The relation { (1,2), (1,3), (3,1), (1,1), (3,3), (3,2), (1,4), (4,2), (3,4)} is:





5. : A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C) is called:





6. : Letters of CHORD taken all at a time can be written in:





7. : If f(x) = 3x + 1 then its inverse is:





8. : The number of colours required to properly colour the vertices of every planar graph is:





9. : A number of elements in a set is called:





10. : A partial ordered relation is transitive, antisymmetric and:





11. : Which of the given statements is correct?





12. : The empty graph is also known as:





 

Discrete Mathematics MCQs

  1. Discrete Mathematics MCQs
  2. Discrete Mathematics MCQs set 2
  3. Discrete Mathematics MCQs SET 3
  4. Discrete Mathematics MCQs SET 4
  5. Discrete Mathematics MCQs SET 5
Computer Science Repeated MCQs Book Download

Related Posts:

Leave a Comment

All Copyrights Reserved 2025 Reserved by T4Tutorials