Question: Question 1: (12.0 Points; each 3.0) Solve the following: 1. The number of bits needed to represent 61 unique IDs. Ans: 2. Using 2's complement.

Question 1: (12.0 Points; each 3.0) Solve the following: 1. The number of bits needed to represent 61 unique IDs. Ans: 2. Using 2's complement. The largest negative number with one byte word length is: Ans: 3. (82)10 + (86)10 = ( = Jxs-3 Ans: 4. The base of the following is: (3), = (12)] ( ) Ans
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
