| | |

Computer Organization and Architecture

Logic Gates

Circuits to Truth Tables

Circuits to Expressions

Expressions to Circuits

Finding SOP from K-Map

Finding POS from K-Map

Finding SOP from K-Map having Don't Care

Half Adders

Full Adders

Flip Flop

Integrated Circuits

Decoders

Multiplexers

Registers

Counters

RAM

ROM

Number Systems

Complements

Number Representations

Binary Addition and Subtraction

Gray Codes

Error Detection Codes

Register Transfer Language

Bus and Memory Transfers

Arithmetic Micro-operations

Logical Micro-operations

Shift Micro-operations

Basic Computer Organization

Timing and Control

Instruction Cycle

Instruction Types

Interrupt Cycle

Complete Computer Description

General Register Organization

Stack Organization

Evaluation of Arithmetic Operations

Address Modes

Instruction Formats

RISC and CISC Architectures

Parallel Processing

Multiplication Algorithms

Logic Gates

Circuits to Truth Tables

Circuits to Expressions

Expressions to Circuits

Finding SOP from K-Map

Finding POS from K-Map

Finding SOP from K-Map having Don't Care

Half Adders

Full Adders

Flip Flop

Integrated Circuits

Decoders

Multiplexers

Registers

Counters

RAM

ROM

Number Systems

Complements

Number Representations

Binary Addition and Subtraction

Gray Codes

Error Detection Codes

Register Transfer Language

Bus and Memory Transfers

Arithmetic Micro-operations

Logical Micro-operations

Shift Micro-operations

Basic Computer Organization

Timing and Control

Instruction Cycle

Instruction Types

Interrupt Cycle

Complete Computer Description

General Register Organization

Stack Organization

Evaluation of Arithmetic Operations

Address Modes

Instruction Formats

RISC and CISC Architectures

Parallel Processing

Multiplication Algorithms

Very similar to the way we figure out Truth Table from Circuit, we deduce Expressions as well. The basic methods like finding intermediate outputs and naming them accordingly etc are common in both the methods.

Following are the important rules to be followed for deducing Expressions from circuits. See the following:

- Identify all those connections in the circuit where output of some gate is going as input to some other gate. In all these connections mark intermediate output like F
_{1}, F_{2}, F_{3},.... F_{n}. Meanwhile ignore all the fresh inputs and final output. - Based on the specific gates, deduce the expressions for intermediate outputs and keep on doing that till expressions of all intermediate outputs are not generated.
- Now the expression of final output is easy to generate based on all the expressions of intermediate outputs.

See the following example:

Here, F_{1} is `AND` of A and B, hence it becomes: `(A . B)`.

Similarly F_{2} is `NOT` of A, hence it becomes: `A'`.

Now since F_{3} is `OR` of F_{1} and F_{2}, the final output becomes: `(A . B) + A'`.

Copyright 2018. All Rights Reserved.