MCQGeeks
0 : 0 : 1
CBSE
JEE
NTSE
NEET
English
UK Quiz
Quiz
Driving Test
Practice
Games
Quiz
Electrical Engineering
Discrete Mathematics
Quiz 2
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
Q.1
In a graph if few edges have directions and few do not have directions then the graph iscalled _________.
multi graph
directed graph
undirected graph
mixed graph
Q.2
An edge with same ends is called ___________.
complete graph
bipartite graph
loops
link
Q.3
A = {1,3,5,7,is a __________.
null set
finite set
singleton set
infinite set
Q.4
An edge with identical ends is called _________.
complete graph
bipartite graph
loops
link
Q.5
Two vertices which are incident with the common edge are called______________vertices.
distinct
directed
adjacent
loops
Q.6
Edges intersect only at their ends are called ________.
planar
loop
link
non plannar
Q.7
If an edge e is said to join the vertices u and v then the vertices u and v are called __.
initial vertices
terminal vertices
ends of e
all the above
Q.8
A regular grammar contain rules of the form is _____.
A tends to AB
AB tends to a
A tends to aB
AB tends to CD
Q.9
A regular grammar contain rules of the form is _____.
A tends to AB
AB tends to a
A tends to aB
AB tends to CD
Q.10
The production S tends to A is of the type _____grammar.
0
1
2
all the above
Q.11
The production S tends to aB is of the type ________grammar.
0
1
2
all the above
Q.12
There are only five distinct Hasse diagrams for partially ordered sets that contain_______elements.
2
3
4
6
Q.13
Boolean expression except 0 expressed in an equivalent form is called _____.
canonical
sum
product
standard
Q.14
_________relations are useful in solving certain minimization problems of switchingtheory.
Void
Universal
Compatibility
Equivalence
Q.15
The number of elements in a square matrix of order n is _____.
n power 3
n power 4
n power 5
n power 2
Q.16
Every non-trivial tree has at least _____ vertices of degree one.
1
2
3
4
Q.17
A ____ is an edge e such that w(G-e)>w(G).
cut vertex of G
cut edge of G
ends of G
path of G
Q.18
A ____ is an edge e such that w(G-e)>w(G).
cut vertex of G
cut edge of G
ends of G
path of G
Q.19
Every connected graph contains a ________.
tree
sub tree
spanning tree
spanning subtree
Q.20
A minimal non-empty edge cut of G is called a _________.
bond
cycle
path
tour
0 h : 0 m : 1 s
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
Report Question
×
What's an issue?
Question is wrong
Answer is wrong
Other Reason
Want to elaborate a bit more? (optional)
Support mcqgeeks.com by disabling your adblocker.
×
Please disable the adBlock and continue.
Thank you.
Reload page