the r's complement of N is defined as
**** r ==> radix or base n ==> number of fields N ==> Number
**** r ==> radix or base n ==> number of fields N ==> Number
Anonymous Quiz
62%
r^n - N
30%
r^n - N - 1
8%
r^n - N +1
the r-1's complement of N is defined by
*** r ==> radix or base n ==> number of fields in the integral part m ==> number of fields in the fractional part N ==> Number
*** r ==> radix or base n ==> number of fields in the integral part m ==> number of fields in the fractional part N ==> Number
Anonymous Quiz
11%
r^m - r^n - n
57%
r^n - r^-m - N
29%
r^n - r^m - N
4%
r^-n - r^m - N
لاي رقم عموما تقدر تجيبله الr و الr-1 كومبليمينت بالصيغتين دول سواء بقى الارقام فيها جزء عشري او لا
r ==> r^n - N
r-1 ==> r^n - r^-m - N
******
r: radix or base
n: number of fields in the integral part
m: number of fields in the fractional part
N: Number
******
نفترض انك بتجيب لرقم عشري بس يبقى ال n=0 وساعتها ... r^n=1 لان اي حاجة اس صفر بتساوي واحد
نفترض انك بتجيب لرقم صحيح بس يبقى الm=0 فحالة انك بتجيب الr-1's complement وساعتها r^-m=1
نفترض انك بتجيب لرقم فيه جزء صحيح وجزء عشري هتعوض فالقانونين من غير مشاكل
r ==> r^n - N
r-1 ==> r^n - r^-m - N
******
r: radix or base
n: number of fields in the integral part
m: number of fields in the fractional part
N: Number
******
نفترض انك بتجيب لرقم عشري بس يبقى ال n=0 وساعتها ... r^n=1 لان اي حاجة اس صفر بتساوي واحد
نفترض انك بتجيب لرقم صحيح بس يبقى الm=0 فحالة انك بتجيب الr-1's complement وساعتها r^-m=1
نفترض انك بتجيب لرقم فيه جزء صحيح وجزء عشري هتعوض فالقانونين من غير مشاكل
In subtraction with r's complement if an end carry occurs
Anonymous Quiz
39%
add 1 to the lsd (End arround carry)
61%
discard it
In subtraction with r's complement if an end carry ....... take the r's complement of the final number and place a negative sign
Anonymous Quiz
34%
occurs
66%
doesn't occur
the ... 's complement has the advantage of being easier to implement by digital components
Anonymous Quiz
77%
1
23%
2
the ..'s complement is advantageous in that only arithmetic addition operation is required
Anonymous Quiz
20%
1
80%
2
the ..'s complement requires two arithmetic additions when an end around carry occurs
Anonymous Quiz
60%
1
40%
2
A binary number of n digits may be represented by .. binary circuit elements each having an output signal equivalent to 0 or 1
Anonymous Quiz
22%
n
18%
n^2
57%
2^n
2%
4
Any discrete information element distinct among a group of quantites can be represented by a binary code
Anonymous Quiz
93%
T
7%
F
To represent a group of 2^n distnict elements in a binary code requires a minimum of ... bits
Anonymous Quiz
42%
n
11%
n^2
38%
2^n
9%
2
binary codes for decimal digits require a minimum of .. bits
Anonymous Quiz
14%
n
11%
n^2
25%
2^n
50%
4
A decimal code that has been used in some old computers is
Anonymous Quiz
86%
Excess-3
7%
Biquinary
7%
Other
The bits obtained from conversion are
Anonymous Quiz
44%
binary digits
56%
combinations of 0's and 1's arranged according to the rules of the code
the biquinary code is an example of ... bit code with error detection properties
Anonymous Quiz
6%
5
8%
6
61%
7
26%
8