Discrete Mathematics Set 13

Computer Science Engineering (CSE)

Practice Mode Previous Next
On This Page

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on Discrete Mathematics Set 13

Q1 | S -> aAB, AB -> bB, B -> b, A -> aB satisfies ___________ type of grammar
  • 0
  • 1
  • 0,1
  • 2
Answer: 0,1
Q2 | If there are more than 2 LMD for a string then it is said to be ___________.
  • Ambigious
  • unambigious
  • language
  • finite state automata
Answer: Ambigious
Q3 | A finite non-empty set of symbols is called _________.
  • alphabet
  • letter
  • string
  • language
Answer: alphabet
Q4 | The specification of proper construction of a sentence is called ______.
  • alphabet
  • letter
  • syntax
  • word
Answer: syntax
Q5 | Context free grammar is also known as _______ grammar.
  • type 0
  • type 1
  • type 2
  • type 3
Answer: type 2
Q6 | A class of machine which accepts a ________ language is called finite state automata.
  • type 0
  • type 1
  • type 2
  • type 3
Answer: type 3
Q7 | Accepting states are denoted by ________.
  • circle
  • an arrow mark
  • double circle
  • straight line
Answer: double circle
Q8 | For converting NDFA to DFA we should __________ all the states which have noincoming.
  • add
  • subtract
  • multiply
  • delete
Answer: delete
Q9 | The set of all finite words over E is denoted by ________.
  • E+
  • E*
  • E
  • E
Answer: E+
Q10 | Surjective function is also called ________.
  • onto
  • into
  • one to one
  • one one onto
Answer: onto
Q11 | One to one onto function is also called __________.
  • bijective
  • injective
  • surjective
  • composite function
Answer: bijective
Q12 | The composition of function is associative but not _______.
  • commutative
  • associative
  • distributive
  • idempotent
Answer: commutative
Q13 | A mapping x into itself is called __________.
  • reflexive
  • symmetric
  • transitive
  • equivalence
Answer: reflexive
Q14 | The duality law of (P^Q)vT is ________.
  • (P^Q)^T
  • (PvQ)^T
  • (PvQ)vF
  • (PvQ)^F
Answer: (PvQ)^F
Q15 | A sum of the variables and their negations in a formula is called _________.
  • elementary sum
  • elementary product
  • cnf
  • dnf
Answer: elementary sum
Q16 | A premise may be introduced at any point in the derivation is called ________.
  • Rule P
  • Rule P and Rule T
  • Rule T
  • Rule CP
Answer: Rule P
Q17 | A product of the variables and their negations in a formula is called _________.
  • elementary product
  • elementary sum
  • cnf
  • dnf
Answer: elementary product
Q18 | Min-terms of two statements are formed by introducing the connective _________.
  • Conjunction
  • disjunction
  • Conditional
  • negation
Answer: Conjunction
Q19 | Any vertex having degree one is called _______.
  • Simple vertex
  • pendent vertex
  • regular vertex
  • complete vertex
Answer: pendent vertex
Q20 | A graph that has neither self loops nor parallel edges is called_____graph.
  • regular
  • simple
  • complete
Answer: simple
Q21 | A graph in which every vertex has same degree is called _________graph.
  • regular
  • simple
  • complete
Answer: regular
Q22 | Kn denotes _______graph.
  • regular
  • simple
  • complete
Answer: complete
Q23 | The number of vertices of odd degree in a graph is always________.
  • odd
  • even
  • zero
  • one
Answer: even
Q24 | A path of a graph is said to be ______ if it contains all the edges of the graph.
  • eulerian
  • hamiltonian
  • tournament
  • planar
Answer: eulerian
Q25 | Traveling salesman problem is example for_______graph.
  • eulerian
  • hamiltonian
  • tournament
  • planar
Answer: hamiltonian
Previous Next