Chap 2 - Part 2 - Cont'd

Question 1

Define:

Binary Digit

Answer 1

Also known as binary bit

• One of the two numbers in base 2, 0 or 1, that are the components of information

Question 2

Define:

Least significant bit

Answer 2

The rightmost bit in a MIPS word

Question 3

Define:

Most significant bit

Answer 3

The leftmost bit in a MIPS word

Question 4

Define:

Instruction format

Answer 4

This is a form of representation of an instruction composed of fields of binary numbers

Question 5

Define:

Machine language

Answer 5

This is the binary representation used for communication within a computer system

Question 6

Define and explain:

Unsigned Binary Integers

Answer 6

• An unsigned binary integer: is a fixed-point system with no fractional digits
• Unsigned binary integers are positive number systems, usually with a modulus, which is a power of 2
• Ex.
  
  • a 4-bit unsigned binary number has values ranging from:
    
    • (0000₂)(0₁₀) to 1111₂ (15₁₀)

Modern computers support binary integers of 8, 16, 32, or 64 bits

the largest value in any unsigned binary integer system is:

• one containing all 1’s, similarly, just as the largest decimal number is the one containing all 9’s.
• largest modulo - 1000₁₀ = 999₁₀
• Largest modulo - 1000₂ = 111₂

Question 7

What is the largest value possible in N bits for unsigned binary integers?

Answer 7

largest value possible in N bits is:

2^N -1

Image;

Question 8

Explain:

One’s complement

Answer 8

This is a notation that represents:

• The most negative value by 10…000₂ and…
• the most positive value by 01…. 11₂

This notation leaves an equal number of negatives and positives but ends up with two zeroes

The term is also used to mean the Inversion of every bit in a pattern:

0 to 1 and 1 to 0

Question 9

Negation shortcut:

Explain this concept

Answer 9

This is also known as:

Bitflipping

Suppose we want to come up with the 1’s complement representation for the number -2 in base 10…

• start by converting 2₁₀ to base 2:
  
  • 2₁₀ = 0010₂
• flip all the bits == 1101
• And, add 1, therefore == 1110

OR

Another shortcut of bitflipping is:

you may flip all the bits to the left of the least significant set bit…

• eg.
  
  • 2₁₀ = 0010₂ = 1110 [done!]

Question 10

Explain the concept of:

2s- complement signed integers

Answer 10

Given an N-bit number…

we can let its range be:

• -2^n-1 to + 2^n-1 - 1

So, using 32 bits yield the range:

Image:

Question 11

Example of:

2s-Complement signed integers

Answer 11

Question 12

Explain:

Signed Negation

Answer 12

Complement and add 1:

• Complement means 1 > 0, 0 > 1
• ex
  
  • Image:

Question 13

About Sign Extension Concept

Answer 13

Image:

Question 14

About Hexadecimal concept

Answer 14

Image:

Question 15

Signed Vs. Unsigned

Answer 15

Image:

Question 16

Define leaf procedures

Answer 16

This are types of procedures that doesn’t call any other procedures

Question 17

Leaf Procedure Example:

Answer 17

Question 18

Define non-leaf procedures

Answer 18

These are procedures that call other procedures

For nested call, caller needs to save on the stack:

• its return address
• any arguments and temporaries needed after the call
• restore from the stack after the call

Image:

Question 19

Non-leaf procedure Example:

Answer 19

No answer to this, just an example of the non-leaf procedure, check question