Test 1 Flashcards

1
Q

The unsigned binary range for six bit cell:

A

000000 to 11 1111 .
0-63
(2^n )-1

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

In fractional values the quantity 1/2 exactly representable in the binary and decimal systems, but is not in the _________ numbering system .

A

Ternary Base 3

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

Fractional decimal values have __________ to the right of the decimal point.

A

nonzero digits

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

Fractional values of other radix systems have nonzero digits to the:

A

Right if the radix point

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

Numerals to the right of a radix point represent:

A

Negative powers of the radix

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

As with whole-number conversions, you can use either of two methods:

A

a subtraction method or an easy multiplication methods

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

The subtraction method for fractions is identical to the subtraction method for whole numbers. Instead of subtracting positive powers of the target radix, we:

A

subtract negative powers of the radix.

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

We always start with the largest value first ______ where ___ is our radix, and work our way along using larger negative exponents.

A

n^-1

n

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

When adding two binary numbers , it is possible for each number to be in the range for the number of bits in the storage cell but for their sum to be out of range.

A

Carry bit

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

To represent signed integers, computer systems allocate the ______ bit to indicate the sign of a number

A

high -order

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

The _______ bit is the leftmost bit. It is also called the most significant bit.

A

High-order

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

There are three ways in which signed binary integers may be expressed:

A

Signed magnitude
One’s complement
Two’s complement

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

In an 8-bit word, ___________ representation places the absolute value of the number in the 7 bits to the right of the sign bit.

A

Signed magnitude

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

Signed magnitude representation is easy for people to understand, but it requires:

A

complicated computer hardware because you have to hardware for adding and subtracting .

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

Another disadvantage of signed magnitude is that it allows:

A

two different representations for zero : positive zero and negative zero .

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

Two representations for zero are reasons (among others ) computers systems employ _____________ for numeric value representation .

A

complement systems

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

In complement systems, negative values are represented by some difference

A

between a number and its base .

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

The ____________ of a non zero number N in base r with d digits is (r^ d; 1)-N

A

diminished radix complement

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

_____________ are useful because they eliminate the need for subtraction. The difference of two values is found by adding the minuend to the complement of the subtrahend.

A

Complement systems

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

One’s complement is simpler to implement than

A

signed magnitude.

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

But ___________ still has the disadvantage of having two different representations for zero : positive zero and negative zero. ___________ solves this problem.

A

Ones complement

Twos complement

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

___________ is the radix complement of the binary numbering system; the radix complement of a non- zero number N in base r with d digits is r ^ d - N

A

Two’s complement

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

With twos complement:

If the number is positive:

If the number is negative:

A

just convert it to binary and you’re done .

find the one’s complement of the number and then add 1 .

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

In 8 bit binary, 3 is:

  • 3 In ones complement:
  • 3 In twos complement:
A

0000 0011

1111 1100

1111 1101

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

Range for signed binary integers

A

1111 to 0111

-7 to 7

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

Range for ones complement

A

1000 to 0111

-7 to 7

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

Range for twos complement

A

1000 to 0111

-8 to 7

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

When we use any finite number of bits to represent a number, we always run the risk of.

A

the result of our calculations becoming too large or too small to be stored in the computer

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

While we can’t always prevent overflow , we can always ______ overflow.

A

Detect

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

In complement arithmetic , an overflow condition is ____ to detect.

A

Easy

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

Status bits:

N = 1 
N = 0
Z = 1 
Z = 0 
V = 1 
V = 0 
C = 1 
C = 0
A
Neg
Otherwise
Result is all zeros
Otherwise
Signed internet overflow
Otherwise
And unsigned integer overflow
Otherwise
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
32
Q

The purpose of ____________ is to specify precisely the effect of a hardware operation .

A

Register Transfer Language (RTL)

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

RTL specification of OR operation

A

c

34
Q

Because computer memories are binary, alphabetic characters must be coded to be stored in memory .

A

ASCII

35
Q

ASCH is a __________ codethere are ____ ASCII characters.

A

Seven-bit

128

36
Q

Since most computers use 8-bits for storage, can use the 8th bit for:

A

Error checking

37
Q

ASCII value of A is ____

So parity bit is:

A

65

1: 11000001

38
Q

The _____________ was established to collect and catalog all the alphabets of all the spoken languages in the world, both current and ancient, as a first step toward a standard system for worldwide information interchange .

A

Unicode Consortium

39
Q

Unicode organizes characters into _______, not __________.

A

Scripts

Languages

40
Q

Each character in every script has unique identifying number, usually written in hexadecimal, and is called a _________.

A

code point

41
Q

The hexadecimal number is preceded by “____” to indicate it is a Unicode code point .

A

U+

42
Q

Corresponding to the code point is a ______, which is the graphic representation of the symbol on the page or screen.

A

Glyph

43
Q

The signed magnitude , one’s complement , and two’s complement representations deal with _________ values only.

A

signed integer

44
Q

Floating-point values are stored using a __________ of scientific notation. With these modification , these formats are useful in scientific and business applications that deal with real number values.

A

binary version

45
Q

Fractional values can be approximated in ___ base systems .

A

All

46
Q

Unlike integer values, fractions do not necessarily have:

A

exact representations under all radices.

47
Q

The quantity ______ does not have an exact representation in the binary numbering system and must be approximated .

A

0.2 (dec)

48
Q

If we are clever programmers, we can perform _______ calculations using any integer format .

A

floating- point

49
Q

Float point calculations using any integer format is called ______________ , because floating point values aren’t stored as such ; we just create programs that make it seem as if floating - point values are being used .

A

floating -point emulation

50
Q

Most of today’s computers are equipped with specialized hardware that performs _____________ with no special programming required.

A

floating-point arithmetic

51
Q

Computers use a form of scientific notation for floating -point representation Numbers written in scientific notation have three components

A

Sign mantissa Exponent
\ | /
+ 1.25 x 10^-1

52
Q

To resolve the problem of synonymous forms , we establish a rule that the first digit of the significand must be 1, with no ones to the left of the radix point This process, called ___________, results in a unique pattern for each floating-point number.

A

Normalization

53
Q

To provide for negative exponents , we will use a

A

biased exponent

54
Q

is a number that is approximately midway in the range of values expressible by the exponent. We subtract the bias from the value in the exponent to determine its true value.

A

Bias

55
Q

In our case, we have a 8-bit exponent. We will use 127 for our bias . This is called

A

excess - 127 representation .

56
Q

The IEEE -754 __________ floating point standard uses an -bit exponent ( with a bias of 127) and a 23-bit significand .

A

single precision

57
Q

The IEEE-754 ___________ standard uses an 11-bit exponent (with a bias of 1023) and a 52 -bit significand .

A

double precision

58
Q

In both the IEEE single-precision and double precision floating- point standard , the significant has an implied __ to the ______ of the radix point .

A

1

Left

59
Q

Range and precision of IEEE 754 single precision.

A

-127 to 128

0000 0000…6 to 1111 1111…6

60
Q

Special values

-

-

-

  • programmers should avoid testing floating point values for equality to:
  • ________ zeros does not equal ________ zeros
A

Zero

Exponent field all 0’s

Significand all 0’s

There is a +0 and a -0

 Programmers should avoid testing floating point values for equality to zero 

 Negative zero does not equal positive zero
61
Q

Methods to describe a combinational circuit

A

Truth table
Boolean expression
Logic diagram

62
Q

Three basic operations Boolean algebra

A

Binary OR +
Binary AND •
Unary Complement ‘

63
Q

The Null Law is also called the:

The Inverse Law is also called:

A

Zero Theorem.

Complement or Negation

64
Q

To obtain dual expression.

Exchange ____ and _____
Exchange ____ and _____

A

+ and •

1 and 0

65
Q

An interconnection of logic gates. Closely resembles the hardware

A

Logic diagrams

66
Q

Set theory representation

___ gate is set union
___ gate is set intersection
___ is set complement

A

Or
And
Inverter

67
Q

In the sum-of-products form:

A

And variables are or together

Ex: F(x,y,z) = xy + xz + yz

68
Q

In the product-of-sums form:

A

In the or variables are and together

Ex: F(x,y,z) = (x+y) + (x+z) + (y+z)

69
Q

The term has evolved to mean any stored program computer in which an instruction fetch and a data operation cannot occur the same time because they share a common bus. often limits the performance of the system

A

Von Neumann architecture

70
Q

states that the number of transistors on microchip doubles every years. The obzervation was made by Gordon in 1965 the co-founder of He thought about the concept observing the trend of chip manufacturing at Intel However todaythe transistors are doubled in a faster pace than two years. Every and then companies bring out the faster and version of their electronic products for example cell phones.

A

Moore’s law

71
Q

law that the cost of semiconductor chup fabrication planit doubles years. It is the prediction to produce every 4 years.

A

Rocks law

72
Q

(February 29, 1860 - November 171929)

American of tabulating machine that was an important precursor the electronic computer. The tabulating machine was an electromechanical machine designed to assist information stored on puriched cards. The machine was developed to help data US Census.

A

Hollerith, Herman

73
Q

the first to realize that a computer had applications other than just calculation and was the first one credited the creation of the computer algorithm. is also considered the first computer programmer due to this

A

Ada Lovelace

74
Q

Invented the:

Difference Engine - An early calculating machine, verging on being the first computer designed to calculate and tabulate polynomial functions.

The Analytical Engine was to be a general-purpose fully program -controlled , automatic mechanical digital Considered to be the first computer Much more than a calculator

A

Charles Babbage

75
Q

Designed the first integrated circuit. Made out of germanium.

A

Jack kilby

76
Q

nicknamed as the Mayor of Silicon Valley, was know for realizing the abilities of the first integrated monolith chip which gave Valley its name. also cofounded both the Fairchild semiconductor in 1957 and the Intel Corporation in 1968

A

Robert Noyce

77
Q

These two scientists were credited with the invention of the Electronic Numerical Integrator and Computer, first general-purpose electronic digital computer

This invention was completed in 1946 at University of Pennsylvania’s Moore School of Engineering

The general idea of this invention is that computers would use electricity to think

A

John mauchy and J.presper eckert

78
Q

is an encoding, just like ASCII which is represented with bytes. The difference is that the encoding can represent every Unicode character while the ASCII encoding can’t. But they’re both still bytes it isn’t encoded or represented by any particular sequence of bytes.

A

UTF-8

79
Q

Importance of the Principle of Equivalence of Hardware and Software

A

states that Any task done by software can also be done using hardware, and any operation performed directly hardware can be done using software assuming speed is not concern.

hardware speed is usually faster than the software

80
Q

used vacuum tubes the basic components memory and Circuitry CPU. They machine languagecould only cine problem at a time were expensive, used lot of electricity, and were often unreliableSome first generation computers were ENIAC, EDVAC,UNIVAC,IBM-170, and IBM-650

A

The first generation computers

81
Q

In this generation was transistor computer, is a computer which uses discrete transistors instead of vacuum tubes. A second generation computer through the late 1950s and 1960s featured circuit boards filled with individual transistors and magnetic core memory

A

2nd generation computer

82
Q

were computers that emerged due to the development of the integrated.Their main feature was the use of integrated circuits, which allowed them to be shrunk down to be as small as toasters. Because of this they gained the name microcomputers because compared to second generation computers would occupy entire rooms and buildings, they were quite smallWell- known computers in this generation include the DEC series and the IBM-360 series computers.

A

Third generation computers