Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
10 views4 pages

Coa

The document defines key concepts in digital circuits, including combinational circuits, minterms, and maxterms. It explains the full forms of ASCII and EBCDIC, identifies universal gates, and discusses the differences between multiplexers and demultiplexers. Additionally, it covers binary to decimal conversion, fundamental theorems of Boolean algebra, and provides an overview of ALUs and encoders.

Uploaded by

dhir0jmali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views4 pages

Coa

The document defines key concepts in digital circuits, including combinational circuits, minterms, and maxterms. It explains the full forms of ASCII and EBCDIC, identifies universal gates, and discusses the differences between multiplexers and demultiplexers. Additionally, it covers binary to decimal conversion, fundamental theorems of Boolean algebra, and provides an overview of ALUs and encoders.

Uploaded by

dhir0jmali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Q.1 define combinational circuit .

A combinational circuit is a type of digital circuit whose output is a pure function of the
present input only. It does not have memory or feedback from output to input.
Examples: Adders, Multiplexers.

Q.2 define minterm and maxterm .


Minterm: A product (AND) term in a Boolean expression where all variables appear exactly
once, either in complemented or uncomplemented form.It gives output 1 for only one
combination of inputs.

Maxterm: A sum (OR) term in which all variables appear exactly once. It gives output O for
only one combination of inputs.

Q.3 prove that : A+AB = A+B


Proof using Boolean Algebra:

Given: A + A'B
Apply Distributive Law:
= (A+ A') (A + B)
= 1.(A+B) [since A + A' = 10
=A+B
Hence, proved.

Q.4 Explain the full form of ASCII and EBCDIC


1)​ ASCII : American Standard Code for Information Interchange
2)​ EBCDIC : Extended Binary Coded Decimal Interchange Code

Q.5 Which gates are called as universal gates .


NAND and NOR gates are called Universal Gates because you can implement any logic
function using only NAND or only NOR gates.

Q.6 Draw circuit diagram of Multiplexer .


A Multiplexer (MUX) selects one of many input signals and forwards the selected input to a
single output line.
For example, a 4-to-1 MUX circuit:

Q.7 explain the gray code conversion with proper example .


Gray Code is a binary numeral system where two successive values differ in only one bit.
Binary to Gray Code Example: Binary: 1010

Step 1: Keep the first bit same: ← 1


Step 2: XOR each bit with the previous bit:
100=1
01=1
100=1
Gray Code = 1111

Q.8 explain with diagram about the memory hierarchy system.

Registers Smallest and fastest memory; located


inside the CPU for immediate processing.

Cache Memory Faster than RAM, stores frequently


accessed data. Comes in L1, L2, and L3
levels.

Main Memory (RAM) Temporary memory where active programs


and data are loaded during execution.

Secondary Storage Permanent memory like HDDs and SSDs.


Slower but has more storage.

Tertiary Storage Backup and archival storage (USB drives,


tapes, cloud). Very large and slow.

Q.9 State the difference between multiplexer and demultiplexer.


Multiplexer : 1) Selects one input from many and sends it to a single output.
2) Many Inputs → One Output
3)Used to select which input to send to output
4)Data Selector
5)Sending data from multiple sensors to one transmission line
6)multiplexer is a digital switch

Demultiplexer : 1) Takes a single input and sends it to one of many outputs.


2)One Input → Many Outputs
3)Used to select which output gets the input
4)Data Distributor
5)Distributing received data to different devices
6)demultiplerxer is a digital circuit

Q.10 Convert binary to decimal


i) (111001) 2 =
= 1×2 ^ 5 + 1×2 ^ 4 + 1×2 ^ 3 + 0×2 ^ 2 + 0×2 ^ 1 + 1× 2 ^ 0 = 32 + 16 + 8 + 0 + 0 + 1 = 57

ii) (10011000) 2 =
= 1×2 ^ 7 + 0×2 ^ 6 + 0×2 ^ 5 + 1×2 ^ 4 + 1 × 2 ^ 3 + 0×2 ^ 2 + 0×2 ^ 1 + 0×2 ^ 0 = 128 + 0 +
0 + 16 + 8 + 0 + 0 + 0 = 152

iii) (101010) 2 =
= 1×2 ^ 5 + 0×2 ^ 4 + 1×2 ^ 3 + 0×2 ^ 2 + 1×2 ^ 1 + 0×2 ^ 0 = 32 + 0 + 8 + 0 + 2 + 0 = 42

iv) (1110110) 2 =
= 1×2 ^ 6 + 1×2 ^ 5 + 1×2 ^ 4 + 0×2 ^ 3 + 1×2 ^ 2 + 1×2 ^ 1 + 0×2 ^ 0 = 64 + 32 + 16 + 0 + 4
+ 2 + 0 = 118

v) (1000101) 2 =
= 1×2 ^ 6 + 0×2 ^ 5 + 0×2 ^ 4 + 0×2 ^ 3 + 1×2 ^ 2 + 0×2 ^ 1 + 1×2 ^ 0 = 64 + 0 + 0 + 0 + 4 +
0 + 1 = 69

Q.11 explain the fundamental theorems of Boolean algebra .


1. Identity Law: A + 0 = A , A * 1 = A
2. Null Law: A + 1 = 1 , A * 0 = 0
3. Idempotent Law: A + A = A, A. A = A
4. Complement Law: A + A' = 1 , A * A' = 0
5. Double Negation Law: (A')' = A
6. Commutative law : A+B=B+A , A.B = B.A
7. Associative Law: (A.B).C = A.(B.C) , (A+B)+C=A+(B+C)

Q 12 Explain the Block Diagram of ALU in Detail


An ALU (Arithmetic Logic Unit) is a crucial component of the CPU (Central Processing Unit)
that performs all arithmetic and logic operations. It is the "brain within the brain" of a
computer. The block diagram of an ALU consists of multiple functional units that work
together to perform operations.

Components of ALU:

Input Registers (A, B): Store operands.


Arithmetic Unit: Performs addition, subtraction, increment, decrement.
Logic Unit: Performs bitwise operations such as AND, OR, XOR, NOT.
Multiplexer: Chooses which operation result is sent as output.
Control Unit: Determines the operation to perform based on opcode.
Status Flags:
Zero Flag (Z): Set if result is zero.
Carry Flag (C): Set if there's a carry out.
Sign Flag (S): Indicates the sign of result.
Q.13 State the difference between Asynchronous and Synchronous.

Asynchronous - 1) Events occur at regular intervals in sync with a clock signal.


2) Requires a clock signal to coordinate operations.
3)Generally faster, but more complex to design.
4)Data is transferred at specific clock intervals.
5)More complex control circuitry due to clock.
6)Most modern CPUs, RAM operations.

Synchronous - 1) Events occur independently of a clock signal.


2) Does not need a clock signal.
3)Slower, but simpler and more flexible.
4)Data is transferred whenever it’s ready.
5)Simpler control but harder to predict timing.
6)Keyboard input, Mouse clicks, Interrupts.

Q.14 explain encoder with diagram and truth table.


An Encoder is a combinational circuit that performs the reverse operation of a Decoder. It
has a maximum of 2^n input lines and ‘n’ output lines, hence it encodes the information from
2^n inputs into an n-bit code. It will produce a binary code equivalent to the input, which is
active High. Therefore, the encoder encodes 2^n input lines with ‘n’ bits.

Diagram

Truth table

Input Output

Y3 Y2 Y1 Y0 A1 A2

0 0 0 1 0 0

0 0 1 0 0 1

0 1 0 0 1 0

1 0 0 0 1 1

You might also like