DIGITAL ELECTRONICS Flashcards

(36 cards)

1
Q

3 important characteristics of any number system

A

1) base or radix is equal to number of digits in the system
2)largest value of digit is one less than base or radix
3)each digit is multiplied by base or radix raised to an appropriate power depending upon the digital position to get its place value

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

Radix of binary number system

A

2

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

Radix of octal number system

A

8

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

Radix of hexadecimal number system

A

16

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

Binary addition
0+0
0+1
1+0
1+1

A

0
1
1
10

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

Binary subtraction
0-0
1-0
1-1
10-1

A

0
1
0
1

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

Binary multiplication
00
0
1
10
1
1

A

0
0
0
1

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

Binary division
0/1
1/0

A

0
1

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

First complement

A

changing each 0 to a 1 and each 1 to a 0

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

second complement

A

it is obtained by adding 1 to the first complement of the number

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

Signed binary numbers
0
1

A

0 : positive charge
1: negative charge

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

advantage of signed binary numbers:

A

simplicity

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

disadvantage of signed binary numbers

A

they have to be converted to unsigned binary form before arithmetic operations can be performed

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

Floating point number

A

Number is written as a fraction multiplied by some power of base or radix

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

Mantissa in floating point number

A

fractional part of floating point number

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

Exponent in floating point number

A

Power of base or radix multiplying the fraction

17
Q

Types of Gates

A

AND
OR
NOT
NOR
NAND
EX. OR
EX. NOR

18
Q

Commutative law

A

A+B = B+A
A.B = B.A

19
Q

Associative law

A

A + (B+C) = (A+B)+C
A.(B.C) = (A.B).C

20
Q

Distributive law

A

A.(B+C) = AB +AC

21
Q

Absorption laws

A

A +AB =A
A.(A+B) = A
A + (A’B) = A+B
A. (A’+B) = A.B

22
Q

Operations

A

A+0 = A
A + A =A
A+1 = 1
A + A’ = 1

23
Q

AND operations

A

A.1 = A
A.A =A
A.0 = 0
A.A’ = 1

24
Q

Double inversion

A

(A’)’ = A

25
De morgan theorem
(AB)' = A' + B' (A+B)' = A' . B'
26
Universal gates
A gate which can implement any boolean function without need to use any other gate type ex : NAND and NOR
27
Half adder
Arithmetic circuit block that can be used to add 2 bits
28
half adder output
Sum, S = A.B' + A'B Carry, C = A.B
29
Full adder
Arithmetic circuit block that can be used to add 3 bits to produce a sum and carry output
30
Full adder output
Carry , C* = C(A'B + AB') + AB Sum , S =C' (A'B + AB') + C (AB + A'B')
31
Flip Flop
circuits that have 2 stable states that can store state information
32
flip flop AKA
bistable multivibrator latch toggle
33
Applications of Flip flop
Counters Frequency dividers shift registers storage register
34
R-S flip flop
A pair of cross coupled 2 unit NAND gates is the simplest way to make a set-reset RS flip flop
35
JK Flip flop
it is an ideal memory element for counting circuits. It can be realized from a RS flip-flop by augmenting 2 AND gates
36