Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

APSC 262 - Digital Logic > Chapter 1 > Flashcards

Chapter 1 Flashcards

1
Q

digital def

A

uses discrete physical states (ie high and low)

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

logic def

A

uses basic logic operations to interpret and process information

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

design def

A

to plan, analyze and construct the system that will fulfill the working requirements

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

analog

A

quantities measured continuously (wall clock)

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

digital (as in not analog)

A

quantities measured discretely

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

analog electronic system

A

accept and process continuous signals in the form of continuous voltage or current signals

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

digital electronic system

A

accept and process discrete samples that represent the actual continuous signal using an analog to digital converter

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

___ volts represents a logic 1 or logic high

A

+5

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

___ volts represents a logic 0 or logic low

A

0

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

advantages of digital system (6)

A
  • storing and processing data is more efficient
  • transmission of data is more efficient and reliable
  • detecting and correcting error is easier
  • data can be easily and precisely reproduced
  • digital systems are easy to design and implement
  • they require less space
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Radix of a number

A

the base, each digit has a weight that is a power of the radix

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

a number system with radix r has how many allowed digits?

A

0, 1, … (r-1)

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

most significant digit

A

leftmost digit, has highest weight

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

least significant digit

A

rightmost digit, has lowest weight

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

what is the largest value that can be expressed in n digits in terms of the radix

A

r^n - 1

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

positional number system

A

each digit has a position that is associated with a fixed weight

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

bit

A

one binary digit

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

nibble

A

four bits

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

byte

A

eights bits

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

kilobyte

A

2^10

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

megabyte

A

2^20

22
Q

gigabyte

A

2^30

23
Q

terrabyte

A

2^40

24
Q

Sum of weights method

A

multiply each binary digit with its fixed weight and add to get decimal value

25
Q

Sum of non-zero terms

A

multiply each binary digit that is not one with its fixed weight and add to get

26
Q

repeated division by 2 method

A
  • to go from decimal to binary
  • divide the decimal number repeatedly by 2, recording the remainder each time.
  • the last remainder becomes the msb and the first remainder becomes the lsb
27
Q

repeated multiplication by 2 method

A
  • to go from decimal fractions to binary
  • multiply the fraction part by the base (2)
  • record the integer (0 or 1) then take the fraction part and multiply again
  • repeat until no more fraction
  • msb is the one recorded first, lsb is the one recorded last
28
Q

Base-8

A

Octal, digits 0 - 7

29
Q

base 16

A

hexadecimal, values 0-15, digits 0-F

30
Q

binary to octal

A

started at lsb, take groups of 3 bits and convert each to decimal form to get octal representation

31
Q

octal to binary

A

convert each octal digit into its 3bit form

32
Q

decimal to octal (not fraction)

A

use repeated division by 8

33
Q

binary to hexadecimal

A

group bits into groups of four starting with lsb, each group will represent one hexadecimal digit

34
Q

hexadecimal to binary

A

each hexadecimal digit is replaced with the equivalent 4 bit string

35
Q

decimal to hexadecimal

A

repeated division by 16

36
Q

binary addition

A

similar to decimal, a sum bit and a carry bit are generated
4 possibilities for adding 2 bits together

37
Q

basic binary subtraction

A
  • results in a difference bit and a borrow bit
38
Q

binary multiplication

A
  • similar to decimal
  • when multiplying 2 bits, product will be zero unless both bits are 1
39
Q

binary division

A
  • same procedure as decimal, may result in a remainder
40
Q

signed binary numbers (or signed-magnitude representation)

A

msb is reserved to signify if number is positive (0) or negative (1)

41
Q

unsigned binary numbers

A

assumed to be positive so msb is not reserved for the sign

42
Q

diminished radix complement

A
  • (r-1)’s complement
  • for a number N with n digits, its complement is (r^n - 1) - N
43
Q

1’s complement of a binary number

A

obtained by changing zero to one and one to zero

44
Q

radix complement

A
  • for a number N with n digits, its complement is (r^n - N)
  • equivalent to one more than the diminished radix complement
45
Q

2’s complement of a binary number

A
  • add one to the 1’s complement
46
Q

the msb of the 2’s complement of a negative number should be ____

A

1

47
Q

subtraction by 2’s complement

A
  • if any numbers are negative, take 2’s complement (msb should be 1, so msb doesn’t change from signed magnitude to complement)
  • then take 2’s complement of the subtrahend including the sign bit
  • if there is a carry out bit, ignore it
  • then add the two numbers
48
Q

an n-bit binary code can have up to ____ distinct combinations of 1’s and 0’s

A

2^n

49
Q

BCD

A
  • binary coded decimal
  • used for applying a decimal input to a digital circuit
  • each decimal digit is represented by 4 bits that can go up to a max value of 9 (1001) (other values are dont care on k map)
50
Q

BCD addition

A
  • if binary sum is equal to or less than 1001, BCD digit is correct
  • if binary sum is more than 1001, add 6 to it to get the correct digit and carry
51
Q

ASCII code

A
  • american standard code for information interchange
  • uses 7 bits to code 128 characters
  • includes uppercase, lowercase, punctuation, numbers 0-9, and some nonprinting characters for control functions
52
Q

parity bit

A

a bit added to the front of the code to make there an odd or even number of bits to check correctness of code

APSC 262 - Digital Logic (8 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions