This text provides answers to questions related to computer organization and architecture. It covers topics such as binary, hexadecimal, logic gates, and more. The text also includes a bibliography with relevant sources.
Contribute Materials
Your contribution can guide someone’s learning journey. Share your
documents today.
Running head: COMPUTER ORGANIZATION AND ARCHITECTURE Computer Organization and Architecture Name of Student- Name of University- Author’s Note-
Secure Best Marks with AI Grader
Need help grading? Try our AI Grader for instant feedback on your assignments.
1COMPUTER ORGANIZATION AND ARCHITECTURE Answer to Question 1: a.(2ED1)16to Binary (2ED1)16= (0010 1110 1101 0001)2 b.−29.6610to Binary Firstly, converting 29.66 to binary, we get (29.66)10= (11101.101010001111010111)2 Since, the number is negative Two’s complement is to be done for getting the binary number So, −29.6610= (00010.010101110000101001) c.1001111001102to Hexadecimal (1001 1110 0110) = (9E6)16 d.11101110 (8-bit 2’s complement representation) to decimal = 11101110 to decimal is 18 Since, the number given has 1 on the MSB bit, so the number after conversion is (-18) e.1 01111110 11000000000000000000000 The MSB 1 shows that the number will be negative. 01111110 in binary will be 126 is the exponent. The bias is 127.
2COMPUTER ORGANIZATION AND ARCHITECTURE 11000000000000000000000 will be 0.75 is the fraction (-1)sign bit*(1+fraction)* 2exponent–bias So, the decimal number will be(-1)sign bit* (1.075) *2126-127= -0.875 Answer to Question 2: a.There are two universal gates NAND gate and NOR gate. The NAND gate is represented as the complement of AND gate. NOR gate comprises of NOT gate and OR gate. Using the NAND gate inverter that can be made is shown below. b.The expression for the circuit is stated below: QAJ + QA’J + Q’AJ + QAJ’ = P QA (J + J’) + J (QA’ + Q’A) = P QA + J (Q XOR A) = P The logic diagram for this above circuit is
3COMPUTER ORGANIZATION AND ARCHITECTURE Answer to Question 3: XYZX⨁YYZ(X⨁Y ⨁ZY)’ (Z.Y)'X⨁Y ⨁ZY ⨁ZY’ X. X⨁ Y F 1110100101 Minimized Boolean expression is {(X + Y)⨁(YZ)⨁(YZ)’}’ + X . X⨁Y
Paraphrase This Document
Need a fresh take? Get an instant paraphrase of this document with our AI Paraphraser
4COMPUTER ORGANIZATION AND ARCHITECTURE Bibliography Collier, C. P., Wong, E. W., Belohradský, M., Raymo, F. M., Stoddart, J. F., Kuekes, P. J., ... & Heath,J.R.(1999).Electronicallyconfigurablemolecular-basedlogic gates.Science,285(5426), 391-394. Huang, Y., Duan, X., Cui, Y., Lauhon, L. J., Kim, K. H., & Lieber, C. M. (2001). Logic gates and computation from assembled nanowire building blocks.Science,294(5545), 1313- 1317. Neamen, D. A. (2001).Electronic circuit analysis and design(Vol. 2). McGraw-Hill.