Вы находитесь на странице: 1из 6

ASSESMENT ITEM 2

ASSIGNMENT 1
ITC411 - Computer Organization and Architecture

CHANDANA S EDIRISINGHE 1154767 Lecturer: Geetu Sharma

ASSIGNMENT ITEM 2 | ASSIGNMENT 1

ITC411 COPUTER ORGANIZATION AND ACHITECTURE | 2

1. Under the von Neumann architecture, a program and its data are both stored in memory. It is therefore possible for a program, thinking a memory location holds a piece of data when it actually holds a program instruction, to accidentally (or on purpose) modify itself. What implication does this present to you as a programmer? Answer: To insure no automatic modifications occurs, great care need to be taken when programming. As an example, if a memory location keep an instruction set (which is represent in binary) as well as if a value added to that instruction set the result could be a another value or instruction in next fetch and to executed. If the program accidently modifies its instruction value, error could be occurring and resulting will be a wrong. It is difficult to track down the error which is occurred in the program. The modification of an instruction could also cause a problem to crash. Important thing when writing a program is, pay more attention on how programmer keep the program instruction and data in separate memory location and fetch and execute them in certain manor. This could be done using memory manager which is data and instruction store in separate memory locations. Programmers could do compress the instruction and decompress them when program run in the first time.

2. What are the limitations of Moores Law? Why cant this law hold forever? Answer: Moores low condition is overall processing power of the computer or processor speed will double every two years which is not talking these days but this law still applied for CPU manufacturing. In current technology concern about using more transistors to double the processing power to increase CPU process. There are limitation in manufacturing microprocessors, which is that transistors cannot be created as atomic particles, Which cant be pack more in and still dissolve enough heat to keep them from burning out and even cant create infinitely larger and still accommodate high clock rate. There will be no room for increase in the CPU market where speed are concerned. Technology is improving at an unpredictable speed and I can only see this picking up speed in coming future. Future is unpredictable as it is.

3. Given a (very) tiny computer that has a word size of 6 bits, what are the smallest negative numbers and the largest positive numbers that this computer can represent in each of the following representations? a. Signed magnitude b. One's complement c. Two's complement

ASSIGNMENT ITEM 2 | ASSIGNMENT 1

ITC411 COPUTER ORGANIZATION AND ACHITECTURE | 3

Answer: Smallest negative number 1 111112 (-31) 1000002 (-31) 1000002 (-32) Largest positive number 0 111112 (31) 0111112 (31) 0111112 (31)

Signed magnitude One's complement Two's complement

4. Convert the followings: [a, b, c: 1 mark each; d, e: 2 marks each. Total 7 marks] a. AC1216 to binary Answer: Hexadecimal Binary Answer in binary

A = 10 1010

C=12 1 1100 0001 10101100000100102

2 0010

b. 10710 to 8-bit 2s Complement Answer: -10710 c. 11001101012 to Hexadecimal Answer: Binary Hexadecimal Answer

100101012

00011 3

0011 3 33510

0101 5

d. 100111102 (8-bit 2s complement representation) to decimal Answer: 100111102 1st complement 10011110 00000001 (-1) 10011101 Binary(Invert) 01100010 Answer 9810 e. 1.510 to IEEE-754 single precision Answer: -1.510 IEEE-754 single precision Sign Exponent Mantissa 1 01111111 10000000 1 01111111 10000000000000000000000

ASSIGNMENT ITEM 2 | ASSIGNMENT 1

ITC411 COPUTER ORGANIZATION AND ACHITECTURE | 4

5. Construct the XOR operator using only AND, OR and NOT gates. Answer: X 0 0 1 1 Y 0 1 0 1
X XY Y XY + XY X X Y XY

XOR 0 1 1 0

6. Tyrone Shoelaces has invested a huge amount of money into the stock market and doesn't trust just anyone to give him buying and selling information. Before he will buy a certain stock, he must get input from three sources. His first source is Pain Webster, a famous stock broker. His second source is Meg A. Tyrones third source is Madame LaZora, world famous psychic. After several months of receiving advice from all three, he has come to the following conclusions: a. Buy if Pain and Meg both say yes and the psychic says no. b. Buy if the psychic says yes. c. Don't buy otherwise.

Construct a truth table and find the minimized Boolean function to implement the logic telling Tyrone when to buy. Draw a circuit diagram for the Boolean function. Answer: Truth Table: Pain Webster (X) 0 0 0 0 1 1 1 1 Meg A (Y) 0 0 1 1 0 0 1 1 Madame LaZora (Z) 0 1 0 1 0 1 0 1 Decision 0 1 0 1 0 1 1 1

ASSIGNMENT ITEM 2 | ASSIGNMENT 1

ITC411 COPUTER ORGANIZATION AND ACHITECTURE | 5

Decision = XYZ + XYZ + XYZ + XYZ + XYZ Simplify Using K-Map

YZ X 0 1 00 01 1 1 11 1 1 10 0 1

Decision = Z + XY

Circuit Diagram

Y Z + XY Z

ASSIGNMENT ITEM 2 | ASSIGNMENT 1

ITC411 COPUTER ORGANIZATION AND ACHITECTURE | 6

Reference Null, L., & Lobur, J. (2012). Essentials of Computer Organization and Architecture (3rd ed.). Jones and Bartlett Publishing, Boston, MA, USA Kadhim Shubber,(October 23,2013). Moores Law Is Dead: The Future Of Computing. Retrieved from http://www.theconnectivist.com/2013/10/moores-law-is-dead-the-future-ofcomputing/

Вам также может понравиться