COMPUTER ORGANISATION.. LAB. تنظيم الحاسبات.. عملي

Slides:

Advertisements

Similar presentations

Advertisements

ADDER, HALF ADDER & FULL ADDER

Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.

Digital Circuits.

Computer Organization and Architecture Tutorial 6 Kenneth Lee.

1 Combinational Logic Design&Analysis. 2 Introduction We have learned all the prerequisite material: – Truth tables and Boolean expressions describe functions.

ECE 2373 Modern Digital System Design Exam 2. ECE 2372 Exam 2 Thursday March 5 You may use two 8 ½” x 11” pages of information, front and back, write.

1 Homework Reading –Tokheim, Section 5-1, 5-2, 5-3, 5-7, 5-8 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.

Digital Circuits. Analog and Digital Signals Noise margins in Logic Circuits VMVM.

Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.

ENGIN112 L12: Circuit Analysis Procedure September 29, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 12 Circuit Analysis Procedure.

Binary Addition CSC 103 September 17, 2007.

XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.

Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.

Chapter 4 The Building Blocks: Binary Numbers, Boolean Logic, and Gates.

Chapter 3.5 Logic Circuits. How does Boolean algebra relate to computer circuits? Data is stored and manipulated in a computer as a binary number. Individual.

Lecture 17: Digital Design Today’s topic –Intro to Boolean functions Reminders –HW 4 due Wednesday 10/8/2014 (extended) –HW 5 due Wednesday 10/15/2014.

ECE 3130 – Digital Electronics and Design

Chapter 2: Binary logic OCR Computing for GCSE © Hodder Education 2011.

What is an And Gate? It is a digital circuit that produce logical operations The logical operations are call Boolean logical Boolean operation consist.

Digital Electronics Lecture 6 Combinational Logic Circuit Design.

Islamic University Of Gaza, Nael Aburas Data Storage Introduction to computer, 2nd semester, 2010/2011 Mr.Nael Aburas

ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.

Combination of logic gates  Logic gates can be combined to produce more complex functions.  They can also be combined to substitute one type of gate.

Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.

1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.

ITEC 352 Lecture 3 Low level components(2). Low-level components Review Electricity Transistors Gates Really simple circuit.

Chapter 4 Fundamentals of Computer Logic 1 Chapter 4: Fundamental of Computer Logic - IE337.

1 Homework Reading –Tokheim, Section 5-1, 5-2, 5-3, 5-7, 5-8 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.

Module 7.  In Module 3 we have learned about NAND gate – it is a combination of AND operation followed by NOT operation  Symbol A. B = Y  Logic Gate.

CHAPTER 5 Combinational Logic Analysis

Unit II Fundamentals of Logic Design By Roth and Kinney.

1 Ethics of Computing MONT 113G, Spring 2012 Session 4 Binary Addition.

Digital logic representation In digital logic system,events are described as either 0 or 1 Two logic states 1= logic High 0 = logic Low.

WORKING PRINCIPLE OF DIGITAL LOGIC

Computer Hardware & Operation Northern College Diploma Philip Bird.

Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patternson and Hennessy Text.

Fundamentals of Computer Science

Computer Architecture & Operations I

GCSE OCR Computing A451 Binary logic Computing hardware 6.

Creating logic gates with Minecraft

Homework Reading Machine Projects Labs

Eng. Mai Z. Alyazji October, 2016

Everything is a number Everything in a computer memory and on storages is a number. Number  Number Characters  Number by ASCII code Sounds  Number.

Logic Gates and Boolean Algebra

Combinational Logic Circuits

Computer Organisation

Lab02 :Logic Gate Fundamentals:

Computer Fundamentals

How Boolean logic is implemented

Elec 2607 Digital Switching Circuits

ECE 301 – Digital Electronics

Week 7: Gates and Circuits: PART II

13 Digital Logic Circuits.

GCSE Computer Science – Logic Gates & Boolean Expressions

DIGITAL ELECTRONICS B.SC FY

Combinational Circuits

XOR Function Logic Symbol  Description  Truth Table 

Circuit to Truth Table to Logic Expression

Digital Circuits.

Eng. Ahmed M Bader El-Din October, 2018

Dept. of Electrical and Computer Eng., NCTU

Agenda Lecture Content: Combinatorial Circuits Boolean Algebras

SYEN 3330 Digital Systems Chapter 2 – Part 1 SYEN 3330 Digital Systems.

Presentation transcript:

COMPUTER ORGANISATION.. LAB. تنظيم الحاسبات.. عملي

DIGITAL CIRCUIT DESIGN SYNTHETIC, LOGICAL PHRASES, LOGIC GATES 1

 Given the above circuit write down the truth table and the output Boolean function equation ? Truth table examples : Ex1: A B C D Y

 Solve-ex1 : Truth table examples : YCDABDCBA Y=AB+CD

Truth table examples : Ex2:

 Solve-ex2 : Truth table examples : YABBABA a b Y

Sum of products methods : Y= fundamental product BA

 Ex1 :  Given the above truth table write down the output Boolean function equation and draw the circuit ? Sum of products methods : YCBA

Sum of products methods :

Exercises:  Exercises 1:  Given the above circuit write down the truth table and the output Boolean function equation ? A B C Y

Exercises:  Exercises 2:  Given the above circuit write down the truth table and the output Boolean function equation ? A B Y

Exercises:

 Exercises 4: Exercises: YDCBA  Given the above truth table write down the output Boolean function equation and draw the circuit ?

INTERNAL REPRESENTATION OF NUMBERS 2

Internal representation of numbers The representation of numbers in the computer requires stored numbers in computer memory. And computers using storage units have a fixed length = 32 bit. First: the representation of integer numbers: يتم تقسيم مكان الذاكرة إلى قسمين من الوحدات الأساسية : القسم الأول عبارة عن وحدة مخصصة لإشارة العدد : (0) للموجب ،(1) للسالب. القسم الثاني هو الجزء الأساسي للعدد بعد تحويله للنظام الثنائي ويتكون من 31 وحدة bit إشارة العدد الجـــزء الأسـاســــي للـــعدد

Internal representation of numbers

Internal representation of numbers Solve-Ex1-1: الــبواقــــي = bit

Internal representation of numbers

Internal representation of numbers Solve-Ex2-1: الــبواقــــي = bit

Internal representation of numbers

Internal representation of numbers Solve-Ex3-1: = bit الــبواقــــي =

Internal representation of numbers Second: the representation of fractional numbers: يتم تقسيم مكان الذاكرة إلى ثلاث أقسام من الوحدات الأساسية : القسم الأول عبارة عن وحدة مخصصة لإشارة العدد : (0) للموجب ،(1) للسالب. القسم الثاني عبارة عن سبع وحدات لتمثيل أس العدد. القسم الثالث هو الجزء الأساسي للعدد بعد تحويله للنظام الثنائي في الصورة الأسية ويتكون من 24 وحدة bit إشارة العدد 24 وحدة للجـــزء الأسـاســي للـعدد في الصورة الأســية إشارة الأس 7 وحدات لأس العدد

Internal representation of numbers

Internal representation of numbers Solve-Ex1-2:- = الــبواقــــي X 2 1 = X 2 1 = 0.25 X 2 0 = 0.50 X 2 1 = 0.0 X 2 الجزء الصحيح = =

Internal representation of numbers Solve-Ex1-2: bit نحوله للصورة الأسية :- = x 2 9 = الــبواقــــي