×
Detail Form
We will send your result on your email id and phone no. please fill detail
1.
Which data structure is used in redo-undo feature?
2.
Which data structure is most efficient to find the top 10 largest items out of 1 million items stored in file?
3.
The best data structure to check whether an arithmetic expression has balanced parentheses is a (GATE CS 2004)
4.
Which among the following data structures is best suited for storing very large numbers (numbers that cannot be stored in long long int). Following are the operations needed for these large numbers.
5.
Which data structure is best suited for converting recursive implementation to iterative implementation of an algorithm?
6.
Which of the following standard algorithms is not a Greedy algorithm?
7.
What is the time complexity of Huffman Coding?
8.
In question #2, which of the following represents the word "dead"?
9.
Which of the following is true about Huffman Coding.
10.
Suppose the letters a, b, c, d, e, f have probabilities 1/2, 1/4, 1/8, 1/16, 1/32, 1/32 respectively. Which of the following is the Huffman code for the letter a, b, c, d, e, f?