Set s =

{ 1,2,3,4,5} what
is cardinality of
s 2 3 4 5
What is
cardinality of
empty set 0 1 2 3
if set A =
{1,2,3,4}, B =
{3,4,5,6} then
what is A U B 1,2,3,4,5,6 3,4 1,2,5,6 1,2,3,3,4,4,5,6
if set A =
{1,2,3,4}, B =
{3,4,5,6} then
what is (A
INTERSECTIO
N B) 1,2,3,4,5,6 3,4 1,2,5,6 1,2,3,3,4,4,5,6
if set A =
{1,2,3,4}, B =
{3,4,5,6} then
what is (A
MINUS B) 1,2,3,4,5,6 3,4 1,2,5,6 1,2
if set A =
{1,2,3,4}, B =
{3,4,5,6} then
what is (B
MINUS A) 1,2,5,6 3,4 5,6 1,2
if set A =
{1,2,3,4}, B =
{3,4,5,6} then
what is (A
SYMMETRIC
DIFFERENCE
B) 1,2,5,6 3,4 5,6 1,2
If G is
undirected
complete graph
with n vertices
then maximum
number of
edges are n*n n*(n-1)/2 n*n/2 n*(n+1)/2
If G is directed
complete graph
with n vertices
then maximum
number of
edges are n*n n*(n+1) n*n/2 n*(n-1)
Which of the
following
statement is Complete graph is Directed graph is
true? Tree is a graph Graph is a Tree a tree tree
Which of the
following
statement is Every graph is Graph is set of
false? Every tree is graph complete graph vertices and edges All are false
Total number of
What is degree of Minimum number Minimum number Maximum number edges for each
a graph of edges of a graph of edges of a node of edges of a node node
A spanning tree N-1 N 2N N*(N-1)
of a graph
 having N
vertices can
have total
number of
vertices
A spanning tree
of a graph
having N
vertices can
have total
number of
edges N-1 N 2N N*(N-1)
The in degree of Number of edges Number of edges
a vertex ‘V’ in a from V to other to V to from Number of paths Number of directed
graph is vertices vertices from V edges to V
The out degree of Number of edges Number of edges
a vertex ‘V’ in a from V to other to V to from Number of paths Number of directed
graph is vertices vertices from V edges to V
What is the
order of edges
selected of the
minimum
spanning tree
for the above
graph r of
edges selected
using Kruskal’s
algorithm are 0-2, 1-2,1-3,1-4 0-2, 1-3, 2-1,1-4 0-2,3-3, 2-1,1-4 0-2,2-1, 2-3,1-4
To arrange a
data in binary
search tree in
ascending order Breadth first
we need preorder traversal Postorder traversal inorder traversal traversal
What is preorder
traversal of given A,B,D,E,H,I,C,F,G, D,B,H,E,I,A,F,C,J, D,H,I,E,B,F,J,G,C, A,B,C,D,E,F,G,H,I,
binary tree J G A J
What is
postorder
traversal of given A,B,D,E,H,I,C,F,G, D,B,H,E,I,A,F,C,J, D,H,I,E,B,F,J,G,C, A,B,C,D,E,F,G,H,I,
binary tree J G A J
What is Inorder
traversal of given A,B,D,E,H,I,C,F,G, D,B,H,E,I,A,F,C,J, D,H,I,E,B,F,J,G,C, A,B,C,D,E,F,G,H,I,
binary tree J G A J
What is breadth
first search
traversal of given A,B,D,E,H,I,C,F,G, D,B,H,E,I,A,F,C,J, D,H,I,E,B,F,J,G,C, A,B,C,D,E,F,G,H,I,
binary tree J G A J
A BST is
traversed in the
following order
recursively:
Right, root, left
The output
sequence will
be in Ascending order Descending order can't say breadth wise
What is the post 1, 2, 3, 7, 10, 30, 2, 3, 1, 7, 10, 30, 1 3 2 7 10 40 30 11 14, 1, 2, 3, 7,
order traversal 40, 14, 11 40, 11, 14 14 40,10,30, 11
of a tree if the
 preorder
traversal is 14,
2, 1, 3, 11, 10,
7, 30, 40 & in-
order traversal
is 1, 2, 3, 14, 7,
10, 11, 40, 30.