1 / 12

CSE 171 Introduction to Digital Logic and Microprocessors

CSE 171 Introduction to Digital Logic and Microprocessors. Prof. Richard E. Haskell 115 Dodge Hall. CSE 171. Text : An Introduction to Modern Digital Design Richard E. Haskell and Darrin M. Hanna, 2004. (Available only at the OU Bookstore) Prerequisites : CSE 141 MTH 154.

Rita
Télécharger la présentation

CSE 171 Introduction to Digital Logic and Microprocessors

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

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

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

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

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

  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 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.

  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 sequential circuits using D flip-flops.

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

  8. Homework • Individual homework due on some Mondays • Class homework due on some Wednesdays and Fridays • See homework rules on web site • Late homework is NOT accepted

  9. Labs • Labs begin Tues, Sept. 6, 2005 • in Room 144, Dodge Hall • Groups of four (2 computers per group) • Lab assignments are on the web site • Specific lab procedures will be given before each lab

  10. Exams • Exam 1: Friday, Sept. 30, 2005 • Exam 2: Monday, Oct. 24, 2005 • Exam 3: Monday, Nov. 21, 2005 • Final Exam: Friday, Dec. 9, 2005 • 3:30-5:30 p.m. • No makeup exams

  11. Grading • Homework 10% • Laboratory 20% • Exam 1 15% • Exam 2 15% • Exam 3 15% • Final exam 25% • 100%

  12. Office Hours • Mon., Wed., 3:00 – 4:00 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 Fall 2005

More Related