My Almost complete Paper
I know no will remember me.....but Please remember me in your prayers....
3-color problem is known as
I know no will remember me.....but Please remember me in your prayers....
3-color problem is known as
Non-optimal or greedy algorithm for money change
takes____________
Using ASCII standard the string “abacdaacac” will be
encoded with __________ bits.
In order to say anything meaningful about our algorithms,
it will be important for us to settle on a ___________
A RAM is an idealized machine with ______________
random-access memory.
Recurrences are useful for analyzing
Where is the smallest element for max-heap, if largest
element is at root?
Matrix multiplication is
The Huffman algorithm find
The Huffman algorithm belongs to
The Huffman codes provide a method of encoding data which
Using ASCII standard the string “abacdaaca” will be
encoded with
In fractional knapsack we sort the
In directed graphs the cardinality of edges |E| =
In generic graph traversal algorithm we
In undirected graphs there
In time stamp traversal we can calculate
Bellman Ford algorithm is for the
Which of the following is not true about Dijkstra’s
algorithm?
Floyd-Warshall algorithm is
If a problem “S” is NP- complete it must be
Clique cover problem arises in applications of
In the clique cover problem, for two vertices to be in
the same group, they must be _______________each other.
Due to left-complete nature of binary tree, heaps can be
stored in
In Random access machine, instructions are executed
________________.
Using ASCII standard each character is represented by a
fixed length codeword of ________________
The Huffman encoding algorithm is a ____________
What is the running time of the above sorting algorithm in worst case?
An optimization problem is one in which you want to find
Suppose that a graph G = (V,E) is implemented using
adjacency lists. What is the complexity of a breadth-first traversal of G?
Total running time of Breadth First Search algorithm is
________
Using ASCII standard the string “abacdaacac” will be
encoded with __________ bytes
Answer yes or no and give a brief explanation for your
choice.
Kruskals algorithm for minimum weight spanning trees is an example of dynamic programming algorithm
Kruskals algorithm for minimum weight spanning trees is an example of dynamic programming algorithm
How greedy algorithm works in phases?
If we implement the bag data structure by using a stack,
then which type of traversal it will be?
When a decision problem L1 is polynomial-time reducible
to decision problem L2?
What is all-pairs shortest paths problem, also describe
Floyd-Warshall algorithm?
Explain the following two basic cases according to
Floyd-Warshall Algorithm,
1. Don’t go through vertex k at all.
2. Do go through vertex k
1. Don’t go through vertex k at all.
2. Do go through vertex k
What is prefix property of Huffman algorithm
Let the adjacency list representation of an undirected
graph is given below:
Is there any loop existed in this list?
What general property of the list indicates that the graph has a loop?
Is there any loop existed in this list?
What general property of the list indicates that the graph has a loop?
Analyze the following pseudo code for Huffman tree
building algorithm. And write the body of second for loop with the proper
logic:
HUFMAN (N, symbol[1…N], freq[1…N]
For i = 1 to N
Do t ß TreeNode(symbol[i], freq[i])
pq.insert(t, freq[i])
for i = 1 to N - 1
?
?
?
?
?
return pq.remove
For i = 1 to N
Do t ß TreeNode(symbol[i], freq[i])
pq.insert(t, freq[i])
for i = 1 to N - 1
?
?
?
?
?
return pq.remove
Prove that the generic TRAVERSE (S) marks every vertex in
any connected graph exactly once and the set of edges (v, parent (v)) with
parent (v) ¹ F form a spanning tree of the graph?
Consider following matrix, which corresponds to the
initialized distance matrix of the all-pairs-shortest-path algorithm.
Execute three iterations of Floyd-Warshal algorithm?
Comments
Post a Comment
Please give us your feedback & help us to improve this site.