1 ENGG 1015 Tutorial Introduction to Electrical and Electronic Engineering – 2012 Fall Semester Time and Venue  Class: 1430-1520 P4, every other Monday.

Slides:



Advertisements
Similar presentations
Switching circuits Composed of switching elements called “gates” that implement logical blocks or switching expressions Positive logic convention (active.
Advertisements

DAT2343 Basic Logic Gates © Alan T. Pinck / Algonquin College; 2003.
Logic Gates.
Logic Gates.
CT455: Computer Organization Logic gate
Programmable Logic Controllers.
L14: Boolean Logic and Basic Gates
Digital Electronics Lecture 2 Logic Gates. Lecture 2 outline Announcement:
ECE2030 Introduction to Computer Engineering Lecture 9: Combinational Logic, Mixed Logic Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering.
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
1 Boolean Algebra & Logic Design. 2 Developed by George Boole in the 1850s Mathematical theory of logic. Shannon was the first to use Boolean Algebra.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives
Introduction to Digital Design Lab Project
1 ENGG 1203 Tutorial Introduction to Electrical and Electronic Engineering – 2013 Spring Semester Time and Venue  Class: 1430 – 1520 CPD-LG.08, every.
Logical Circuit Design Week 5: Combinational Logic Circuits Mentor Hamiti, MSc Office ,
MR. KERINS Logic Gates- Electrical Engineering. LOGIC GATES Logic gates are primarily implemented using diodes or transistors acting as electronic switches,
CS1Q Computer Systems Lecture 5 Simon Gay. Lecture 5CS1Q Computer Systems - Simon Gay2 Where we are Global computing: the Internet Networks and distributed.
Module 3.  Binary logic consists of :  logic variables  designated by alphabet letters, e.g. A, B, C… x, y, z, etc.  have ONLY 2 possible values:
Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
Introduction to Computer Science David Goldschmidt, Ph.D. Computer Science The College of Saint Rose CIS September 6, 2007.
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.
CSC Intro. to Computing Lecture 5: Boolean Logic, Gates, & Circuits.
Fall 2012: FCM 708 Foundation I Lecture 2 Prof. Shamik Sengupta
CSC Intro. to Computing Lecture 5: Boolean Logic, Gates, & Circuits.
Digital Systems I EEC 180A Lecture 4 Bevan M. Baas.
What is Mechatronics? Mechatronics is the synergistic combination of mechanical engineering, electronics, controls engineering, and computers, all integrated.
LOGIC GATES.
4. Electrons and electronics 4.5 Digital electronics.
Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
ENEE244-02xx Digital Logic Design Lecture 6. Announcements Homework 2 due today Homework 3 up on webpage Coming up: First midterm on Sept. 30 – Will cover.
CSCI-100 Introduction to Computing Hardware Design Part I.
ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.
1 ENGG 1015 Tutorial Digital Logic (II) (70 pages) 15 Oct Learning Objectives  Learn about Boolean Algebra (SoP/PoS, DrMorgan's Theorem, simplification),
Digital Integrated Circuit Design Laboratory Department of Computer Science and Information Engineering National Cheng Kung University Experiment on digital.
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
1 Digital Logic Design Week 5&6 cont’d Revision for Quiz 2/Exam.
Logic Gates M. AL-Towaileb1. Introduction Boolean algebra is used to model the circuitry of electronic devices. Each input and each output of such a device.
Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.
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.
Logic Simplification-Using Boolean Laws Logic Design Laboratory EE 2121 Lectures By Manesh T EE2121-In Charge
CEC 220 Digital Circuit Design SOP and POS forms Friday, Sept 11 CEC 220 Digital Circuit Design Slide 1 of 17.
Digital electronics 4–1 Gates and Circuits SANJAYBHAI RAJGURU COLLEGE OF ENGG.
1 Ch.3 Logic Gates and Boolean Algebra – Part 1
Logic Gates and Boolean Algebra Introduction to Logic II.
Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 
Lecture 1 Gunjeet kaur Dronacharya group of institutions.
LOGIC GATES. INTRODUCTION TO LOGIC GATES Boolean functions may be practically implemented by using electronic gates. The following points are important.
Truth Table to Statement Form
Eng. Mai Z. Alyazji October, 2016
Logic Gates and Boolean Algebra
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
EI205 Lecture 5 Dianguang Ma Fall 2008.
Boolean Expressions Lecture No. 10.
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Instructor: Alexander Stoytchev
Schematics 201 Lecture Topic: Electrical Symbols
3.4 Computer systems Boolean logic Lesson 2.
Universal gates.
Logic Gates.
Digital Logic.
KS4 Electricity – Electronic systems
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
GCSE Computer Science – Logic Gates & Boolean Expressions
Logic Gates Dr.Halimah Alshehri.
Truth tables Mrs. Palmer.
Logic Gates By: Asst Lec. Besma Nazar Nadhem
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

1 ENGG 1015 Tutorial Introduction to Electrical and Electronic Engineering – 2012 Fall Semester Time and Venue  Class: P4, every other Monday Tutor  Leon LEI (me): CB 806  Contact me and TAs via Piazza Tutorial materials 

2 ENGG 1015 Tutorial Each class: 40 min. tutorial + 10 min. Q/A Tutorial materials  Regular tutorials  Revision tutorial before examination (Tentatively)  Question banks Homework 2011, 2010 (may be obsolete) Past paper 2011, 2010 (may be obsolete)

ENGG 1015 Tutorial Lecture/Lab materials, announcements  Course site  Moodle  HKU Computer Center  Prompt learning materials help, peer learning  Piazza  Admin help  Piazza (Private post) Extra lab check-off session  TA office hour (CB LG205)  Tue 1530, Tue 1630, Fri 1430, Fri 1530 Textbook  No textbook 3

4 ENGG 1015 Tutorial Systems and Digital Circuits (I) 24 Sept Learning Objectives  Identify concepts of systems  Converts between three representations of digital logic News  Start to have laboratory sessions this week (Suggest to bring your laptop)

Question 1: Top-down vs Bottom-up ItemTop-downBottom-up Driven by system requirement Driven by component integration Construct system by composing smaller parts Construct system by decomposing Generate new ideas from system requirements Synthesize new ideas from existing components Must work with unknown system components as black-boxes 5 Yes

Question 2: Procedures in top-down and bottom-up Making a dinner (Top-down)  Decide the types of dishes according to the location, number of people, time and purpose of dinner  Design dishes according to the types of dishes, diet requirements, kitchen equipment  Find out required ingredients and sauces for each decided dishes  Get all things ready (e.g. buy and clean ingredients, prepare sauces)  Cook every dishes  Bring dishes to the table 6

Question 2: Procedures in top-down and bottom-up Making a dinner (Bottom-up)  Find out the ingredients available  Clean and cut the ingredients according to your own skill and available kitchen equipment  Mix and match available ingredients as different dishes to meet the dinner requirements, such as dietary requirements, location, number of people, time and purpose of dinner, etc.  Cook every dishes by the given kitchen equipment  Bring dishes to the table Making a Rube Goldberg Machine? 7

Question 2: Procedures in top-down and bottom-up Making a Rube Goldberg Machine (Top-down)  Decide the types of stages according to the location, number of stages, and interface of each stage  Design stages according to the types of stages, input and output requirements  Find out the required components for each stage  Get all things ready (e.g. acquire from the TA and technician)  Prepare and assemble each stage  Combine each stage together  Fine-tune the connection between stages 8

Question 2: Procedures in top-down and bottom-up Making a Rube Goldberg Machine (Bottom-up)  Find out the components available  Mix and match available components as different stages to meet the project requirements such as types of stages according to the location, number of stages, and interface of each stage etc.  Prepare and assemble each stage by the given equipment  Combine each stage together  Fine-tune the connection between stages 9

Quick quiz 1 10 What is the only set of input conditions that will produce a LOW output for any OR gate? Any one of the input is LOW Any one of the input is HIGH All inputs are LOW All inputs are HIGH

Quick quiz 2 11 What is the only input combination that will produce a HIGH at the output of a five-input AND gate? Any one of the input is LOW Any one of the input is HIGH All inputs are LOW All inputs are HIGH

Quick quiz 3 12 What logic level should be applied to the second input of a two-input AND gate if the logic signal at the first input is to be inhibited (prevented) from reaching the output? A LOW input will keep the output LOW A LOW input will keep the output HIGH A HIGH input will keep the output LOW A HIGH input will keep the output HIGH

Representing logic operations Each function can be represented equivalently in 3 ways:  Truth table  Boolean logic expression  Schematics 1st semester, 2011 Digital Logic - ENGG K. Wong 13 Truth Table Boolean Expression Schematics

14 Conversion of three representations Truth table  Try every 0/1 combinations of every input variables Boolean expression  Simplification (Next tutorial) Logic circuit  From Boolean expression  Using AND/OR/NOT gates  Alternative: Bottom-up approach

15 Bottom-up: Construct NOT gate, AND gate and OR gate from NAND gate Conversion between NOT, AND, OR, NAND i) ii) iii)

16 Question 3: From logic equations For the expression, construct the corresponding logic circuit, using only AND, OR gates and INVERTERs (NOT gate).

Draw the circuit diagram to implement the expression Draw the circuit diagram that implements the expression using gates having no more than three inputs. 17

Question 3: From logic equations Boolean expressions  Truth table and logic circuit (AND/OR/NOT) 18

Question 3: From logic equations Boolean expressions  Truth table and logic circuit (AND/OR/NOT) 19

20 Question 4: From truth tables Derive the Boolean expression of the output x in terms of the input Construct the logic circuit using AND gates, OR gates, and INVERTERs.

21 Solution 4 1. Construct A/B/C 2. Construct not A/B/C 3. Construct AND gates 4. Construct OR gate 123 4

Question 4: From truth tables Truth table  Boolean expressions and logic circuit 22

Determining output level from a diagram 23

Question 5: From logic circuits 24

Question 5: From logic circuits 25

Quick quiz 4 26 What is the output expression of the following logic- circuit diagram?

Quick checking True or false  An AND gate output will always differ from an OR gate output for the same input conditions. Lecture: Tutorial: 27 False