Question 11 : In what way the Symmetry Sparse Matrix can be stored efficiently?
1. Heap
2. Binary tree
3. Hash table
4. Adjacency List
View Answer   Discuss with Members

Question 12 : Is Sparse Matrix also known as Dense Matrix?
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 13 : What will be the suffix array of the string 'engineering'?
1. 2 3 8 4 9 1 7 5 0 6 10
2. 5 0 6 1 4 9 1 7 0 2 3 8
3. 5 0 6 10 2 4 9 1 7 3 8
4. 5 0 6 10 2 3 8 4 9 1 7
View Answer   Discuss with Members

Question 14 : Who coined the term Sparse Matrix?
1. Harry Markowitz
2. James Sylvester
3. Chris Messina
4. Arthur Cayley
View Answer   Discuss with Members

Question 15 : Suffix array is space efficient and faster than the suffix tree.
1. True
2. Fasle
3.
4.
View Answer   Discuss with Members

Question 16 : The matrix contains m rows and n columns. The matrix is called Sparse Matrix if ________
1. Total number of Zero elements > (m*n)/2
2. Total number of Zero elements = m + n
3. Total number of Zero elements = m/n
4. Total number of Zero elements = m-n
View Answer   Discuss with Members

Question 17 : What are some of the disadvantages of parallel arrays?
1. Poor locality of reference for non-sequential access
2. Very little direct language support
3. Expensive to shrink or grow
4. All of the mentioned
View Answer   Discuss with Members

Question 18 : If comparison based sorting algorithm is used construct the suffix array, then what will be time required to construct the suffix array?
1. O(nlogn)
2. O(n²)
3. O(n²logn)
4. O(n²) + O(logn)
View Answer   Discuss with Members

Question 19 : Which of the following is not the method to represent Sparse Matrix?
1. Dictionary of Keys
2. Linked List
3. Array
4. Heap
View Answer   Discuss with Members

Question 20 : How will you implement dynamic arrays in Java?
1. Set
2. Map
3. HashMap
4. List
View Answer   Discuss with Members