Explore topic-wise InterviewSolutions in .

The correct choice is (C) Suffix array is always unsorted

For explanation: Suffix array is always sorted as it contains all the suffixes of a string in sorted order. Suffix ARRAYS are USED to solve PROBLEMS related to string, LIKE string matching problems.

Right OPTION is (c) O(N)

The explanation is: In the WORST case, an element MUST added to the front of the array, which means that rest of the elements have to be shifted, HENCE the worst case time complexity becomes O(n).

Right choice is (d) Hash Tables

Easy explanation - Sorted arrays have widespread APPLICATIONS as all commercial COMPUTING INVOLVES large data which is very USEFUL if it is sorted. It makes best use of locality of reference and data CACHE. Linked lists are used in Hash Tables not arrays.

Correct option is (C) BINARY Search

The best explanation: Since the array is sorted, binary search is preferred as its TIME complexity is O(logn).

Correct ANSWER is (d) All of the mentioned

To explain: The ARRAY can be sorted in any way, numerical, ALPHABETICAL or any other way but the ELEMENTS are PLACED at equally spaced addresses.

Correct choice is (B) Dynamic ARRAYS

The best I can explain: Dynamic arrays are used in the implementation of list data TYPE in python. Sparse arrays are used in the implementation of sparse MATRIX in Numpy module. All bit array operations are implemented in BITARRAY module.

Correct CHOICE is (a) O (n)

To explain: In general, the time complexity of INSERTING or deleting elements at the end of dynamic array is O (1). Elements are added at reserved space of dynamic array. If this reserved space is EXCEEDED, then the physical size of the dynamic array is reallocated and every element is copied from ORIGINAL array. This will take O(n) time to add NEW element at the end of the array.

Correct ANSWER is (d) If the array holds less number of elements

Explanation: Dynamic ARRAYS are preferred when the size of the array is unknown during memory allocation or the size CHANGES after few iterations or the memory reallocation is expensive. If array holds less number of elements, the physical size is reduced and REDUCTION takes more time. In that CASE, we can use normal arrays instead of dynamic arrays.

Right option is (B) False

For explanation: Physical SIZE of a Dynamic array is fixed with a larger value. Dynamically MEMORY ALLOCATED arrays are arrays whose memory is allocated at run time rather than at compile time. Dynamically memory allocated arrays don’t have physical size at the backend. Thus, Dynamic arrays and Dynamically memory allocated arrays are DIFFERENT.

Correct ANSWER is (a) True

Best explanation: STATIC ARRAYS have fixed capacity. The capacity must be specified during memory allocation. Dynamic arrays don’t require to specify their capacity during memory allocation. Dynamic arrays have fixed physical size at BACKEND and its capacity INCREASES if required. Thus, Dynamic arrays overcome the limit of static arrays.

Right ANSWER is (d) Memory leak

Explanation: Dynamic arrays share the ADVANTAGE of arrays, added to it is the dynamic addition of elements to the ARRAY. Memory can be leaked if it is not HANDLED properly during allocation and deallocation. It is a disadvantage.

The correct choice is (c) Bounded-size dynamic array

Explanation: The FIRST PART stores the items of the dynamic array and the SECOND part is reserved for new ALLOCATIONS.

The CORRECT option is (a) ArrayList AL = new ArrayList();

For explanation: This is a non-generic WAY of CREATING an ArrayList.

Correct choice is (d) List

Explanation: ArrayList is USED to implement dynamic arrays in JAVA.

Right answer is (c) LOGICAL SIZE

The best I can EXPLAIN: The number of items used by the DYNAMIC array contents is called logical size. PHYSICAL size is the size of the underlying array, which is the maximum size without reallocation of data.

The correct option is (C) The size of the underlying array at the back-end

Explanation: Physical size, ALSO called array CAPACITY is the size of the underlying array, which is the maximum size WITHOUT relocation of data.

Right option is (a) A variable SIZE data structure

Explanation: It is a varying-size list data structure that allows items to be added or removed, it MAY use a FIXED SIZED array at the BACK end.

The correct option is (b) FIND First One

The best EXPLANATION: Find First One operation returns the first occurrence of bit 1 in the bit array. Find First Zero operation returns the first occurrence of bit 0 in the bit array. If the most significant bit in bit array is 1, then COUNT lead zeroes operation returns the NUMBER of zeroes present before the most significant bit. If the most significant bit in bit array is 0, then the count lead one returns the number of ONES present before the most significant bit.

The correct answer is (b) False

Explanation: Bit field CONTAINS the number of adjacent computer locations USED to store the sequence of BITS to address a bit or groups of bits. Bit array is an array that stores combinations of bit 0 and bit 1. THUS, bit fields and Bit arrays are different.

Right OPTION is (a) Finding the number of 1 bit in a bit array

The explanation is: Hamming/ population COUNT INVOLVES finding the number of 1’s in the bit array. Population count is used in DATA compression.

Correct choice is (a) True

For explanation: A bit ARRAY stores the combinations of bit 0 and bit 1. Each bit in the bit array is independent. Run Length encoding is a data compression technique in which data are STORED as single value and NUMBER of times that value repeated in the data. This compression reduces the space complexity in arrays. Bit arrays WITHOUT compression require more space. THUS, we will use Run-Length encoding in most of the cases to compress data in bit arrays.

Correct CHOICE is (b) NOT

The BEST I can explain: NOT operation is used to INVERT all the BITS stored in a bit array.

Eg: NOT (10110010) = 01001101.

The CORRECT choice is (a) BitSet

The explanation is: The BitSet class CREATES a special TYPE of array that can HOLD bit values.

The correct answer is (d) Implementation of Vectors and Matrices

The BEST explanation: NORMAL Arrays are USED to implement vectors and matrices. Bit arrays have no prominent role. Remaining all are APPLICATIONS of Bit Arrays.

The correct choice is (d) Storing and Manipulating in the register set for long PERIODS of time

For explanation: Bit arrays allow small arrays of BITS to be stored and manipulated in the register set for long periods of time with no memory accesses because of their ability to exploit bit-level parallelism, limit memory ACCESS, and MAXIMALLY USE the data cache, they often outperform many other data structures on practical data sets. This is an advantage of bit array. The rest are all disadvantages of bit array.

Correct option is (d) Accessing Individual Elements is easy

To explain: Individual Elements are difficult to access and can’t be accessed in some programming languages. If random access is more common than SEQUENTIAL access, they have to be compressed to byte/word array. Exploit Bit parallelism, MAXIMAL USE of data cache and storage and manipulation for longer TIME in register set are all advantages of bit array.

Correct OPTION is (b) AND

The BEST explanation: 1 AND 0 = 0, 0 AND 0 = 0, any BIT AND with 0 gives 0.