The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | Apr 2017 |
| Last Sign in: | 103 Weeks Ago, 2 Days Ago |
| Questions Answered: | 4870 |
| Tutorials Posted: | 4863 |
MBA IT, Mater in Science and Technology
Devry
Jul-1996 - Jul-2000
Professor
Devry University
Mar-2010 - Oct-2016
1a. What is the minimum number of bits that are required to uniquely represent the characters of English alphabet? (Consider upper case characters alone)
The number of unique bit patterns using i bits is 2i We need at least 26 unique bit patterns. The cleanest approach is to compute log2 26 and take the ceiling .This yields 5 as the answer. Trial and error is also an acceptable solution.
1b. how many more characters can be uniquely represented without requiring additional bits?
With 5 bits, we can represent up to 32 (25) unique bit patterns; we can represent
32 - 26 = 6 more characters without requiring additional bits.
2 Using 7 bits to represent each number, write the representations of 23 and -23 in signed
Magnitude and 2's complement integers.
|
 |
Signed Magnitude |
1's Complement |
2's Complement  |
|
23 |
0010111 |
0010111 |
0010111 Â |
|
-23 |
1010111 |
1101000 |
1101001 |
-----------