Question 41 : What is a dynamic array?
1. A variable size data structure
2. An array which is created at runtime
3. The memory to the array is allocated at runtime
4. An array which is reallocated everytime whenever new elements have to be added
View Answer   Discuss with Members

Question 42 : What are some of the applications of bit arrays?
1. Used by the Linux kernel
2. For the allocation of memory pages
3. Bloom filter
4. All of the mentioned
View Answer   Discuss with Members

Question 43 : When do you use a sparse array?
1. When there are unique elements in the array
2. When the array has more occurrence of zero elements
3. When the data type of elements differ
4. In all of the mentioned cases
View Answer   Discuss with Members

Question 44 : Which of the following is/are advantages suffix array one suffix tree?
I. Lesser space requirement
II. Improved cache locality
III. Easy construction in linear time
1. Only I
2. All I, II and III
3. Only I and III
4. Only II and III
View Answer   Discuss with Members

Question 45 : What is a sorted array?
1. Arrays sorted in numerical order
2. Arrays sorted in alphabetical order
3. Elements of the array are placed at equally spaced addresses in the memory
4. All of the mentioned
View Answer   Discuss with Members

Question 46 : Is O(n) the Worst case Time Complexity for addition of two Sparse Matrix?
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 47 : Suffix array can be created in O(nlogn) time.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 48 : Which of the following is an advantage of bit array?
1. Exploit bit level parallelism
2. Maximal use of data cache
3. Can be stored and manipulated in the register set for long periods of time
4. All of the mentioned
View Answer   Discuss with Members

Question 49 : How do you allocate a matrix using a single pointer in C?(r and c are the number of rows and columns respectively)
1. int *arr = malloc(r * c * sizeof(int));
2. int *arr = (int *)malloc(r * c * sizeof(int));
3. int *arr = (int *)malloc(r + c * sizeof(int));
4. int *arr = (int *)malloc(r * c * sizeof(arr));
View Answer   Discuss with Members

Question 50 : Identify the disadvantages of bit array.
1. Without compression, they might become sparse
2. Accessing individual bits is expensive
3. Compressing bit array to byte/word array, the machine also has to support byte/word addressing
4. All of the mentioned
View Answer   Discuss with Members