CPE 201 Introduction to Computer
Engineering
Department of Computer Science & Engineering
University
of Nevada, Reno, Spring 2013
Course Information  Description
 Prerequisites  Textbooks
 Syllabus  Organization 
Grading  Schedule, Notes &
Assignments  Acknowledgment  ABET
Criteria
Email: yuksem@cse.unr.edu
Phone: (775) 3272246
Web page: http://www.cse.unr.edu/~yuksem
Office: SEM 237 (Scrugham EngineeringMines)
Office
hours:
Mahmudur Khan
Sections: 13
Email: mahmudurk@cse.unr.edu
Web page: http://www.cse.unr.edu/~mahmudurk
Office: SEM 323A
Office hours:
Prabath Palathingal
Section: 4
Email: ppalathingal@unr.edu
Office: SEM 255
Office hours:
Fundamentals of digital design. Topics include: number bases, binary arithmetic, Boolean logic, minimizations, combinational and sequential circuits, registers, counters, memory, programmable logic devices, register transfer.
Required Textbooks
Recommended Textbooks
This is a tentative list of topics, subject to modification and reorganization.
§ The Map method
§ ProductsofSums
§ Latches
§ FlipFlops
Grading (Tentative)
Both grading policy and scale are subject to change.
• Grading Policy

• Late Assignment Policy

• Grading Scale (Tentative)

Note: Saturdays and Sundays do not count toward missed days. For example, there is 1 "day" between Friday, 2pm and Monday, 2pm. Similarly, there is 1 day between Monday, 2pm and Tuesday, 2pm.
Important Note: Regrading requests can only be made within the first week after the graded assignments/tests are returned to the students.
Schedule (Tentative), Notes & Assignments
This is a tentative schedule including the exam dates. It is subject to readjustment depending on the time we actually spend in class covering the topics. Slides presented in class and assignments will be posted at the WebCampus. See the acknowledgment for the course materials. Permanent reading assignment: it is assumed that you are familiar with the contents of the slides of all past meetings.
Date 
Lectures 
Assignments & Notes 
Tue, Jan 22 
Lecture #1: Intro. & Digital Systems and Binary Numbers (1) – Number Base Representations 
• Mano & Ciletti, Ch. 1.1, 1.2 
Thu, Jan 24 
Lecture #2: Digital Systems and Binary Numbers (2) – Number Conversions and Complements 
• Mano & Ciletti, Ch. 1.31.5 
Tue, Jan 29 
Lecture #3: Digital Systems and Binary Numbers (3) – Binary Arithmetic and Encoding 
• Mano & Ciletti, Ch. 1.6, 1.7 • Homework 1 out 
Thu, Jan 31 
Lecture #4: Boolean Algebra and Logic Gates (1) – Boolean Functions and Operations 
• Mano & Ciletti, Ch. 2.12.2, 2.5, 2.8 
Tue, Feb 5 
Lecture #5: Boolean Algebra and Logic Gates (2) – Axiomatic Relations and Duality 
• Mano & Ciletti, Ch. 2.3 
Thu, Feb 7 
Lecture #6: Boolean Algebra and Logic Gates (3) – Algebraic Manipulation 
• Mano & Ciletti, Ch. 2.4 • Homework 1 due • Homework 2 out 
Tue, Feb 12 
Lecture #7: Boolean Algebra and Logic Gates (4) – Minterms and Maxterms Quiz 1 
• Mano & Ciletti, Ch. 2.6 
Thu, Feb 14 
Lecture #8: Boolean Algebra and Logic Gates (5) – NAND and NOR Gates 
• Mano & Ciletti, Ch. 2.8 
Tue, Feb 19 
Lecture #9: GateLevel Minimization (1) – Kmaps 
• Mano & Ciletti, Ch. 3.13.3 
Thu, Feb 21 
Lecture #10: GateLevel Minimization (2) – Don’t Care Conditions Quiz 2 
• Mano & Ciletti, Ch. 3.4, 3.5 • Homework 2 due • Homework 3 out 
Tue, Feb 26 
Lecture #11: GateLevel Minimization (3) – NAND and NOR Implementations 
• Mano & Ciletti, Ch. 3.6 
Thu, Feb 28 
Lecture #12: GateLevel Minimization (4) – XOR, HDL 
• Mano & Ciletti, Ch. 3.8, 3.9 
Tue, Mar 5 
Lecture #13: Combinational Logic (1) – Adders, Subtractors, Multipliers Quiz 3 
• Mano & Ciletti, Ch. 4.14.7 
Thu, Mar 7 
Lecture #14: Combinational Logic (2) – Comparators, Decoders, Encoders 
• Mano & Ciletti, Ch. 4.84.10 
Tue, Mar 12 
Lecture #15: Combinational Logic (3) – Multiplexers, HDL Models 
• Mano & Ciletti, Ch. 4.11, 4.12 • Homework 3 due 
Thu, Mar 14 
Midterm Exam (inclass) 

Tue, Mar 19 
Spring
Break – NO CLASSES 

Thu, Mar 21 
Spring
Break – NO CLASSES 

Tue, Mar 26 
Lecture #16: Sequential Logic (1) – SR Latch 
• Mano & Ciletti, Ch. 5.15.3 • Homework 4 out 
Thu, Mar 28 
Quiz 4 

Tue, Apr 2 
Lecture #17: Sequential Logic (2) – FlipFlops 
• Mano & Ciletti, Ch. 5.4 
Thu, Apr 4 
Lecture #18: Sequential Logic (3) – Analysis of Sequential Circuits, State Tables, State Machines 
• Mano & Ciletti, Ch. 5.5 • Homework 4 due • Homework 5 out 
Tue, Apr 9 
Lecture #19: Sequential Logic (4) – Controller Design, State Reduction 
• Mano & Ciletti, Ch. 5.6, 5.7 
Thu, Apr 11 
Lecture #20: Sequential Logic (5) – Excitation Tables, Synthesis with FlipFlops 
• Mano & Ciletti, Ch. 5.8 
Tue, Apr 16 
Lecture #21: Registers and Counters (1) – Registers, Shift Registers, Register Design 
• Mano & Ciletti, Ch. 6.1, 6.2 • Homework 5 due • Homework 6 out 
Thu, Apr 18 
Lecture #22: Registers and Counters (2) – Counters, Ripple Counters, Synchronous Counters, Up/Down Counters 
• Mano & Ciletti, Ch. 6.36.5 
Tue, Apr 23 
Lecture #23: Register Transfer Level Design (1) – Datapath, Control 
• Mano & Ciletti, Ch. 8.18.4 
Thu, Apr 25 
Lecture #24: Register Transfer Level Design (2) – Design Examples 
• Mano & Ciletti, Ch. 8.5, 8.6 
Tue, Apr 30 
Lecture #25: Computer Design Basics – ALU, Control Word 
• Homework 6 due • Homework 7 out 
Thu, May 2 
Lecture #26: Instruction Set Architecture (1) – Instruction Formats, PC, Instruction Execution 
• Mano & Kime, Ch. 9.19.6 
Tue, May 7 
Lecture #27: Instruction Set Architecture (2) – MIPS 
• Mano & Kime, Ch. 9.7, 9.8, 10.1, 10.410.6 • Homework 7 due 
Thu, May 9 (at 8:00am) 
Final Exam 

The slides and other materials for this course are inpart based upon the materials from a number of people/sources, including:
· Official website for the Mano & Ciletti text: Digital Design
· Official website for the Mano & Kime text: Logic and Computer Design Fundamentals
· Official website for the Patterson & Hennessy text: Computer Organization and Design: The Hardware/Software Interface
·
Mircea Nicolescu from UNR: http://www.cse.unr.edu/~mircea
·
Dwight Egbert from UNR: http://www.cse.unr.edu/~egbert
ABET Criteria
Program Outcomes 
Course Outcomes 
Assessment Methods/Metrics 
Program
Objectives Impacted 
1 
Students are able to apply formal concepts (Boolean algebra, finite
state machines) to digital circuit design. 
Specific problems in
homework assignments and examinations. 
2 
3 
Students are capable to design, implement and analyze combinational
logic with digital gates and sequential circuits with FlipFlops. 
Specific problems in
homework assignments and examinations. 
2, 3 
5 
Students are able to identify, formulate and solve engineering problems
related to the design of digital circuits. 
Specific problems in homework assignments
and examinations. 
1, 2 
11 
Students are capable to use various techniques suited for the design of
different classes of digital circuits. 
Specific problems in homework assignments
and examinations. 
3 
Program Outcomes:
1. an ability to apply knowledge of computing, mathematics, science, and engineering.
2. an ability to design and conduct experiments, as well as to analyze and interpret data.
3. an ability to design, implement, and evaluate a computerbased system, process, component, or program to meet desired needs, within realistic constraints specific to the field.
4. an ability to function effectively on multidisciplinary teams.
5. an ability to analyze a problem, and identify, formulate and use the appropriate computing and engineering requirements for obtaining its solution.
6. an understanding of professional, ethical, legal, security and social issues and responsibilities.
7. an ability to communicate effectively with a range of audiences.
8. the broad education necessary to analyze the local and global impact of computing and engineering solutions on individuals, organizations, and society.
9. a recognition of the need for, and an ability to engage in continuing professional development and lifelong learning.
10. a knowledge of contemporary issues.
11. an ability to use current techniques, skills, and tools necessary for computing and engineering practice.
12. an ability to apply mathematical foundations, algorithmic principles, and computer science and engineering theory in the modeling and design of computerbased systems in a way that demonstrates comprehension of the tradeoffs involved in design choices.
13. an ability to apply design and development principles in the construction of software systems or computer systems of varying complexity.
Program Objectives:
Within 3 to 5 years of graduation our graduates will:
1. be employed as computer science and engineering professionals beyond entry level positions or be making satisfactory progress in graduate programs.
2. have peerrecognized expertise together with the ability to articulate that expertise as computer science and engineering professionals.
3. apply good analytic, design, and implementation skills required to formulate and solve computer science and engineering problems.
4. demonstrate that they can function, communicate, collaborate and continue to learn effectively as ethically and socially responsible computer science and engineering professionals.
Course Information  Description
 Prerequisites  Textbooks
 Syllabus  Organization 
Grading  Schedule, Notes &
Assignments  Acknowledgment  ABET
Criteria
Last updated on April 23, 2013