Chapter 2 - Data Representation In Computer Systems Flashcards

1
Q

True or False

The organization of any computer depends considerably on how it represents numbers, characters, and control information

A

True

The organization of any computer depends considerably on how it represents numbers, characters, and control information

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

What is a bit?

A
  • A contraction of binary digit
  • The most basic unit of information in a digital computer
  • Has a value of either 0 or 1
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What does the following definition describe:

  • A contraction of binary digit
  • The most basic unit of information in a digital computer
  • Has a value of either 0 or 1
A

A bit

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

What is the contraction of the word “binary digit”?

A

Bit

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

What is the contraction of the word “bit”?

A

Binary digit

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

True or False:

A bit is the most basic unit of information in a digital computer

A

True

A bit is the most basic unit of information in a digital computer

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

True or False:

A bit can be any number, ranging from 0 to positive infinity

A

False

A bit can either be 0 or 1

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

What values can a bit contain?

A

Either 0 or 1

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

What are some ways a bit can be represented in the real world?

A
  • On/Off
  • High/Low
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is a byte?

A

A collection of 8 bits

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

What does the following definition describe:

A collection of 8 bits

A

A byte

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

True or False

18 bits make up a byte

A

False

8 bits make up a byte

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

What is a computer word?

A

Two or more adjacent bytes that are sometimes addressed and always manipulated collectively

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

What does the following definition describe:

Two or more adjacent bytes that are sometimes addressed and always manipulated collectively

A

A computer word

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

What is word size?

A

The representation of the size of data that is handled most efficiently by a particular architecture

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

What does the following definition describe:

The representation of the size of data that is handled most efficiently by a particular architecture

A

Word Size

17
Q

What are some examples of word sizes?

A
  • 16 bits
  • 32 bits
  • 64 bits
18
Q

What is a nibble/ nybble?

A

One of two 4-bit halves of a byte. Bytes consist of one high-order and one low-order nibble.

19
Q

What does the following definition describe:

One of two 4-bit halves of a byte. Bytes consist of one high-order and one low-order nibble.

A

A nibble or nybble

20
Q

True or False:

Because each bit of a byte has a value within a positional numbering system, the nibble containing the most-valued binary digit is called the low-order nibble, and the other half the high-order nibble

A

False

Because each bit of a byte has a value within a positional numbering system, the nibble containing the least-valued binary digit is called the low-order nibble, and the other half the high-order nibble

21
Q

What is a weighted numbering system?

A

A numeration system in which a value is represented through increasing powers of a radix (or base)

22
Q

What does the following definition describe:

A numeration system in which a value is represented through increasing powers of a radix (or base)

A

A weighted numbering system

23
Q

What is an example of a weighted numbering system?

A
  • Binary
  • Decimal
24
Q

What is a radix?

A

The base of a number system

25
Q

What does the following definition describe:

The base of a number system

A

Radix

26
Q

True or False:

The set of valid numerals for a positional numbering system is equal in size to the radix of that system

A

True

The set of valid numerals for a positional numbering system is equal in size to the radix of that system

27
Q

What would be the largest valid number in the decimal system?

A

9

The radix of the decimal system is 10, and the set of valid numerals are all numbers between 0 and 9

28
Q

What are the two most important radices in computer science?

A
  • Binary (base 2)
  • Hexadecimal (base 16)
29
Q

What values are allowed in hexadecimal?

A

0-9, A, B, C, D, E, F

30
Q

What is the representation of the following:

243.5110

A

243.5110 = (2 x 102) + (4 x 101) + (3 x 100) + (5 x 10-1) + (1 x 10-2)

31
Q

What is the following representation:

(1 x 24) + (0 x 23) + (1 x 22) + (1 x 21) + (0 x 20)

A

101102 = (1 x 24) + (0 x 23) + (1 x 22) + (1 x 21) + (0 x 20)

32
Q

Convert 53810 into Base 8 using subtraction

A

Answer:

53810 = 10328

33
Q

Convert 53810 into base 8 using division

A

Answer:

53810 = 10328

34
Q

Convert 14710 into binary

A

Answer

14710 = 100100112

35
Q

True or False:

A binary number with N bits can represent unsigned integers from 0 to 2N + 1

A

False

A binary number with N bits can represent unsigned integers from 0 to 2N − 1

Ex: 4 bits => 24-1 = 16-1 = 15

36
Q

How many unsigned integers can 32 bits represent?

A

32 bits => 232-1 = (4.294967296 x 109)- 1

37
Q

What is overflow?

A
  • A condition where a register is not large enough to contain the result of an arithmetic operation
  • In signed arithmetic operations, overflow is detectable when the carry into the sign bit does not equal the carry out from the sign bit
38
Q

What does the following definition describe:

  • A condition where a register is not large enough to contain the result of an arithmetic operation
  • In signed arithmetic operations, overflow is detectable when the carry into the sign bit does not equal the carry out from the sign bit
A

Overflow