Data Structure I Practice Test 3

1. In what way the Symmetry Sparse Matrix can be stored efficiently?

2. When do you use a sparse array?

3. What would be the solution to the given prefix notation?

+ 9 * 3 / 8 4

4. Suppose the contents of an array A are, A = {1, null, null, null, null, 10};
What would be the size of the array considering it as a normal array and a sparse array?

5. Which of the following is/are not applications of bit arrays?

6. Suffix array is space efficient and faster than the suffix tree.

7. To search for an element in a sorted array, which searching technique can be used?

8. Which one of the following is a Special Sparse Matrix?

9. What is the number of moves required to solve Tower of Hanoi problem for k disks?

10. If the corresponding end bracket/braces/parentheses is encountered, which of the following is done?