Information Technology Reference
In-Depth Information
2. Demonstrate that addition and carry are reversible using the following numbers
in circuit elements given in this chapter. First run them through from left to right,
and then repeat, running the result back through from right to left.
(a) a
¼
1, b
¼
0, c
¼
1
Reversible Addition
3. Refer to Fig. 7.9 :
(a) Trace the calculation at the outputs of each operation using as input 011
and 110.
4. To accumulate numbers as in Fig. 7.13 , the number of lines for the accumulation
was said to be about N + P. Justify this statement.
Coding
5. Modify the code in the form 00
0000
0000
0000
0000
0000
...
...
...
...
...
to move a 0 to z p0 . (ANS: 10
0000
0000
0000
0000
0001)
...
...
...
...
...
Priority Comparison
6. Perform b
a in binary and inspect the carry out to see if b
a or if b
<
a:
(a) For b
¼
5 and a
¼
5
(b) For b
¼
7 and a
¼
1
(c) For b
¼ 2 and a
¼ 7
(d) For b
¼
7 and a
¼
0
7. In Fig. 7.16 :
(a) What is applied to the B-input when d
¼
011 and e
¼
100? (ANS: The
larger of the two)
(b) What is applied to the A-input when a
¼
110 and b
¼
011?
8. In Fig. 7.17 , assume d
e.
(a) What are the truth values at a 0 ,b 0 ,c 0 ,d 0 ? (ANS: 0, 1, 0, 0)
(b) Can more than one of a 0 ,b 0 ,c 0 ,d 0 go true? (ANS: NO)
(c) If priorities b and a are equal, which corresponding image is permitted into
conscious short-term memory? (ANS: b)
<
b, but that b
a and d
Search WWH ::




Custom Search