SS2 First Term Computer Studies Lesson Note – Logic Circuits I

The content is just an excerpt from the complete note for SS2 First Term Computer Studies Lesson Note – Logic Circuits I. Check below to download the complete DOCUMENT

WEEK: 5

TOPIC: LOGIC CIRCUITS I

CONTENT: ­ (i) Definition of logic gate (b) Types of logic gates AND, NOT, OR (c) Symbols of each logic gate: (d) Input/output signals for AND, NOT and OR gates.

Sub-Topic 1: DEFINITION OF LOGIC GATES

A logic gate is an idealized or physical device implementing a Boolean function, that is, it performs a logical operation on one or more logical inputs, and produces a single logical output.

Logic gates are primarily implemented using diodes or transistors acting as electronic switches, but can also be constructed using electromagnetic relays (relay logic), fluidic logic, pneumatic logic, optics, molecules, or even mechanical elements. With amplification, logic gates can be cascaded in the same way that Boolean functions can be composed, allowing the construction of a physical model of all of Boolean logic, and therefore, all of the algorithms and mathematics that can be described with Boolean logic.

Logic circuits include such devices as multiplexers, registers, arithmetic logic units (ALUs), and computer memory, all the way up through complete microprocessors, which may contain more than 100 million gates. In practice, the gates are made from field-effect transistors (FETs), particularly MOSFETs (metal–oxide–semiconductor field-effect transistors).

A logic gate is an electronic device that makes decisions based on the different combinations of digital signals present on its inputs.

It is a logical circuit device in computer, having one output channel and one or more input channels, which gives signal only when specific input conditions are met.

To gain full access to the note: DOWNLOAD FILE