00:01
Hello student, here a new language is given which having 15 possible letters, 8 different kind of punctuation marks and blank characters.
00:08
So here we have to find the number of bits required to store the letters of the language and number of bits required to store the characters of the language.
00:17
Since we know very well there are all 15 letters, so i have to find the number of bits required to represent the 15 letters.
00:29
So for this i am using the formula 2 raised to power n less than or equal to 15.
00:35
With the help of this formula i will find the number of the bits.
00:39
So here first i will take n equal to 3 but if i take n equal to 3, 2 raised to power 3 is 8 but here characters are 15 so this n equal to 3 cannot represent the number of the letters which are 15.
00:55
So i will go with n equal to 4, n equal to 4 is 16.
00:58
So here 16 is greater than or equal to 15, 16 is greater than 15.
01:03
So here n equal to 4 means 4 bits are required to represent the letter of the language.
01:10
Number 2 situation is to find the number of the bits required to store any characters...