Chapter 1 Flashcards

1
Q

What is Boolean Algebra

A

It is an algebra where variables are either True or False. It is a combination of mathematics and logic

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

Features of Boolean Algebra

A
  1. Value of variable either true or false
  2. Has only 3 operations (+) (*) (‘)
  3. Supports principle of duality
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Truth table

A

When values of all variables of input along with output in a Boolean function is represented in a form of tabil

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

What is a Boolean function

A

When Boolean Variables are connected with Boolean operations

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

Associative law

A

i. a+(b+c) =(a+b) +c
ii. a.(b.c) =(a.b).c

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

Commutative law

A

i. (a+b) =(b+a)
ii. a.b=b.a

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

Distributive Law

A

i. a.(b+c) =ab+ac
ii. a+bc=(a+b) (a+c)

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

Complement law

A

a+a’=1
a.a’=0

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

Identity law

A

a+0=a
a.1=a

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

Demorgan’s law

A

(a+b)’=a’.b’
(a.b) ‘=a’+b’

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

Boundness law

A

a+1=1
a.0=0

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

Idempotent law

A

a+a=a
a.a = a

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

Absorption law

A

a.(a+b) = a
a+ab=a

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

Involution law

A

(a’)’=a

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

What is a Literal

A

The Boolean variables in a Boolean functions, which are in true or complemented form

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

Sum Term

A

When the literals in a Boolean function are connected with (+)

17
Q

Product term

A

When the literals in a Boolean function are connected with (.)

18
Q

What is sop

A

When several product terms are connected with (+) in a Boolean function

19
Q

What is a pos

A

When several sum terms are connected with (.) In a Boolean expression

20
Q

Canonical form

A

When certain Boolean functions are represented in certain form

21
Q

Name all canonical form

A

Only 2
Minterm
Maxterm

22
Q

Difference between POS and SOP

A

1.(SOP) First step of operation is (.) (And)
(POS) it is (+) (OR)
2. (SOP) Second step is (+) (OR)
(POS) it is (.) (AND)

23
Q

AND is of which সমবায়

A

শ্রেণী সমবায়

24
Q

OR is of which সমবায়

A

সমান্তরাল সমবায়

25
Q

What is basic logic gate

A

Logic gates which performs the three basic Boolean operation (+) (.) (‘)

26
Q

What are Combinational Logic Circuit

A

The circuit which provides certain outputs depending on certain inputs

27
Q

What is an Adder

A

A combinational circuit, which is used to produce sums of binary numbers

28
Q

Half Adder

A

The Adder which is used to add only 2 binary digits

29
Q

What is Full adder

A

The adder which is used to add 3 binary digits

30
Q

What is a subtractor

A

The subtractor, a computational circuit is used to provide subtraction of binary numbers

31
Q

Half subtractor

A

Is used to provide subtraction of 2 binary numbers

32
Q

Full subtractor

A

Used to subtract 3 binary digits

33
Q

What is a multiplexer

A

Is a combinational circuit, where a select line is used to select input line among many and to send it to output line

34
Q

In Multiplexer ( MUX) what would be the number of select lines

A

In case of 2^n input lines there would be n lines

35
Q

Decoder

A

A combinational circuit which has ‘n’ input lines for 2^n output lines

36
Q

Encoder

A

A combinational circuit which পরিনত করে input signals intu সম মান binary signal

37
Q

Number of output lines in encoder

A

For maximum 2^n input lines n output lines