NEW
Font size
WorksheetsDM MCQ
Total questions: 30
Worksheet time: 30mins
In how many different ways can the letters of the word HEXAGON be permuted ?
5400
4500
5040
4050
Find the number of ways in which the letters of the word TRIANGLE can be arranged such that vowels occur together.
4220
4230
4320
4020
How many different numbers can be formed from the digits 1,2,3,4,5 assuming that the digits cannot be repeated?
325
523
235
352
In how many ways can first, second and third prize in Pie-banking contest be given to 15 participants?
2370
2730
2073
3073
How many bit string of length 10 that begin and with 1 ?
562
265
256
625
The arrangement of objects in a circle is called
circle
circular permutation
round permutation
permutation
A committee of 5 is to be selected from 6 boys and 5 girls . Determine the number of ways of selecting the committee if it is t consist of atleast 1 boy and 1 girl
455
545
554
550
A bank pays 6% interest annually on saving , compounding the interest monthly. if ram deposits Rs.1000 on the first of may, how much will this deposit be worth a year later?
1061.68
1061
1061.75
1061.90
Among 40 CSE students interviewed in a class for a job , 25 knew java programming, 28 knew oracle and 7 do not knew any one of the language . find how many knew both languages.
40
20
7
33
Find the number of integers between 1 and 2000 inclusive that are not divisible by 2,3,5 or 7
458
485
475
457
An edge associated with the unordered pair(u,u) of a graph G is called
self loop
edge joining
digraph
simple graph
A graph with no self loop is called a
simple graph
null graph
weight graph
multi graph
A graph G in which the set of edges E is empty is called a
simple graph
null graph
finite graph
multi graph
A graph having loops but no multiple edges is called a
finite graph
pseudo graph
Digraph
simple graph
In a diagraph G , the number of edges ending at vertex v of G is called
Indegree
Outdegree
degree of vertex
all the above
A vertex degree zero in a graph is called an
pendent vertex
isolated vertex
regular graph
degree of vertex
A vertex of a graph with degree one is called a
isolated vertex
pendent vertex
regular graph
cycle
Total no. of edges in Kn =
n/2
n(n-1)/2
n(n-1)(n-2)
none of these
Kn is called
(n-1) regular graph
n regular graph
k regular graph
regular graph
The sum of degrees of the vertices of an un directed graph G is twice the number of edges in G.
Flase
True
none of these
In an undirected graph G , the number of vertices of odd degree is
Odd
Even
none of these
Two non parallel edges in a graph G are said to be
Adjacency vertex
adjacency edges
Complement graph
none of these
A walk in a graph in which no edge is repeated is called a
walk
trail
closed walk
open walk
A Closed path in which all the edges are distinct is a
Path
Circuit
Cycle
none of these
A circuits in which all the vertices are distinct is a
closed walk
circuits
cycle
all the above
Two graphs are isomorphic if
They have same number of vertices
They have same number of edges
Equal number of vertices with same degree
All the above
A graph without parallel edges or self loop with n nodes and k components can have at most
n/2 edges
n(n-1)/2 edges
(n-k)(n-k+1)/2edges
none of these
A strongly connected digraph is
unilaterally
weakly connected
both
none of these
An Euler graph need not be
connected
even degree
cycle
circuits
The statements are equivalent for a connected graph G
G is Eulerian
Every vertex has even degree
Eulerian circuits
all the above
