Scribd
Upload
187 views

Discrete Mathematics PDF

This document contains 25 multiple choice questions related to discrete mathematics topics such as logic, sets, functions, relations, and graph theory. The questions test knowledge of concepts like conditional statements, equivalence relations, syntax, finite automata, Boolean algebra, graph properties, grammars, and tree traversals.

Uploaded by

Boomika.S 5009
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
187 views

Discrete Mathematics PDF

This document contains 25 multiple choice questions related to discrete mathematics topics such as logic, sets, functions, relations, and graph theory. The questions test knowledge of concepts like conditional statements, equivalence relations, syntax, finite automata, Boolean algebra, graph properties, grammars, and tree traversals.

Uploaded by

Boomika.S 5009
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Multiple Choice Questions

Current Affairs 2020 PDF | Latest Current Affairs


2020 PDF
Current affairs for all Competitive Exams UPSC, State PSC, IAS, RRB and Latest Current Affairs 2020
for banking exams IBPS PO Clerk, SBI, RBI and more. Try Daily quiz on latest current affairs
question and answers, Daily Current Affairs on National and international Events, Sports, Business,
Banking and more which are betterment for the Government & Private Job aspirants.

Click here for Current Affairs PDF

MCQ on Discrete Mathematics


1. If P then Q is called _________ statement
[A] Conjunction

[B] disjunction
[C] conditional
[D] bi conditional

Answer: Option [C]


2. A relation R in a set X is symmetric if _______
[A] xRy, yRz => xRz.

[B] xRy
[C] xRy=>yRx
Multiple Choice Questions

[D] xRx
Answer: Option [C]
3. If R is reflexive, symmetric and transitive then the relation is said to be ________.
[A] Binary relation

[B] Compatibility relation


[C] Equivalence relation
[D] Partial order relation
Answer: Option [C]
4. If there are more than 2 LMD for a string then it is said to be ___________.
[A] Ambigious

[B] unambigious
[C] language
[D] finite state automata
Answer: Option [A]
5. The specification of proper construction of a sentence is called ________.
[A] alphabet
[B] letter
[C] syntax
[D] word

Answer: Option [C]


6. Context free grammar is also known as _______ grammar.
[A] type 0

[B] type 1
[C] type 2
[D] type 3

Answer: Option [C]


7. Accepting states are denoted by ________.
[A] circle

[B] an arrow mark


Multiple Choice Questions

[C] double circle


[D] straight line
Answer: Option [C]
8. The set of all finite words over E is denoted by ________.

[A] E+
[B] E*
[C] E
[D]E-
Answer: Option [A]
9. The composition of function is associative but not _________.

[A] commutative
[B] associative
[C] distributive
[D] idempotent
Answer: Option [A]
10. A sum of the variables and their negations in a formula is called ________
[A] elementary sum
[B] elementary product
[C] cnf

[D] dnf
Answer: Option [A]
11. A graph in which every vertex has same degree is called _________ graph.

[A] regular
[B] simple
[C] complete

[D] null
Answer: Option [A]
12. The number of vertices of odd degree in a graph is always ________.

[A] odd
Multiple Choice Questions

[B] even
[C] zero
[D] one
Answer: Option [B]

13. Traveling salesman problem is example for_______graph.


[A] eulerian
[B] hamiltonian
[C] tournament
[D] planar
Answer: Option [B]

14. If a normal form contains all minterms, then it is ________.


[A] a tautology
[B] a contradiction
[C] a contingency
[D] both A and B
Answer: Option [A]

15. PCNF is also called _______.


[A] sum of product canonical form.
[B] product of sum canonical form

[C] sum canonical form


[D] product canonical form
Answer: Option [B]

16. Max-terms of two statements are formed by introducing the connective _________.
[A] disjunction
[B] conjunction

[C] negation
Multiple Choice Questions

[D] conditional
Answer: Option [A]
17. The number of relations from A = {a,b,c] to B = {1,2] are __________.
[A] 6

[B] 8
[C] 32
[D] 64
Answer: Option [D]
18. A graph is planar if and only if it does not contain ________.
[A] subgraphs homeomorphic to k3 & k3,3

[B] subgraphs isomorphic to k5 or k3,3


[C] subgraphs isomorphic to k3 & k3,3
[D] sub graphs homeomorphic to k5 or k3,3
Answer: Option [D]
19. sub graphs homeomorphic to k5 or k3,3
[A] one arrow between each pair of distinct vertices
[B] two arrows between each pair of distinct vertices
[C] n-1 arrows between each pair of distinct vertices
[D] path between every two distinct vertices

Answer: Option [A]


20. If a compound statement is made up of three simple statements then the number of rows in the
truth table is _______.
[A] 2

[B] 4
[C] 6
[D] 8

Answer: Option [D]


21. If R= {(x, 2x)] and S= {(x, 4x)] then R composition S=____.
[A] {(x, 4x)]
[B] {(x, 2x)]
Multiple Choice Questions

[C] {(x, 8x)]


[D] {(x, 10x)]
Answer: Option [C]
22. A regular grammar contains rules of the form _______.

[A] A tends to AB
[B] AB tends to a
[C] A tends to aB
[D] AB tends to CD
Answer: Option [C]
23. The NAND statement is a combination of ________.

[A] NOT and AND


[B] NOT and OR
[C] AND and OR
[D] NOT or OR
Answer: Option [A]
24. The NOR statement is a combination of ________.
[A] NOT and AND
[B] NOT and OR
[C] AND and OR

[D] NOT or OR
Answer: Option [B]
25. Which of the following traversal techniques lists the nodes of binary search in ascending order?

[A] pre order


[B] post order
[C] in order

[D] root order


Answer: Option [C]

You might also like