This article explains bitmaps (bit arrays) in the Linux kernel, a fundamental data structure used extensively for efficient state tracking. Bitmaps store bits representing binary states and are implemented in the kernel as arrays of unsigned long values, with common operations including set_bit, clear_bit, and test_bit appearing over 28,000 times in kernel source code. Their popularity stems from memory efficiency and speed advantages over alternatives like bool arrays or linked lists.