What is the pre order traversal of a tree if

the postorder traversal is 1 3 2 7 10 40 30

11 14 & in-order traversal is 1, 2, 3, 14, 7, 1, 2, 3, 7, 10, 14, 2, 1, 3, 11, 2, 3, 1, 7, 10, 30, 14, 1, 2, 3, 7,
10, 11, 40, 30. 30, 40, 14, 11 10, 7, 30, 40 40, 11, 14 40,10,30, 11 B
If G is an directed graph with 20 vertices,
how many boolean values will be needed to
represent G using an adjacency matrix? 20 200 400 40 C
everything
everything in
Universal set contain _________ currently under Universal things set of integers A
universe
consideration
set of all the
Power set is _______- subsets of the super set Universal set None of above A
given set
If it has same
if it has if it has cardinality as
A set is called countably infinite _________ D
if it has no cardinality as n cardinality as 0 natural
cardinailty numbers.
|A-B| = |A|-|A∩B| TRUE FALSE A
Maximum number of edges in undirected
n(n-1) n(n-1)/2 n n/2 B
graph = ______
Maximum number of edges in directed
n(n-1) n(n-1)/2 n n/2 A
graph = ______
A simple path A simple path in A simple path in
in which the which the first & which the first &
Cycle is __________ None of above A
first & last are last are not last are not
same same preent
the number of
n(n-1)/2 not known 25 A
The length of a path is __________________ edges on it
Efficient data structure for representation adjacency
trees array list B
of graph is _________ matrix
Hamiltonian Path ________ Path with Pah that passes Path that passes None of above C
 through each
throgh the first
length n vertex once and
and last node
only once
visiting all the
vertices of visiting none of visiting all the
None of above C
graph exactly the vertices of vertices of graph
Traversing a graph means ____ twice graph. exactly once.
Visiting all the Visiting all the Visiting half Visiting all
In travelling sales person B
edges is nodes is edges is two edges is
problem________________
compulsary compulsary compulsary compulsary
How many types of salad can be made from
5 32 7 31 D
onion, cucumber, letuce, carrot, tomato
In a group of 42 tourists, everyone speaks
English or french, There are 35venglish
32 23 42 11 D
speakers and 18 french speakers how many
speaks English and French
If there are n number of elements in a given
et S then cardinality of the power set of 2^n n nXn 0 A
given set S is __
Complement of a given set A with respect
U-A U+A U XA A A
to universal set S is __
Principal of inclusion-exclusion says that | AUB | = |A|+| | AUB | = |A|+|
0 n A
_______ B|-|A∩B| B|+|A∩B|
In adjacency matrix for representation of a
undirected graph if edge is present from i 0 1 2 P B
to j then A[i][j] =_____
In adjacency matrix for representation of a
undirected graph if edge is not present 0 1 2 P A
from i to j then A[i][j] =_____
Space required for representation of a
2XN 2X2 0 A
graph in memory using adjacency matrix is N^2
In adjacency list representation. Generally Number of Number of Number of
1 A
the number of linked lists equal to _______ nodes edges neighbours
Leaf node has out degree_____ 0 1 can not say n A
Total number of edges in complete
n(n-1)/2 n(n-1) n-1 n A
undirected graph are
Root node has in degree_____ 0 1 can not say n A