If there are n distinct components in a statement then there are _______ combinations of values in the truth table.
 

If P then Q is called _________ statement

(P->Q)-> (^Q) is __________.

If a relation is reflexive, then all the diagonal entries in the relation matrix must be________.

If R is reflexive, symmetric and transitive then the relation is said to be ________.

If there are more than 2 LMD for a string then it is said to be ___________.

A finite non-empty set of symbols is called _________.

The specification of proper construction of a sentence is called ______.

Accepting states are denoted by ________.

Surjective function is also called ________.

The composition of function is associative but not _______.

A sum of the variables and their negations in a formula is called _________.

Min-terms of two statements are formed by introducing the connective _________.

A graph in which every vertex has same degree is called _________graph.

The number of vertices of odd degree in a graph is always________.

A path of a graph is said to be ______ if it contains all the edges of the graph.

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

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

The minimum number of edges in a connected graph with n vertices is ___________.

A directed complete graph of n vertices contains __________.

The NAND statement is a combination of ______.

If a relation is reflexive then in the graph of a relation there must be a loop at _____.

The number of letters in a word is called ________.

An example for regular grammar is _____.

The number of 1's in each row of an incidence matrix of a graph G is equal to _____.