Question: (b) (3 points) Suppose you're developing a new, super-complex language that contains 5170 consonants and 274 vowels. Each consonant and vowel can be either upper
(b) (3 points) Suppose you're developing a new, super-complex language that contains 5170 consonants and 274 vowels. Each consonant and vowel can be either upper or lower case. What is the smallest possible number of bits per character you could use in an encoding scheme for this language? Clearly explain how you arrived at your answer. Assume a fixed- COMP 1900 - Spring 2021 Lab 1 Due: Wed., Feb. 3, by 2359 CST length encoding scheme (i.e., every character uses the same number of bits), as in our examples above
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
