The Hamming distance is calculated by comparing two strings bit by bit and counting how many bits are different between them. Let's compare the two binary strings:
\( \text{11001011} \) \( \text{10000111} \)
Comparing each bit position:
The bits that differ are at positions 2, 5 and 6.
Therefore, the Hamming distance is 3.
Therefore, the correct answer is 3.
| List-I | List-II |
|---|---|
| (A) Static web page | (II) A web page whose content is fixed. |
| (B) Home page | (IV) First page of website. |
| (C) Dynamic web page | (I) A web page whose content keeps changing. |
| (D) Web server | (III) Delivers the contents to web browser. |
A Session variable is created ________.