Combinational Circuits

Question 1

Small Scale Integration

Answer 1

~ 10 Boolean Gates

Question 2

Medium Scale Integration

Answer 2

10 - 100 Boolean Gates

Question 3

Large Scale Integration

Answer 3

100 - 30,000

Question 4

Very Large Scale Integration

Answer 4

Up to 150,000 Boolean Gates

Question 5

Very Very Large Scale Integration

Answer 5

Greater than 150,000 Boolean Gates

Question 6

The branch of computer science that analyzes circuits and optimizations done at SSI/MSI level.

Answer 6

Logic Design

Question 7

A combinational circuit

Answer 7

One where the output of a gate is never used as an input into it.

The output is only dependent on the inputs.

Question 8

A sequential circuit

Answer 8

A circuit whose output depends on the present value of inputs as well as the sequence of past inputs.

Question 9

Boolean Gate

Answer 9

A Boolean operator or connective mapped to a gate

Question 10

K-map

Answer 10

Karnaugh map

An efficient way to simplify circuits

Automatically converts any Boolean expression to either a sum of products (ORs of ANDs) or product of sums (ANDs of ORs)