|
•
42:
Question No: 12 ( Marks: 1 ) - Please choose one
The Huffman codes provide a method of encoding data inefficiently when coded using
ASCII standard.
True
False
Question No: 13 ( Marks: 1 ) - Please choose one
Using ASCII standard the string abacdaacac will be encoded with __________ bits.
80
160
320
100
Question No: 14 ( Marks: 1 ) - Please choose one
Using ASCII standard the string abacdaacac will be encoded with 160 bits.
True
False
Question No: 15 ( Marks: 1 ) - Please choose one
Using ASCII standard the string abacdaacac will be encoded with 320 bits.
True
False
Question No: 16 ( Marks: 1 ) - Please choose one
Using ASCII standard the string abacdaacac will be encoded with 100 bits.
True
False
Question No: 17 ( Marks: 1 ) - Please choose one
Using ASCII standard the string abacdaacac will be encoded with 32 bytes
True
False
Question No: 18 ( Marks: 1 ) - Please choose one
The greedy part of the Huffman encoding algorithm is to first find two nodes with
smallest frequency.
True
False
Question No: 19 ( Marks: 1 ) - Please choose one
The greedy part of the Huffman encoding algorithm is to first find two nodes with
character frequency
True
False
Question No: 20 ( Marks: 1 ) - Please choose one
Huffman algorithm uses a greedy approach to generate an antefix code T that minimizes
the expected length B (T) of the encoded string.
True
False
Question No: 21 ( Marks: 1 ) - Please choose one
Depth first search is shortest path algorithm that works on un-weighted graphs.
True
False
Question No: 22 ( Marks: 1 ) - Please choose one
Dijkestra s single source shortest path algorithm works if all edges weights are nonnegative
and there are no negative cost cycles.
True
False
Question No: 23 ( Marks: 1 ) - Please choose one
Dijkestra s single source shortest path algorithm works if all edges weights are negative
and there are no negative cost cycles.
True
False
hb
Question No: 24 ( Marks: 1 ) - Please choose one
Floyd-Warshall algorithm is a dynamic programming algorithm; the genius of the
algorithm is in the clever recursive formulation of the shortest path problem.
True
Flase
Question No: 25 ( Marks: 1 ) - Please choose one
Floyd-Warshall algorithm, as in the case with DP algorithms, we avoid recursive
evaluation by generating a table for
k
ij d
True
Flase
Question No: 26 ( Marks: 1 ) - Please choose one
The term coloring came form the original application which was in map drawing.
True
False
Question No: 27 ( Marks: 1 ) - Please choose one
In the clique cover problem, for two vertices to be in the same group, they must be
_______________each other.
Apart from
Far from
Near to
Adjacent to
Question No: 28 ( Marks: 1 ) - Please choose one
In the clique cover problem, for two vertices to be in the same group, they must be apart
from each other.
True
False
Question No: 29 ( Marks: 1 ) - Please choose one
The difference between Prim s algorithm and Dijkstra s algorithm is that Dijkstra s
algorithm uses a different key.
True
False
Question No: 30 ( Marks: 1 ) - Please choose one
The difference between Prim s algorithm and Dijkstra s algorithm is that Dijkstra s
algorithm uses a same key.
True
False
Question No: 31 ( Marks: 1 )
Do you think greedy algorithm gives an optimal solution to the activity scheduling
problem?
yes, greedy algorithm gives an optimal solution to the activity scheduling
problem. as we have the data as a whole ,and activity a1 must be started at a given start time and ends at a given finish time. all the intermediate activities who overlap will be excluded automatically as no new activity will be selected as our data till the finish of last activity. so this greediness of algorithm gives us the optimal solution.
Question No: 32 ( Marks: 1 )
Define Forward edge
A forward edge is a non-tree edge that connects a vertex to a descendent in a DFS-tree.
Question No: 33 ( Marks: 2 )
Is there any relationship between number of back edges and number of cycles in DFS?
A back edge connects a vertex to an ancestor in a DFS-tree. No back edges means no cycles. But there is some simple relationship Between the number of back edges and the number of cycles. For example, a DFS tree may only have a single back edge, and there may anywhere from one up to an exponential number of simple cycles in the graph.
Question No: 34 ( Marks: 2 )
What is the common problem in communications networks and circuit designing?
Common problem in communications networks and circuit design is that of connecting together a set of nodes by a network of total minimum length. The length is the sum of lengths of connecting wires.
Question No: 35 ( Marks: 3 )
Let the adjacency list representation of an undirected graph is given below.
Explain what general property of the list indicates that the graph has an isolated
vertex.
a b c e
b a d
c a d e f
d b c f
e a c f
f c d e
g
Ans:
A graph is connected if every vertex can reach
Every other vertex. and is isolated if any node has not connected to other vertex ,here’s “g” is the node that is not connected with any other vertex. This general property of the list indicates that the graph has an isolated vertex.
http://ping.fm/LHzSr
42:
Question No: 12 ( Marks: 1 ) - Please choose one
The Huffman codes provide a method of encoding data inefficiently when coded using
ASCII standard.
True
False
Question No: 13 ( Marks: 1 ) - Please choose one
Using ASCII standard the string abacdaacac will be encoded with __________ bits.
80
160
320
100
Question No: 14 ( Marks: 1 ) - Please choose one
Using ASCII standard the string abacdaacac will be encoded with 160 bits.
True
False
Question No: 15 ( Marks: 1 ) - Please choose one
Using ASCII standard the string abacdaacac will be encoded with 320 bits.
True
False
Question No: 16 ( Marks: 1 ) - Please choose one
Using ASCII standard the string abacdaacac will be encoded with 100 bits.
True
False
Question No: 17 ( Marks: 1 ) - Please choose one
Using ASCII standard the string abacdaacac will be encoded with 32 bytes
True
False
Question No: 18 ( Marks: 1 ) - Please choose one
The greedy part of the Huffman encoding algorithm is to first find two nodes with
smallest frequency.
True
False
Question No: 19 ( Marks: 1 ) - Please choose one
The greedy part of the Huffman encoding algorithm is to first find two nodes with
character frequency
True
False
Question No: 20 ( Marks: 1 ) - Please choose one
Huffman algorithm uses a greedy approach to generate an antefix code T that minimizes
the expected length B (T) of the encoded string.
True
False
Question No: 21 ( Marks: 1 ) - Please choose one
Depth first search is shortest path algorithm that works on un-weighted graphs.
True
False
Question No: 22 ( Marks: 1 ) - Please choose one
Dijkestra s single source shortest path algorithm works if all edges weights are nonnegative
and there are no negative cost cycles.
True
False
Question No: 23 ( Marks: 1 ) - Please choose one
Dijkestra s single source shortest path algorithm works if all edges weights are negative
and there are no negative cost cycles.
True
False
hb
Question No: 24 ( Marks: 1 ) - Please choose one
Floyd-Warshall algorithm is a dynamic programming algorithm; the genius of the
algorithm is in the clever recursive formulation of the shortest path problem.
True
Flase
Question No: 25 ( Marks: 1 ) - Please choose one
Floyd-Warshall algorithm, as in the case with DP algorithms, we avoid recursive
evaluation by generating a table for
k
ij d
True
Flase
Question No: 26 ( Marks: 1 ) - Please choose one
The term coloring came form the original application which was in map drawing.
True
False
Question No: 27 ( Marks: 1 ) - Please choose one
In the clique cover problem, for two vertices to be in the same group, they must be
_______________each other.
Apart from
Far from
Near to
Adjacent to
Question No: 28 ( Marks: 1 ) - Please choose one
In the clique cover problem, for two vertices to be in the same group, they must be apart
from each other.
True
False
Question No: 29 ( Marks: 1 ) - Please choose one
The difference between Prim s algorithm and Dijkstra s algorithm is that Dijkstra s
algorithm uses a different key.
True
False
Question No: 30 ( Marks: 1 ) - Please choose one
The difference between Prim s algorithm and Dijkstra s algorithm is that Dijkstra s
algorithm uses a same key.
True
False
Question No: 31 ( Marks: 1 )
Do you think greedy algorithm gives an optimal solution to the activity scheduling
problem?
yes, greedy algorithm gives an optimal solution to the activity scheduling
problem. as we have the data as a whole ,and activity a1 must be started at a given start time and ends at a given finish time. all the intermediate activities who overlap will be excluded automatically as no new activity will be selected as our data till the finish of last activity. so this greediness of algorithm gives us the optimal solution.
Question No: 32 ( Marks: 1 )
Define Forward edge
A forward edge is a non-tree edge that connects a vertex to a descendent in a DFS-tree.
Question No: 33 ( Marks: 2 )
Is there any relationship between number of back edges and number of cycles in DFS?
A back edge connects a vertex to an ancestor in a DFS-tree. No back edges means no cycles. But there is some simple relationship Between the number of back edges and the number of cycles. For example, a DFS tree may only have a single back edge, and there may anywhere from one up to an exponential number of simple cycles in the graph.
Question No: 34 ( Marks: 2 )
What is the common problem in communications networks and circuit designing?
Common problem in communications networks and circuit design is that of connecting together a set of nodes by a network of total minimum length. The length is the sum of lengths of connecting wires.
Question No: 35 ( Marks: 3 )
Let the adjacency list representation of an undirected graph is given below.
Explain what general property of the list indicates that the graph has an isolated
vertex.
a b c e
b a d
c a d e f
d b c f
e a c f
f c d e
g
Ans:
A graph is connected if every vertex can reach
Every other vertex. and is isolated if any node has not connected to other vertex ,here’s “g” is the node that is not connected with any other vertex. This general property of the list indicates that the graph has an isolated vertex.
http://ping.fm/LHzSr