CH5 Flashcards

1
Q

Name the four number systems commonly used in programming:
(name with its base)

A
  1. binary (base: 2)
  2. octal (base: 8)
  3. decimal (base: 10)
  4. hexadecimal (base: 16)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

which number system includes letters?

A

hexadecimal

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

in the decimal number system, the digits range from?

A

0 to 9

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

the smallest “unit” of data on a binary computer is a ______ bit.

A

single

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

T/F: modern computers operate using hexadecimal logic.

A

F, binary logic.

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

the computer represents values using two voltage levels (usually __V for logic 0 and either ____V or ___V for logic 1).

A

0V for logic 0, and either +3.3V or +5V for logic 1.

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

Steps for converting from any number system to the decimal number system:

A

1- number the digits starting from 0. (right to left)
2- multiply each digit to the base of its number system (to the power of the digit’s position)
3- add them all together

[note if the number you are trying to convert has a decimal then every digit before the decimal will have a negative position number (-1, -2,..)]

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

steps of converting from the decimal number system to any other system:

A

1- divide the number by the base of the system you want to convert it to
2- divide the integer part by the base (until you can’t) and write down its remainder each time.
2- concate each remainder (down to up).

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

In the hexadecimal number system, the letter range from?

A

from A to F

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

steps converting from binary to any other system:

A

1- divide the digits into groups of (three[for oct.]/four[for hex.])
2- translate each group .

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

in binary, 1+1 =

A

10 ( one and zero. not ten. )

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

in binary, 0 - 1 =

A

take from the neighbouring digit (like normally in subtraction), then the 0 will be 2. so it’ll be 2 - 1 = 1

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

A =

A

10

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

B =

A

11

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

C =

A

12

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

D =

A

13

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

E =

A

14

18
Q

F =

A

15

19
Q

Remember that when converting a hexadecimal to a decimal the letter will be switched to a number and taken as a whole.

A

example: (AF)16
A = 10, F = 15
(10 x 16 to the power of 1) + (15 x 16 to the power of 0)

20
Q

A(A’) =

A

0

21
Q

A + (A’) =

A

1

22
Q

In Boolean algebra, 1 is considered

A

true (T)

23
Q

In Boolean algebra, 0 is considered

A

false (F)

24
Q

a + 0 =

A

a

25
Q

A (1) =

A

A

26
Q

(AB)’ =

A

A’ OR B’

27
Q

(A + B)’ =

A

(A’)(B’)

28
Q

________ describes operations on true/false values.

A

boolean algebra

29
Q

Boolean logic operations on electronic signals can be build out of _______ and other electronic devices.

A

transistors

30
Q

signals are the

A

boolean variables.

31
Q

circuits are the

A

boolean functions.

32
Q

are hardware devices built from transistors to mimic Boolean Operations

A

gates

33
Q

is a collection of logic gates

A

circuit

34
Q

T/F: Signals transform a set of binary inputs into a set of
binary outputs

A

F, Circuts.

35
Q

CE circuit

A

Compare-for-equality (CE) circuit

36
Q

_____ compares two unsigned binary integers for equality.

A

CE

37
Q

CE Circuit is built by combining together _____-bit comparison
circuits (___-CE)

A

1-bit (1-CE)

38
Q

CE (F) =

A

F = A’B’ + AB
= 1 + 1
which is (0)(0) + (1)(1)

39
Q

(x’y’)’ =

A

x + y

40
Q

In __________, both circuits produce the exact same output
for each input value combination

A

circuit equivalence

41
Q

Boolean algebra allows us to apply provable
mathematical principles to help us find simpler
design for the logical circuits. This is called:

A

minimization