Data Structure I Mock Test 3

10%

Question 1 of 10

1. Is O(n) the Worst case Time Complexity for addition of two Sparse Matrix?

False

True

Question 1 of 10

Question 2 of 10

2. Consider the postfix expression 4 5 6 a b 7 8 a c, where a, b, c are operators. Operator a has higher precedence over operators b and c. Operators b and c are right associative. Then, equivalent infix expression is

4 a 5 6 b 7 8 a c

4 a 5 c 6 b 7 a 8

4 b 5 a 6 c 7 a 8

4 a 5 b 6 c 7 a 8

Question 2 of 10

Question 3 of 10

3. The matrix contains m rows and n columns. The matrix is called Sparse Matrix if ________

Total number of Zero elements = m + n

Total number of Zero elements > (m*n)/2

Total number of Zero elements = m/n

Total number of Zero elements = m-n

Question 3 of 10

Question 4 of 10

4. What is a bit array?

Array in which elements are not present in continuous locations

Data structure for representing arrays of records

Data structure that compactly stores bits

An array in which most of the elements have the same value

Question 4 of 10

Question 5 of 10

5. 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?

2 and 2

2 and 6

6 and 6

6 and 2

Question 5 of 10

Question 6 of 10

6. Dynamic arrays overcome the limit of static arrays.

True

False

Question 6 of 10

Question 7 of 10

7. Which class in Java can be used to represent bit array?

BitSet

BitStream

BitVector

BitArray

Question 7 of 10

Question 8 of 10

8. What is the time required to locate the occurrences of a pattern P of length m in a string of length n using suffix array?

O(nm)

O(mlogn)

O(mnlogn)

O(n²)

Question 8 of 10

Question 9 of 10

9. How many passes does the balancing symbols algorithm makes through the input?

three

two

four

one

Question 9 of 10

Question 10 of 10

10. The result of the postfix expression 5 3 * 9 + 6 / 8 4 / + is _____________

Question 10 of 10