a) Data structure that compactly stores bits
b) Data structure for representing arrays of records
c) Array in which elements are not present in continuous locations
d) An array in which most of the elements have the same value
- Efficiency: It’s designed to efficiently store boolean values (0 or 1) by utilizing individual bits instead of entire bytes or words.
- Memory savings: This approach significantly reduces memory usage compared to traditional arrays that store each element as a complete byte or larger data type.
- Applications: Bit arrays are commonly used in various algorithms and data structures, such as bloom filters, bitmaps, and set representations.
Essentially, a bit array is like an array, but instead of storing elements like integers or characters, it stores individual bits.