CSE 171 Introduction to Digital Logic and Microprocessors - PowerPoint PPT Presentation

1 / 13
About This Presentation
Title:

CSE 171 Introduction to Digital Logic and Microprocessors

Description:

Group homework due on some Fridays. See homework rules on web site. Late homework is NOT accepted ... Exam 1: Friday, Oct. 4, 2002. Exam 2: Monday, Oct. 28, ... – PowerPoint PPT presentation

Number of Views:31
Avg rating:3.0/5.0
Slides: 14
Provided by: edie
Category:

less

Transcript and Presenter's Notes

Title: CSE 171 Introduction to Digital Logic and Microprocessors


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

2
CSE 171
  • Text Introduction to Computer Engineering
    Logic Design and the 8086 Microprocessor
  • Richard E. Haskell, Prentice Hall, 1993.
  • Prerequisites
  • CSE 141 or CSE 131
  • MTH 154

3
Course Contents (Part 1)
  • Number systems
  • Basic logic gates
  • Programmable logic devices
  • Boolean algebra and logic equations
  • Combinational logic
  • Sequential logic

4
Course Contents (Part 2)
  • Internal structure of a digital computer
  • 8086 machine language instructions
  • Binary arithmetic
  • Assembly language programming
  • Addressing modes
  • Screen display
  • Interrupts and PC I/O

5
Course ObjectivesBy 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 twos complement of a binary number.
  • Identify basic gates (NOT, AND, OR, NAND, NOR,
    XOR, XNOR) and list the truth tables for each
    gate.

6
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 counters and shift registers using D
    flip-flops.

7
Course Objectives (cont.)By the end of this
course you should be able to
  • Use CUPL and ABEL to design basic combinational
    and sequential circuits.
  • Program GAL chips and test them with a PC logic
    analyzer program.
  • Program a Xilinx CPLD and test it on a PLDT-1
    Trainer

8
Course Objectives (cont.)By the end of this
course you should be able to
  • Describe 8086 registers and the 8086 memory
    structure in terms of segment and offset
    addresses.
  • Describe the operation of basic 8086 instructions
    and addressing modes.
  • Use TUTOR to examine the 8086 registers and
    memory and single-step 8086 programs.
  • Explain how 8086 hardware interrupts work.

9
Homework
  • Individual homework due on some Mondays
  • Class homework due on some Wednesdays
  • Group homework due on some Fridays
  • See homework rules on web site
  • Late homework is NOT accepted

10
Labs
  • Labs begin Monday, Sept. 9, 2002
  • in Room 144, Dodge Hall
  • Groups of two
  • Lab assignments are on the web site
  • Specific lab procedures will be given before each
    lab

11
Exams
  • Exam 1 Friday, Oct. 4, 2002
  • Exam 2 Monday, Oct. 28, 2002
  • Exam 3 Monday, Nov. 25, 2002
  • Final Exam Monday, Dec. 16, 2002
  • 800-1000 a.m.
  • No makeup exams

12
Grading
  • Homework 10
  • Laboratory 20
  • Exam 1 15
  • Exam 2 15
  • Exam 3 15
  • Final exam 25
  • 100

13
Office Hours
  • Mon., Wed., 300 400 p.m. 115 DH
  • Phone 248-370-2861
  • email haskell_at_oakland.edu
  • Web site
  • www.cse.secs.oakland.edu/haskell
  • click on CSE171 and click Fall 2002
Write a Comment
User Comments (0)
About PowerShow.com