Flashcards - Computer System Week 4 Study Set

1
Q

What is the representation method for negative integers that uses a separate sign bit?

A

sign and magnitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Which integer representation method has two representations of zero?

A

sign and magnitude

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What representation method involves inverting all bits to convert a positive number to a negative number?

A

1’s complement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is a limitation of 1’s complement representation?

A

It has both +0 and -0 representations.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How do you convert a positive number to its negative form using 2’s complement?

A

Find the 1’s complement and add 1.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

In 2’s complement representation, how is zero represented?

A

Only one representation of zero exists.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is the first step in binary subtraction using 2’s complement?

A

Find the 2’s complement of the number to be subtracted.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is the formula for a floating point number?

A

n = f x r^e

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

In a 32-bit floating point representation, how many bits are used for the mantissa?

A

23 bits

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What does ASCII stand for?

A

American Standard Code for Information Interchange

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

How many different codes are available in simple ASCII?

A

128 codes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is the logical operation represented by the symbol AND?

A

It is true if both A and B are true, otherwise false.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is the algebraic foundation of digital logic?

A

Boolean Algebra

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Which logical gate represents the operation that is false unless both inputs are true?

A

NAND

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is the function of the NOT gate in Boolean logic?

A

It inverts the input value.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

In digital logic, what does the OR gate do?

A

It is true if at least one input is true.

17
Q

Which Boolean operator results in the opposite of the input signal?

18
Q

What representation uses 7 bits to represent characters?

19
Q

What is the characteristic of the 1’s complement system regarding zero?

A

It suffers from the problem of +0 and -0.

20
Q

What is the maximum number of bits used for the exponent in a 32-bit floating point representation?

21
Q

How is a binary floating point number expressed in scientific notation?

A

By writing it as n = f x r^e.

22
Q

What are the basic operations for 1 bit binary addition?

A

0 + 0 = 0, 1 + 0 = 1, 0 + 1 = 1, 1 + 1 = 10

23
Q

What two binary numbers are added in the example given in the text?

A

1101 1001 and 0001 1110

24
Q

What role does the leftmost bit play in 1’s complement representation?

A

It indicates if the number is negative.

25
Q

What limitation does the sign and magnitude method have regarding zero?

A

It can represent two forms of zero.

26
Q

In binary arithmetic, what happens when adding three 1’s together?

A

The result is 11 (carry and 1).