This paper studies the density of zero and one in subwords of the Fibonacci word with lengths less than thirty and compares them to the densities of their corresponding palindromes. We used computational methods to produce a sufficiently large piece of the Fibonacci word, extract all unique subwords up to a predetermined length, and calculate their palindrome. The density of each character (0 and 1) was then determined for both the original subwords and their palindromic counterparts. This study contributes to a d…