3/6/2014

Computer Science MCQ Practice Test

Home

Practice Test

Submit MCQ Qn

About Us

Contact

Computer Science MCQ Pratice Test

_____________________________________________________________________________________________________________________________
If R is a relation Less Than from A = {1,2,3,4} to B = {1,3,5} then RoR-1 is
{(3,3),
{(3,1),
{(3,3),
{(1,3),

(3,4),
(5,1),
(3,5),
(1,5),

(3,5)}
(3,2), (5,2), (5,3), (5,4)}
(5,3), (5,5)}
(2,3), (2,5), (3,5), (4,5)}

_____________________________________________________________________________________
Find the number of relations from A = {cat, dog, rat} to B = {male , female}
64
6
32
15
_____________________________________________________________________________________
A graph G is called a ..... if it is a connected acyclic graph
Cyclic graph
Regular graph
Tree
Not a graph
_____________________________________________________________________________________
The vertex set V in the graph G=(V,E)
Must be empty
Must be non-empty
Can be empty or non-empty
None of these
_____________________________________________________________________________________
The statement ( p^q) _ p is a
Contingency
Absurdity
Tautology
None of the above
_____________________________________________________________________________________
The number of colours required to properly color vertices of every planar graph is
2
3
4
5
_____________________________________________________________________________________
A simple graph in which there exists an edge between every pair of vertices is called
Complete graph
Euler graph
Planner graph
Regular graph
_____________________________________________________________________________________
The maximum degree of any vertex in a simple graph with n vertices is
n1
n+1
2n1
n
_____________________________________________________________________________________
A debating team consists of 3 boys and 2 girls. Find the number of ways they can sit in a row?
120
24
720
12
_____________________________________________________________________________________
Length of the walk of a graph is
The number of vertices in walk W

http://computersciencemcq.com/pratice_test_deatil.aspx

1/5

3/6/2014

Computer Science MCQ Practice Test

The number of vertices in walk W
The number of edges in walk W
Total number of edges in a graph
Total number of vertices in a graph

_____________________________________________________________________________________
In any undirected graph the sum of degrees of all the nodes
Must be even
Are twice the number of edges
Must be odd
Need not be even
_____________________________________________________________________________________
The length of Hamiltonian Path in a connected graph of n vertices is
n1
n
n+1
n/2
_____________________________________________________________________________________
A graph in which all nodes are of equal degree is called
Multi graph
Non regular graph
Regular graph
Complete graph
_____________________________________________________________________________________
1.If p^q is T,then
a)p is T,q is F b)p is F,q is T
c)p is F,q is F d)p is T,q is F

_____________________________________________________________________________________
In a graph if e=(u, v) means
u is adjacent to v but v is not adjacent to u
e begins at u and ends at v
u is processor and v is successor
both b and c
_____________________________________________________________________________________
The number of distinguishable permutations of the letters in the word BANANA are,
60
36
20
10
_____________________________________________________________________________________
A graph is a collection of
Row and columns
Vertices and edges
Equations
None of these
_____________________________________________________________________________________
In how many ways can a president and vice president be chosen from a set of 30 candidates?
820
850
880
870
_____________________________________________________________________________________
In an undirected graph the number of nodes with odd degree must be
Zero
Odd
Prime
Even
_____________________________________________________________________________________
Let N = {1, 2, 3, .} be ordered by divisibility, which of the following subset is totally ordered,
(2,
(3,
(2,
(4,

6, 24)
5, 15)
9, 16)
15, 30)

_____________________________________________________________________________________
If n is an integer and n2 is odd ,then n is

http://computersciencemcq.com/pratice_test_deatil.aspx

2/5

3/6/2014

Computer Science MCQ Practice Test

If n is an integer and n2 is odd ,then n is

even
odd
even or odd
prime
_____________________________________________________________________________________
The number of distinct relations on a set of 3 elements is
8
9
18
512
_____________________________________________________________________________________
A graph with one vertex and no edges is
multigraph
digraph
isolated graph
trivial graph
_____________________________________________________________________________________
If x and y are real numbers then max (x, y) + min (x, y) is equal to
2x
2y
(x+y)/2
x+y
_____________________________________________________________________________________
Suppose v is an isolated vertex in a graph, then the degree of v is
0
1
2
3
_____________________________________________________________________________________
A minimal spanning tree of a graph G is
A spanning sub graph
A tree
Minimum weights
All of above
_____________________________________________________________________________________
The number of leaf nodes in a complete binary tree of depth d is
2d
2d1+1
2d+1+1
2d+1
_____________________________________________________________________________________
A graph is a tree if and only if it
Is completely connected
Is minimally connected
Contains a circuit
Is planar
_____________________________________________________________________________________
A connected graph T without any cycles is called
A tree graph
Free tree
A tree
All of above
_____________________________________________________________________________________
Two isomorphic graphs must have
Same number of vertices
Same number of edges
Equal number of vertices
All of these
_____________________________________________________________________________________
In a graph if e=[u, v], Then u and v are called
Endpoints of e
Adjacent nodes
Neighbors
All of above
_____________________________________________________________________________________

http://computersciencemcq.com/pratice_test_deatil.aspx

3/5

3/6/2014

Computer Science MCQ Practice Test

How many different words can be formed out of the letters of the word VARANASI?
64
120
40320
720
_____________________________________________________________________________________
In any undirected graph,the sum of degrees of all nodes
Must be even
Is twice the number of edges
Must be odd
Must be even
_____________________________________________________________________________________
The relation { (1,2), (1,3), (3,1), (1,1), (3,3), (3,2), (1,4), (4,2), (3,4)} is
Reflexive
Transitive
Symmetric
Asymmetric
_____________________________________________________________________________________
Number of vertices of odd degree in a graph is
Always even
Always odd
Either even or odd
Always zero
_____________________________________________________________________________________
In how many ways can 5 balls be chosen so that 2 are red and 3 are black
910
990
970
960
_____________________________________________________________________________________
A continuous non intersecting curve in the plane whose origin and terminus coincide
Planer
Jordan
Hamiltonian
All of these
_____________________________________________________________________________________
The number of functions from an m element set to an n element set is:
mn
m+n
nm
m* n
_____________________________________________________________________________________
Choose the most appropriate definition of plane graph
A graph drawn in a plane in such a way that any pair of edges meet only at their end vertices
A graph drawn in a plane in such a way that if the vertex set of graph can be partitioned into two non empty disjoint subset X and Y in such a way that each edge of G has one end in X and one end in Y
A simple graph which is Isomorphic to Hamiltonian graph
None of these
_____________________________________________________________________________________
The expression a+a c is equivalent to
a
a+c
c
1
_____________________________________________________________________________________
A graph is tree if and only if
Is planar
Contains a circuit
Is minimally
Is completely connected
_____________________________________________________________________________________
A given connected graph G is a euler graph if and only if all vertices of G are of
Same degree
Even degree
Odd degree
Different degree

http://computersciencemcq.com/pratice_test_deatil.aspx

4/5

3/6/2014

Computer Science MCQ Practice Test

_____________________________________________________________________________________
Hasse diagram are drawn
Partially ordered sets
Lattices
Boolean algebra
None of these
_____________________________________________________________________________________
A partial ordered relation is transitive, reflexive and
Antisymmetric
Bisymmetric
Anti reflexive.
Asymmetric
_____________________________________________________________________________________
Which of the following pair is not congruent modulo 7?
10, 24
25, 56
-31, 11
-64, -15
_____________________________________________________________________________________

Submit

Score 0/50marks

http://computersciencemcq.com/pratice_test_deatil.aspx

5/5