XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.

Similar documents
Fundamentals of Digital Design

XOR - XNOR Gates. The graphic symbol and truth table of XOR gate is shown in the figure.

EGC221: Digital Logic Lab

Gates and Flip-Flops

Cs302 Quiz for MID TERM Exam Solved

Digital Logic: Boolean Algebra and Gates. Textbook Chapter 3

Boolean Algebra and Digital Logic 2009, University of Colombo School of Computing

Additional Gates COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals

Computer organization

Chapter 7 Logic Circuits

UNIVERSITI TENAGA NASIONAL. College of Information Technology

COMBINATIONAL LOGIC FUNCTIONS

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits

Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary

Digital Logic. CS211 Computer Architecture. l Topics. l Transistors (Design & Types) l Logic Gates. l Combinational Circuits.

Combinational Logic. By : Ali Mustafa

Experiment 7: Magnitude comparators

Chapter 2 (Lect 2) Canonical and Standard Forms. Standard Form. Other Logic Operators Logic Gates. Sum of Minterms Product of Maxterms

Digital Logic (2) Boolean Algebra

Chapter 2 Combinational Logic Circuits

CSC9R6 Computer Design. Practical Digital Logic

Boolean Algebra, Gates and Circuits

Boolean Logic Prof. James L. Frankel Harvard University. Version of 3:20 PM 29-Aug-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved.

Digital Logic. Lecture 5 - Chapter 2. Outline. Other Logic Gates and their uses. Other Logic Operations. CS 2420 Husain Gholoom - lecturer Page 1

UNIT 8A Computer Circuitry: Layers of Abstraction. Boolean Logic & Truth Tables

Total Time = 90 Minutes, Total Marks = 50. Total /50 /10 /18

Systems I: Computer Organization and Architecture

CS 226: Digital Logic Design

COSC 243. Introduction to Logic And Combinatorial Logic. Lecture 4 - Introduction to Logic and Combinatorial Logic. COSC 243 (Computer Architecture)

to become literate in most common concepts and terminology of digital electronics

EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits)

Chapter 2: Princess Sumaya Univ. Computer Engineering Dept.

Outline. EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) Combinational Logic (CL) Defined

Propositional Logic. Logical Expressions. Logic Minimization. CNF and DNF. Algebraic Laws for Logical Expressions CSC 173

Combinational Logic. Course Instructor Mohammed Abdul kader

In Module 3, we have learned about Exclusive OR (XOR) gate. Boolean Expression AB + A B = Y also A B = Y. Logic Gate. Truth table

Building a Computer Adder

Combinational Logic. Review of Combinational Logic 1

Learning Objectives 10/7/2010. CE 411 Digital System Design. Fundamental of Logic Design. Review the basic concepts of logic circuits. Dr.

Looking at a two binary digit sum shows what we need to extend addition to multiple binary digits.

LOGIC GATES. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.

Review: Additional Boolean operations

Chapter 2: Switching Algebra and Logic Circuits

WEEK 3.1 MORE ON KARNAUGH MAPS

ELE2120 Digital Circuits and Systems. Tutorial Note 9

MC9211 Computer Organization

CHAPTER1: Digital Logic Circuits Combination Circuits

CSE 20 DISCRETE MATH. Fall

Combinational Logic Design Combinational Functions and Circuits

ELCT201: DIGITAL LOGIC DESIGN

Logic. Combinational. inputs. outputs. the result. system can

Sample Test Paper - I

211: Computer Architecture Summer 2016

Chapter 2 Combinational Logic Circuits

Mealy & Moore Machines

ELCT201: DIGITAL LOGIC DESIGN

Logic Design. Chapter 2: Introduction to Logic Circuits

Philadelphia University Student Name: Student Number:

DIGITAL LOGIC CIRCUITS

Ch 2. Combinational Logic. II - Combinational Logic Contemporary Logic Design 1

Synchronous Sequential Logic

Boolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.

2009 Spring CS211 Digital Systems & Lab CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS

BER KELEY D AV IS IR VINE LOS AN GELES RIVERS IDE SAN D IEGO S AN FRANCISCO

Chapter 2 Boolean Algebra and Logic Gates

Latches. October 13, 2003 Latches 1

A crash course in Digital Logic

Projects about Quantum adder circuits Final examination June 2018 Quirk Simulator

DIGITAL LOGIC CIRCUITS

4 Switching Algebra 4.1 Axioms; Signals and Switching Algebra

Sequential Circuit Analysis

CS 121 Digital Logic Design. Chapter 2. Teacher Assistant. Hanin Abdulrahman

CS61c: Representations of Combinational Logic Circuits

The Design Procedure. Output Equation Determination - Derive output equations from the state table

PG - TRB UNIT-X- DIGITAL ELECTRONICS. POLYTECHNIC-TRB MATERIALS

Ex: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.

L2: Combinational Logic Design (Construction and Boolean Algebra)

Floating Point Representation and Digital Logic. Lecture 11 CS301

Digital Circuits. 1. Inputs & Outputs are quantized at two levels. 2. Binary arithmetic, only digits are 0 & 1. Position indicates power of 2.

Every time has a value associated with it, not just some times. A variable can take on any value within a range

DIGITAL LOGIC CIRCUITS

CMSC 313 Lecture 15 Good-bye Assembly Language Programming Overview of second half on Digital Logic DigSim Demo

Chapter 2. Boolean Algebra and Logic Gates

Chapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr.

Unit 8A Computer Organization. Boolean Logic and Gates

Logic Design. Digital Logic. Goal: to become literate in most common concepts and terminology of digital electronics

EECS Variable Logic Functions

CS/COE1541: Introduction to Computer Architecture. Logic Design Review. Sangyeun Cho. Computer Science Department University of Pittsburgh

Implementation of Boolean Logic by Digital Circuits

Philadelphia University Student Name: Student Number:

ECE 545 Digital System Design with VHDL Lecture 1. Digital Logic Refresher Part A Combinational Logic Building Blocks

EEE130 Digital Electronics I Lecture #4

Appendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring

UC Berkeley College of Engineering, EECS Department CS61C: Representations of Combinational Logic Circuits

CS/COE0447: Computer Organization and Assembly Language

ECE/CS 250: Computer Architecture. Basics of Logic Design: Boolean Algebra, Logic Gates. Benjamin Lee

Lecture 2 Review on Digital Logic (Part 1)

CE1911 LECTURE FSM DESIGN PRACTICE DAY 1

Logic Gate Level. Part 2

Lecture 7: Logic design. Combinational logic circuits

Transcription:

2017-18 XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL

HALF ADDER 1. The circuit that performs addition within the Arithmetic and Logic Unit of the CPU are called adders. 2. A unit that adds two binary digits is called a half adder 3. A half adder sums two binary digits to give a sum and a carry. TRUTH TABLE: FULL ADDER 1. The circuit that performs addition within the Arithmetic and Logic Unit of the CPU are called adders. 2. A unit that adds three binary digits is called a full adder 3. Here A, B referred as the inputs, C1 as carry input from the previous stage, C2 as carry output and S as sum. TRUTH TABLE: Input Sum Min Carry Min Input Output terms term A B C1 C2 S A B S of S C of C 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 1 Ā.B 0 0 1 0 0 1 1 0 1 0 0 1 1 1 0 1 1 0 1 A.B 1 0 0 0 1 1 0 1 1 0 1 1 0 1 0 BOOLEAN FUNCTIONS: 1 1 1 1 1 Sum: S = Carry: C = A. B LOGICAL CIRCUIT: BOOLEAN FUNCTIONS: Sum: Carry: LOGICAL CIRCUIT: In a half adder, an AND gate is added in parallel to the XOR gate to generate the carry and sum respectively. The full adder can be constructed from two half adders and an OR gate.

FLIP FLOP: 1. A flip flop is a circuit which is capable of remembering the value which is given as input. 2. The flip-flop circuit is an example of sequential circuit. 3. These circuits are capable of storing one bit of information. 4. A flip-flop circuit can be constructed using either two NOR gates or two NAND gates. Flip Flop Circuit using NOR Gates ELECTRONIC WORKBENCH: 1. Electronic workbench is a simulation tool for electronic circuits. 2. It allows designing and analysing circuits without using actual instruments. 3. The workbench s click-and-drag operation makes editing a circuit fast and easy. 4. It is a windows compatible tool and follows the normal conventions of windows. 5. The circuit diagrams and the output of the simulated circuits can be printed or exported MultiSim: 6. Example for electronic workbench is Multisim 7. It offers a single, easy-to-use graphical This can be tabulated as interface for the design needs. 8. It also provides the advanced functionality you need to design from specifications. Flip Flop Circuit using NAND Gates STEPS INVOLVED IN DESIGNING A LOGIC CIRCUIT. Step 1: Statement of the problem. Step 2: Identify inputs and outputs. Two inputs, say A and B, and one output, say C. A block diagram for this system is The corresponding truth table is given as Step 3: Formulate truth table. The truth table for this problem is given below. Notice that the output is 1 if only one of the inputs is 1. Otherwise the output is 0.

Input Output A B C 0 0 0 0 1 1 1 0 1 1 1 0 DIFFERENT TYPES OF LOGIC GATES There are three fundamental logic gates namely, AND, OR and NOT. Also we have other logic gates like NAND, NOR, XOR and XNOR. AND Gate: The output of AND is true only when both inputs are true, otherwise, the output is false. Step 4: Convert the truth table to a Boolean function. Identify the minterms for the rows in the truth table which have an output 1 Input Output Minterms A B C 0 0 0 0 1 1 Ā.B 1 0 1 OR Gate: 1 1 0 The output of OR is true if either or both of the inputs are true. If both inputs are false, then the output is false. By ORing the minterms, we obtain the boolean function corresponding to the truth table as D = Ā.B + Step 5: Realization of the Boolean function into a Logic Circuit Diagram. The logic circuit diagram corresponding to this Boolean function is given below. NOT Gate: The NOT gate, called a logical inverter, has only one input. It reverses the logical state.

NOR Gate: The NOR gate circuit is an OR gate followed by an inverter. XNOR Gate The XNOR (exclusive-nor) gate is a combination XOR gate followed by an inverter. Truth table: NAND Gate: The NAND gate operates as an AND gate followed by a NOT gate. XOR Gate The output is true if either, but not both, of the inputs are true. The output is false if both inputs are false or if both inputs are true. Truth table: