Logic Design I
Course Overview
This course introduces students to Binary numbers, Boolean algebra, systematic reduction of Boolean expression, Karnough maps, Decoders, Multiplexers, and Design for combinational circuits.
Tentative Topics Outline/ Lectures
Lecture 1: Binary Numbers, Number Base Conversions, Octal & Hexadecimal Numbers (Youtube Link)
Lecture 2: Complements & Subtraction with Complements (Youtube Link)
Lecture 3: Subtraction with Complements (Youtube Link)
Lecture 4: Digital Logic Gates (Youtube Link)
Lecture 5: Boolean Functions (Youtube Link)
Lecture 6: Simplification of Boolean Functions (Youtube Link)
Lecture 7: Minterms & Maxterms / Sum of Products & Products of Sums (Youtube Link)
Lecture 8: Karnaugh Map (Youtube Link)
Lecture 9: NAND and NOR (Universal Gates) Implementation (Youtube Link)
Lecture 10: Exclusive-OR Implementation
Lecture 11: Design of Combinational Circuits (Youtube Link)
Lecture 12: Decoders & Encoders (Youtube Link)
Lecture 13: Multiplexers (Youtube Link)
Bonus Quizzes
Take Bonus Quiz for Lecture 1
Text Books
Different book chapters will be used as a major source of information.
- Morris Mano M. and Michael D. Ciletti, “Digital Design”, Fourth Edition, Pearson Education, 2008.
- Jr. Charles H. Roth, Larry L Kinney, “Fundamentals of Logic Design”, Seventh Edition – Cengage Learning, USA, 2014.
- Anil K. Maini , “Digital Electronics: Principles, Devices and Applications”, Wiley, 2007.
Exams
-- There will be one mid-term exam and a final exam.
-- The mid-term exam will be given at approximately the 7th to 8th week of the semester. The exact date will be announced at least one week prior to the exam.
-- The final exam will be given during the last week of the semester.
Attendance
Attendance all lecture classes is expected and critical to your successfully completing the requirements of this course.
Grading Policy
Your grade will consist of four components:
Class/Lab participation 20%
Quizzes 20%
Mid-term exam 20%
Final exam 40%
