Author:

(A) An array in which the most of the elements have the same value
(B) Array in which the memory is allocated in run time
(C) Data structure that compactly stores bit
(D) Data structure for representing arrays of records

(A) The data type of elements differs
(B) Elements are sorted
(C) There are unique elements in the array
(D) The array has more occurrence of zero elements

(A) 1
(B) 2
(C) 3
(D) 4

(A) Load balancing
(B) Balancing of symbols
(C) Resource shared between various systems
(D) Data is transferred asynchronously

(A) Ring buffer
(B) Rectangle buffer
(C) Square buffer
(D) None of the above

(A) Top of the stack contains the last inserted element
(B) Elements are stored in a sequential manner
(C) Stack follows FIFO
(D) Arrays can be used to implement the stack

(A) Linked list
(B) Binary tree
(C) Queue
(D) Stack

(A) Index of the first element starts from 1.
(B) Elements of an array can not be sorted.
(C) Elements of the mixed data types can be stored.
(D) Easier to access the elements in an array.