Von numen
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 implications does this present to you as a programmer?
Ans: The programmer should taken proper care so that the program doesn’t modify itself when programming. for example if a program location holds an instruction and later a value is added to that instruction it will later show error. It is very difficult to track down as well. The modification of an instruction may also cause the program to crush.
2. What are the limitations of Moore’s Law? Why can’t this law hold forever?
Ans: The limitation is that transistors cannot be made infinitely small, and computer chips cannot be made infinitely large and still accommodate high clock rates.This law cant hold forever because There is no replacement for silicon and computing power cannot go on doubling every two years indefinitely.
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
Ans: A) Largest Positive: 0111112 (31) Smallest Negative: 1000002 (−31)
B. Largest Positive: 0111112 (31) Smallest Negative: 1000002 (−31) C. Largest Positive: 0111112 (31) Smallest Negative: 1000002 (−32)
4. converttion
a. Ans. AC1216 = 1010 1100 0001 00102
b. Signed magnitude: 11101011 One's complement: 10010100 Two's complement: 10010101
c.
5. Construct the XOR operator using only AND, OR and NOT gates xXORy=x’y+xy’ x
y
Ans: The programmer should taken proper care so that the program doesn’t modify itself when programming. for example if a program location holds an instruction and later a value is added to that instruction it will later show error. It is very difficult to track down as well. The modification of an instruction may also cause the program to crush.
2. What are the limitations of Moore’s Law? Why can’t this law hold forever?
Ans: The limitation is that transistors cannot be made infinitely small, and computer chips cannot be made infinitely large and still accommodate high clock rates.This law cant hold forever because There is no replacement for silicon and computing power cannot go on doubling every two years indefinitely.
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
Ans: A) Largest Positive: 0111112 (31) Smallest Negative: 1000002 (−31)
B. Largest Positive: 0111112 (31) Smallest Negative: 1000002 (−31) C. Largest Positive: 0111112 (31) Smallest Negative: 1000002 (−32)
4. converttion
a. Ans. AC1216 = 1010 1100 0001 00102
b. Signed magnitude: 11101011 One's complement: 10010100 Two's complement: 10010101
c.
5. Construct the XOR operator using only AND, OR and NOT gates xXORy=x’y+xy’ x
y