CSE 171 Introduction to Digital Logic and Microprocessors

Slides:

Advertisements

Similar presentations

Programming Logic Gate Functions in PLCs

Advertisements

ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.

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

التصميم المنطقي Second Course

Digital Electronics Dr. Bahawodin Baha, University of Brighton, UK.

CPT 310 Logic and Computer Design Instructor: David LublinerPhone Engineering Technology Dept.Cell

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.

CSE 378 Computer Hardware Design Prof. Richard E. Haskell – –Tel: –Web site: Follow.

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

CSE 670 Embedded System Design Using FPGAs Prof. Richard E. Haskell 115 Dodge Hall.

EGR 280 Design and Analysis of Electromechanical Systems

EGR 240 Introduction to Electrical and Computer Engineering

CSE 171 Introduction to Digital Logic and Microprocessors Prof. Richard E. Haskell 115 Dodge Hall.

CSE 378 Computer Hardware Design Prof. Richard E. Haskell – –Tel: –Web site: Follow.

CSE 378 Computer Hardware Design Prof. Richard E. Haskell – –Tel: –Web site: Follow.

EGR 240 Introduction to Electrical and Computer Engineering Prof. Michael P. Polis 102J Science & Engineering Building.

EGR 240 Introduction to Electrical and Computer Engineering Prof. Richard E. Haskell 115 Dodge Hall Prof. Michael P. Polis 102J Science & Engineering Building.

Computer Programming Skills Revision Prepared by: Ghader Kurdi.

Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin EE/CE 2310 – HON/002 Introduction to Digital Systems.

Digital Logic Gates. Sum of Products (Review) Procedure: 1.Form a minterm for each combination of the variables that produces a 1 2.OR all the minterms.

ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives

Prof. Hakim Weatherspoon CS 3410, Spring 2015 Computer Science Cornell University See: P&H Chapter 2.4, 3.2, B.2, B.5, B.6.

Introduction to Digital Logic Design Appendix A of CO&A Dr. Farag

Lecture 0 Digital Electronics Fundamentals Computer Architecture and System Software There are 10 kinds of people in this world – those who understand.

Lecture #1 Page 1 ECE 4110– Digital SystemDesign.

1.Overview of Course Objective 2.Details of course website, BLOG 3.Details of Syllabus 4.Recommended Books 5.Details of Lab Sessions 6.Introductory concepts.

9/15/09 - L27 CountersCopyright Joanne DeGroat, ECE, OSU1 Final Exam Review Exam Time: MONDAY o dark 30 7:30AM this room.

مدار منطقي مظفر بگ محمدي Course Structure & Grading Homework: 25% Midterm: 30% Final:50% There is 5% extra! ( =105!) Textbook:

CSE 171 Introduction to Digital Logic and Microprocessors Prof. Richard E. Haskell 115 Dodge Hall.

Digital Logic Design and Lab School of EECS Seoul National University.

Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.

التحليل والتصميم المنطقي DIGITAL DESIGN Instructor : Khalil Alsulbi Mobile : Room : 217.

Computing Systems: Organization and Design EE460/CS360/T425.

DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor

CSE 378 Computer Hardware Design (Formerly, Design of Digital Systems) Prof. Richard E. Haskell – –Tel: –Web site:

A sequential logic circuit (a.k.a. state machine) consists of both combinational logic circuit(s) and memory devices (flip flops). The combinational circuits.

ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.

School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 0: Introduction Mohd ridzuan mohd nor

Logic Gates and Boolean Algebra Introduction to Logic II.

Materials on the Exam Introduction Data Representation in Computer Systems Boolean Algebra Digital Logic MARIE: An Introduction to a Simple Computer Until.

Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 

Dr. ClincyLecture Slide 1 CS6020- Chapter 3 (3A and ) Dr. Clincy Professor of CS First Exam - Tuesday, September 6th Coverage: All subjects up to.

Basic Gates and ICs 74LS00 Quad 2-Input NAND gate 74LS02 Quad 2-Input NOR gate 74LS04 Quad 2-Input NOT gate 74LS08 Quad 2-Input AND gate 74LS32 Quad 2-Input.

Assembly Lab1 - Review.

Computer Architecture & Operations I

Homework Reading Machine Projects Labs

Eng. Mai Z. Alyazji October, 2016

Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and

DIGITAL LOGIC CIRCUITS

Computer Architecture Syllabus

CSNB163 Digital Logic Design

DIGITAL LOGIC CIRCUITS

Fundamentals & Ethics of Information Systems IS 201

University of Gujrat Department of Computer Science

ASIC 120: Digital Systems and Standard-Cell ASIC Design

Karnaugh Maps (K-Maps)

CSE 311 Foundations of Computing I

Combinational Logic Design Process

lecturer | ASIC design engineer

ELL100: INTRODUCTION TO ELECTRICAL ENGG.

Instructor: Alexander Stoytchev

Instructor: Alexander Stoytchev

Homework Reading Tokheim, Section 5-10, 7-4.

Instructor: Alexander Stoytchev

13 Digital Logic Circuits.

ECB2212-Digital Electronics K-Map

Digital Logic Design Basics Combinational Circuits Sequential Circuits.

Presentation transcript:

CSE 171 Introduction to Digital Logic and Microprocessors Prof. Richard E. Haskell 115 Dodge Hall

CSE 171 Text: An Introduction to Modern Digital Design Prerequisites: Richard E. Haskell and Darrin M. Hanna, 2003. (Available only at the OU Bookstore) Prerequisites: CSE 141 MTH 154

Course Contents Number systems Basic logic gates Programmable logic devices Boolean algebra and logic equations Combinational logic Sequential logic

Course Contents (cont.) State machines Binary and BCD arithmetic Introduction to microprocessor architectures and datapaths

Course Objectives By the end of this course you should be able to: Convert a number in any base (decimal, binary, hex, octal) to the equivalent number in any other base. Find the two’s complement of a binary number. Identify basic gates (NOT, AND, OR, NAND, NOR, XOR, XNOR) and list the truth tables for each gate.

Course Objectives (cont Course Objectives (cont.) By the end of this course you should be able to: Design combinational logic circuits with up to four inputs using sum of products method. Find the reduced form of any logic function with 3 or 4 inputs by using Karnaugh maps. Design sequential circuits using D flip-flops.

Course Objectives (cont Course Objectives (cont.) By the end of this course you should be able to: Use ABEL to design basic combinational and sequential circuits. Use ABEL to design state machines. Describe the operation of a simple processor.

Homework Individual homework due on Tuesdays Class homework due on some Thursdays Group homework due on some Thursdays See homework rules on web site Late homework is NOT accepted

Labs Labs begin Monday, Jan. 12, 2004 Groups of two in Room 144, Dodge Hall Groups of two Lab assignments are on the web site Specific lab procedures will be given before each lab

Exams Exam 1: Tuesday, Feb. 17, 2004 Exam 2: Tuesday, Apr. 6, 2004 Final Exam: Monday, Apr. 26, 2004 3:30-5:30 a.m. No makeup exams

Grading Homework 10% Laboratory 20% Exam 1 20% Exam 2 20% Final exam 30% 100%

Office Hours Tues., Thurs., 2:30 – 3:30 p.m.; 115 DH Phone: 248-370-2861 email: haskell@oakland.edu Web site: www.cse.secs.oakland.edu/haskell click on CSE171 and click Winter 2004