首页 新闻 聚焦 科技 财经 创业 综合 图片 视频

IT界

旗下栏目: 行业 生态 IT界 创新

代写CISC 260程序、Java,Python

来源:互联网 发布时间:2021-03-08
代写CISC 260程序、Java,Python
CISC 260 Machine Organization and Assembly Language
(Spring 2021)
Assignment # 2
(Due: March 10, 2021)
1. [25 points] Given the following truth table, where X, Y, and Z are input and W is
output, write the canonical expression and generate gate-level logical circuit
(draw the wire diagram).
X Y Z W
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1
2. [25 points] Simply the Following Boolean expressions as much as you can.
a) Y= BC + ~A~B~C + B~C
b) Y = ~(A+~AB+~A~B) + ~(A+~B)
3. [25 points] You are asked to design a circuit to detect if an overflow occurs when
adding two integers represented in two's complement: Z = X + Y. Let Sz, Sx, and
Sy be the sign bit for Z, X, and Y Respectively, and they are fed as input to the
circuit. Let O be the output bit of the circuit, whose value is 1 if an overflow
happens, and 0 if otherwise.
a) Build the truth table for O as a Boolean function of Sx, Sy, and Sz.
b) Write the canonical expression (sum-of-product) for the Boolean function
defined in the part a.
c) Implement the Boolean expression defined in part b with a circuit by using
AND, OR, and NOT gates. Draw the wiring diagram.
4. [25 points] Prove that NOR gate is universal, by showing how AND, OR, and NOT
gates can be built by wiring a Bunch of NOR gates. Draw the wire diagram for each
case. 
 
如有需要,请加QQ:99515681 或WX:codehelp
  免责声明:珠穆朗玛网对于有关本网站的任何内容、信息或广告,不声明或保证其正确性或可靠性,用户自行承担使用网站信息发布内容的真假风险。
责任编辑:珠穆朗玛网