1) The number of 1's in each row of an incidence matrix of a graph G is equal to _____.
Ans: the degree of the corresponding vertices
2) The number of vertices of odd degree in a graph is always________.
Ans: even
3) The specification of proper construction of a sentence is called ______.
Ans: Syntax
4) The specification of proper construction of a sentence is called ______.
Ans: length
5) The NAND statement is a combination of ______.
Ans: NOT and AND
6) If a relation is reflexive then in the graph of a relation there must be a loop at ____
Ans: Each mode
7) P->Q)-> (^Q) is ____
Ans: not a well formed formula
8) A directed complete graph of n vertices contains _______
Ans: one arrow between each pair of distinct vertices
9) A graph in which every vertex has same degree is called _________graph
Ans: regular
10) If a relation is reflexive, then all the diagonal entries in the relation matrix must be___
Ans: 1
11) A sum of the variables and their negations in a formula is called ________
Ans: elementary sum
12) The composition of function is associative but not __
Ans: commulative
13) A path of a graph is said to be ______ if it contains all the edges of the graph.
Ans: eulerian
14) If P then Q is called _________ statement.
Ans: conditional
15) Min-terms of two statements are formed by introducing the connective ________
Ans: Conjunction
16) Accepting states are denoted by ___
Ans: double circle
17) If there are more than 2 LMD for a string then it is said to be _________
Ans: Ambigious
18) A finite non-empty set of symbols is called __
Ans: alphabet
19) An example for regular grammar is __
Ans: S tends to aB
20) Surjective function is also called __
Ans: onto
21) Surjective function is also called __
Ans: a tautology
22) If there are n distinct components in a statement then there are _______ combinations of values in the truth table.
Ans: Minimize the cost
23) 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?
Ans: R is an equivalence relation having two equivalence classes
24) If R is reflexive, symmetric and transitive then the relation is said to be ____
Ans: Equivalence relation
25) The minimum number of edges in a connected graph with n vertices is ___
Ans: n-1
