We may earn an affiliate commission when you visit our partners.
Course image
Moe Alqarain

1- Number systems and Conversion

1.1 Digital Systems and Switching Circuits

1.2 Number Systems and Conversion

1.3 Binary Arithmetic

1.4 Representation of Negative Numbers using

a- sign and Magnitude Numbers

b- 2's Complement Numbers

c- 1's Compliment Numbers

and all the above addition

1.5 Binary Codes

2- Boolean Algebra

2.1 Introduction

2.2 Basic Operations

2.3 Boolean Expressions and Truth Tables

2.4 Basic Theorems

2.5 Commutative, Associative, Distributive, and DeMorgan's Laws

2.6 Simplification Theorems

Read more

1- Number systems and Conversion

1.1 Digital Systems and Switching Circuits

1.2 Number Systems and Conversion

1.3 Binary Arithmetic

1.4 Representation of Negative Numbers using

a- sign and Magnitude Numbers

b- 2's Complement Numbers

c- 1's Compliment Numbers

and all the above addition

1.5 Binary Codes

2- Boolean Algebra

2.1 Introduction

2.2 Basic Operations

2.3 Boolean Expressions and Truth Tables

2.4 Basic Theorems

2.5 Commutative, Associative, Distributive, and DeMorgan's Laws

2.6 Simplification Theorems

2.7 Multiplying Out and Factoring

2.8 Complementing Boolean Expression

3-Boolean Algebra Theorems

3.1 Multiplying Out and Factoring Expression

3.2 Exclusive-OR and Equivalence Operations

3.3 The Consensus Theorem

3.4 Algebraic Simplification of Switching Expressions

3.5 Proving Validity and Equation

4- Applications of Boolean Algebra Minterm and Maxterm Expansions

4.1 Conversion of English Sentences to Boolean Equations

4.2 Combinational Logic Design Using a Truth Table

4.3 Minterm and Maxterm Expansions

4.4 General Minterm and Maxterm Functions

4.5 Incompletely Specified Functions

4.6 Examples of Truth Table Construction

4.7 Design of Binary Adders and Subtracters

5- Karnaugh Maps

5.1 Minimum Forms of Switching Functions

5.2 Two- and Three- Variable Karnaugh Maps

5.3 Four-Variable Karnaugh Maps

5.4 Determination of Minimum Expressions Using Essential Prime Implicant

5.5 five-Variable Karnaugh Maps

5.6 Other Uses of Karnaugh Maps

5.7 Other Forms of Karnaugh Maps

7-Multi-Level Gate Circuits NAND and NOR Gates.

7.1 Multi-Level Gate Circuits.

7.2 NAND and NOR Gates.

7.3 Design of Two-Level NAND- and NOR-Gate Circuits

7.4 Design of Multi-Level NAND- and NOR-Gate Circuits

7.5 Circuit Conversion Using Alternative Gate Symbols

7.6 Design of Two-Level, Multiple-Output Circuits

Enroll now

What's inside

Learning objectives

  • Number system and conversion
  • Boolean algebra
  • Applications of boolean algebra miniterm and maxterm expansions
  • Karnaugh maps
  • Multi-level gate circuits nand and nor gates

Syllabus

In this course :

1- after watching section 1, students will be introduced to Different numerical systems such as Binary ,Decimal ,Octal ,Hexadecimal ,etc. . also students will learn how to convert from a base to another.

2-after watching section 2, students would be able to Add/Subtract/Multiply and Divide Unsigned numbers.

3- after studying  section 3, Students would be able to Add/Subtract Signed numbers

4- After finishing  Section 4, Students will learn the Basic Gates ( AND , OR , Inverter ) and be able to use the Theorems of Boolean algebra .

5- when completing  section 5, Students should know from memory and be able to use any of the laws and theorems of Boolean algebra studied in section 4 by doing lots of problems.

6- after finishing  section 6 , Students would be able to find the Miniterm (SOP) and a Maxterm (POS) of any expression or circuit for F and F' , and they will be introduced to the Don't Care term.

7- After studying  section 7, Students will be able to add and subtract numbers using half and full adders , they will also be able to design them.

8- After watching section 8, Students would be able to use a k-map to obtain the most simplified form of any expression including 2,3,4 and 5 variables.

9- After watching section 9, Students will learn about the Universal gates (NAND and NOR ) and how to use them to represent any gate to design a two and multi level circuits

Read more

this video introduce four main numerical systems which are Decimal ,Binary , Octal and Hexadecimal systems , and the logic behind them.

by the end of this video students would be able to convert any base to a Decimal Base.

by the end of this video students would be able to apply the power series method.

by the end of this video students would be able to apply the power series method on Binary base , and generalize their understanding to convert any base to a decimal base.

by the end of this video students would be able to convert a decimal base to any other base , ( this method is considered the exact opposite of the Power series method ) .

after watching this video the students would be able to convert a ( non-integer or decimal) base 10 to any other base.

after watching this video; students would be able to convert a ( non-10  Base)  to a ( non-10 base)

ex. (base 6 to base 9 ) or ( base 13 to base 3 ) .....

Students will test their knowledge on how to convert from and to Base 10

the solution of quiz 1

after watching this video;  students would be able to know how many digit any base needs to cover all combinations using Binary system , also students will be introduced to Octal and Hexadecimal tables.

after watching this video; Students would be able to read and write Binary numbers by memory .

students will learn easy method of analyzing Binary numbers.

after watching this video; Students would be able to convert Octal and Hexadecimal Bases to a Binary Base

after watching this video; students would be able to convert a Binary base( base 2 ) to an Octal or Hexadecimal bases ( base 8 or 16 ).

students would test their knowledge on how to convert from base 2 to base 8 and 16.

after doing this quiz, students would be able to convert a Binary base( base 2 ) to an Octal or Hexadecimal bases ( base 8 or 16 ).

after watching this video; students would be introduced to the Unsigned and Signed ( the sign would be represented by a digit ; 1 for a negative and 0 for a positive ) numbers system.

After watching this video; Students would be able to perform Addition with signed numbers

After watching this video; Students would be able to perform Subtraction with signed numbers

After watching this video; Students would be able to perform Multiplication with signed numbers

After watching this video; Students would be able to perform Long Division with signed numbers

students would test their knowledge on how to divide two unsigned numbers.

After ding this quiz; Students would be able to perform Long Division with signed numbers

After watching this video; Students would understand the concept behind representing negative numbers using the 2's complement method , they will be able to convert from ( to read) and to (to write ) 2's complement .

After watching this video; Students would understand the concept behind representing negative numbers using the 1's complement method , they will be able to convert from ( to read) and to (to write ) 1's complement .

After watching this video; Students would be able to define and Differentiate between Carry and overflow , also they will figure out a way to detect when the addition result is wrong

after completing this video; students would learn how to apply the Simplification Theorems.

After watching this video; Students would be able to add same sign's and different sign's numbers , and will know all cases in organized manner.

After watching this video; Students would be able to add numbers using the 2's complement method.

After watching this video; Students would be able to add numbers using the 1's complement method.

Students would test their knowledge on how to add numbers using the 1's /2's complement method.

After doing this quiz; Students would be able to add numbers using the 1's complement method.

After watching this video; Students would be introduced to a new Codes with different weight than the normal binary system.

After watching this video; Students would be introduced to a new Codes but this time each bit doesn't have a specific weight.

After watching this video; Students would be introduced to a new Alphanumeric Code named American Standard Code for Information Interchange where letters, numbers, and other symbols can be transmitted through computers.

After watching this video; Students would be familiar with the objective and expectation of this Section.

After watching this video; student will learn the difference between Boolean Algebra and Regular Algebra which taught in schools.

After watching this video; student will be familiar with the main Gates in Digital Design such as AND , OR and investors .

After watching this video; students will learn how to find the truth table and represent a given Boolean expression with the logic Gates.

After watching this video; students will learn how to Verify that an equation is valid by finding the truth table for the expressions of both sides of the equation.

After watching this video; Students be able to find a Boolean Expression given the Circuit Diagram , working in a reverse Direction if you compare this Example to Example 1

in this quiz students would apply the techniques that they learned to find  the truth table of an expression and sketch the circuit Design.

After doing this quiz; students will learn how to find the truth table and represent a given Boolean expression using the logic Gates.

After watching this video; Students would be introduced to the Basic theorem of Boolean Algebra and they will verify those theorems using switches.

After watching this video; Students will learn the Commutative,Associative, Distributive and DeMorgan's Law.

After watching this video; Students will be familiar with the Uniting and Absorption Theorems that used to eliminate terms in a Boolean expresssion.

After watching this video; Students will be familiar with the Eliminations theorem that is used to eliminate literals .

also they will be introduced to the Consensus theorem that is used to eliminate terms.

after watching this video; students would learn how to apply the absorption , uniting and elimination theorems.

after watching this video; students would learn how to apply the absorption ,commutative and some of the basic simplification theorems.

after watching this video; students would learn how to apply the Multiplying out and Factoring Theorems.

after watching this video; students would be able to convert a Product of Sum (POS) to a Sum of Product and vice versa.

after watching this video; students would be able take a complement of an expression by applying Dmorgan Theorem.

after watching this video; students would learn how to pick the right theorem for simplification.

after doing this video students would be able to find an expression given a circuit then simplify it

after watching this video, Students would be able to use the simplification theorems combined with their knowledge of the XOR gate to validate an equation .

this video is an introduction to this section , its good to know in advance what you are expecting to learn.

after watching this video students would be able to convert a POS (Product of sum ) to a SOP ( Sum of Product ).

after watching this video students would be able to convert a SOP ( Sum of Product ) to a POS (Product of sum )  .

After watching this video students will be introduced to the XOR gate, the truth table , the equivalent expression and the laws that govern the XOR gate.

After watching this video students will be introduced to the XNOR gate, the truth table , the equivalent expression and the laws that govern the XOR gate.

After watching this video students will be able to simplify a XNOR/ XOR expression.

after watching this video, students would learn how to apply the consensus theorem and would notice the importance of terms elimination order .

after watching this video, students would learn how to apply the Consensus theorem , and they will understand that the order of terms elimination is important.

after watching this video, students would learn how to apply the Consensus theorem by adding a redundant term first.

after watching this video, students would learn how to apply the Consensus theorem

after doing this quiz, students would learn how to apply the Consensus theorem , and they will understand that the order of terms elimination is important.

Remember when simplify any expression , start with combining and eliminating terms , then eliminating literals and finally the consensus theorem

after watching this video, students would learn the order in which simplification Theorems are applied.

after watching this video, Students will be able to apply Consensus and Eliminating Terms theorems .

after watching this video, Students will be able to apply the Four simplification theorems on a SOP in the right order.

after watching this video, Students will be able to apply the Four simplification theorems on a POS in the right order.

after watching this video, Students will be able to apply The eliminating literals and Combining Terms theorems .

after watching this video, Students will be able to apply the Four simplification theorems in the right order.

after watching this video students would be able to prove that two expression are equivalent

after watching this video, Students would be able to validate an equation by manipulating one side of the equation until it is identical to the other side.

after watching this video, Students would be able to validate and equation by reducing both sides of the equation independently to the same expression.

after solving this quiz, Students will be able to apply the Four simplification theorems in the right order.

A description of Unit 4 content and some expectations from students.

After watching this video, Students will be able to take an english sentence and translate to a boolean algebra language by highlight the inputs and outputs then establish an equation.

After doing this quiz, Students will be able to take an english sentence and translate to a boolean algebra language by highlight the inputs and outputs then establish an equation.

After watching this video, Students will be able to represent a truth table as algebraic Expression.

After watching this video, Students will be able to define and identify  Minterms and Maxterms, also will be able to expand any given expression to the Minterm and Maxterm form.

Traffic lights

Read about what's good
what should give you pause
and possible dealbreakers
Covers number systems and conversions, which are foundational for understanding how digital systems represent and manipulate data, making it highly relevant for electrical engineering students
Explores Boolean algebra and its applications, which are essential for designing and analyzing digital circuits and algorithms, providing a strong foundation for computer science students
Teaches Karnaugh maps, a visual tool used to simplify Boolean algebra expressions, which is a practical skill for electrical engineers designing digital circuits
Introduces multi-level gate circuits using NAND and NOR gates, which are fundamental building blocks in digital logic design, providing practical knowledge for electrical engineering students
Focuses on the fundamentals of logic design, which may require learners to supplement their knowledge with more advanced topics and real-world applications later on
Requires learners to memorize and apply Boolean algebra theorems, which may be challenging for some learners who prefer a more intuitive or hands-on approach

Save this course

Create your own learning path. Save this course to your list so you can find it easily later.
Save

Reviews summary

Solid logic design fundamentals

According to students, this course offers a solid foundation in logic design fundamentals, covering topics from number systems to Boolean algebra and K-maps. Many learners found the explanations very clear and the progression logical, making complex concepts accessible. The quizzes after each section were highlighted as helpful for reinforcing learning. However, some reviewers noted that certain sections felt rushed, and there were occasional mentions of issues with video or audio quality in some lectures. A few students felt the course could benefit from more hands-on examples or requires supplementing with other resources for deeper understanding or practical application.
Quizzes aid in understanding and reinforcement.
"The quizzes were helpful for testing understanding..."
"The quizzes after each section were great for reinforcing learning."
"Fantastic overview. Reinforced concepts I learned elsewhere and provided new insights... The quizzes... were great for reinforcing learning."
Course provides a strong base in core concepts.
"Excellent course! ... Highly recommended for anyone starting out."
"Good introduction to logic design fundamentals. Covered all the basics listed in the syllabus well."
"A solid foundation course."
"Learned a lot about Boolean algebra and logic gates."
Content is clearly explained and easy to follow.
"The explanations were very clear, and the progression through number systems, boolean algebra, and K-maps felt very logical."
"The instructor is knowledgeable and breaks down complex topics effectively."
"I found the K-map section particularly well done."
"The first few sections were very clear."
Some lectures feel rushed with occasional tech issues.
"Some parts felt a bit rushed, particularly the later sections on multi-level circuits."
"The content is okay, but the video quality isn't great in some lectures."
"Found it difficult to follow. The explanations were not always clear, and the leaps between topics felt abrupt."
"Decent content, but some lectures had audio issues."
May require external resources or more practice.
"Could use more practice problems or challenges."
"Requires supplementing with other resources."
"Wish there were more hands-on lab examples or simulations shown to see the circuits in action."
"I had to look up a lot of information elsewhere."

Activities

Be better prepared before your course. Deepen your understanding during and after it. Supplement your coursework and achieve mastery of the topics covered in Full Course in Fundamentals of logic design with these activities:
Review Number Systems
Strengthen your understanding of different number systems and conversions before diving into logic design.
Browse courses on Number Systems
Show steps
  • Review the definitions of binary, decimal, octal, and hexadecimal number systems.
  • Practice converting numbers between different bases.
  • Solve practice problems related to number system conversions.
Read 'Digital Design' by Morris Mano
Supplement your learning with a comprehensive textbook that covers all the core concepts of logic design.
View Digital Design on Amazon
Show steps
  • Obtain a copy of 'Digital Design' by Morris Mano.
  • Read the chapters related to number systems, Boolean algebra, and Karnaugh maps.
  • Work through the examples and exercises in the book.
Boolean Algebra Simplification Exercises
Reinforce your understanding of Boolean algebra by working through a series of simplification problems.
Show steps
  • Find online resources or textbooks with Boolean algebra simplification problems.
  • Solve a variety of problems using different Boolean algebra theorems.
  • Check your answers and review the steps for each simplification.
Three other activities
Expand to see all activities and additional details
Show all six activities
Create a Truth Table Generator
Solidify your understanding of truth tables by creating a tool that generates them from Boolean expressions.
Show steps
  • Choose a programming language (e.g., Python) or spreadsheet software (e.g., Excel).
  • Implement an algorithm that takes a Boolean expression as input.
  • Generate the corresponding truth table as output.
  • Test your generator with various Boolean expressions.
Study 'Logic Design Principles' by Edward McCluskey
Deepen your knowledge with a book that explores advanced topics in logic design.
View Melania on Amazon
Show steps
  • Obtain a copy of 'Logic Design Principles' by Edward McCluskey.
  • Focus on chapters related to state machine design and asynchronous circuits.
  • Compare the concepts presented in the book with those covered in the course.
Design a Simple ALU
Apply your knowledge to design a basic Arithmetic Logic Unit (ALU) that performs arithmetic and logical operations.
Show steps
  • Define the functionality of your ALU (e.g., addition, subtraction, AND, OR).
  • Design the logic circuits for each operation using logic gates.
  • Simulate and test your ALU using a logic simulator.
  • Document your design and testing process.

Career center

Learners who complete Full Course in Fundamentals of logic design will develop knowledge and skills that may be useful to these careers:
Digital Design Engineer
A digital design engineer specializes in designing digital circuits and systems. This career path involves extensive knowledge of Boolean algebra, number systems, and logic gates. The course's detailed coverage of Boolean algebra theorems, minterm and maxterm expansions, and Karnaugh maps is highly relevant to the responsibilities of a digital design engineer. The study of multi-level gate circuits is also beneficial because it provides practical skills in designing complex digital systems. This course helps build a foundation for a career as a digital design engineer.
VLSI Design Engineer
A very large scale integration design engineer designs integrated circuits with a high density of components. This career requires expertise in digital logic design, number systems, and circuit optimization. The course's in-depth coverage of Boolean algebra, Karnaugh maps, and multi-level gate circuits is highly relevant to the activities of a VLSI design engineer. The emphasis on simplification theorems and minterm/maxterm expansions is also beneficial for optimizing VLSI designs. This course may help you advance your career as a VLSI design engineer.
Circuit Design Engineer
A circuit design engineer focuses on designing and testing electronic circuits. A key benefit of this course lies in its comprehensive coverage of fundamental concepts such as number systems, binary arithmetic, and Boolean algebra. A circuit design engineer must have a practical understanding of logic gates, minterm and maxterm expansions, and simplification techniques. This will allow them to create efficient and reliable circuits. This course helps build a foundation for a career as a circuit design engineer.
FPGA Engineer
An FPGA engineer designs and implements digital circuits using Field Programmable Gate Arrays. A solid understanding of logic design principles is essential for success in this role. This course helps you master number systems, Boolean algebra, and simplification techniques. The course's coverage of Karnaugh maps and multi-level gate circuits is advantageous for optimizing designs for FPGAs. An engineer seeking a future as an FPGA Engineer may find this course to be useful.
System on a Chip Designer
A system on a chip designer creates complex integrated circuits that combine multiple functionalities on a single chip. This career demands a deep understanding of digital logic, number systems, and circuit optimization. A significant benefit of this course is its detailed coverage of Boolean algebra, Karnaugh maps, and multi-level gate circuits. It is also beneficial to study simplification theorems and minterm/maxterm expansions, all of which are essential for this type of design. This course may help you prepare for this career path.
Logic Design Consultant
A logic design consultant provides expert advice and solutions for digital logic design challenges. The course's focus on Boolean algebra, Karnaugh maps, and multi-level gate circuits may equip you with the necessary expertise to tackle complex logic design problems. Skills in number systems and simplification techniques may enhance your capabilities as a consultant. This course may give you an advantage in a logic design consulting role.
Embedded Systems Engineer
An embedded systems engineer develops software and hardware for embedded systems, often involving real-time constraints. The study of number systems and conversions, as well as Boolean algebra, is directly applicable in this field. The course's focus on simplification theorems and Karnaugh maps is beneficial for optimizing the logic used in embedded systems. You will also learn about multi-level gate circuits, a practical skill for designing efficient embedded systems. An individual seeking a career as an Embedded Systems Engineer may find this course to be helpful.
Firmware Engineer
A firmware engineer develops low-level software that controls hardware devices. Understanding number systems, binary arithmetic, and Boolean algebra is crucial for this role. The course's coverage of logic gates and simplification techniques is directly applicable to firmware development. Specific knowledge of minterm and maxterm expansions may be helpful for optimizing firmware code. This course may help you learn how to become a firmware engineer.
Hardware Engineer
A hardware engineer designs, develops, and tests computer hardware components. This career involves understanding digital systems, which this course helps with its in-depth exploration of number systems and conversion techniques. The course covers key aspects of binary arithmetic and negative number representation, which are essential when building and troubleshooting hardware systems. Focusing on Boolean algebra theorems and simplification techniques is particularly advantageous. This course may help you build a foundation for a career as a hardware engineer.
Computer Architect
A computer architect designs the overall structure and organization of computer systems. This involves understanding the fundamentals of logic design. A key benefit of this course is its coverage of Boolean algebra, including theorems and simplification, which are crucial for optimizing computer architectures. Furthermore, the course delves into minterm and maxterm expansions, which are critical for designing efficient combinational logic circuits. A detailed study of Karnaugh maps also helps you succeed as a computer architect. This course may be useful to you.
Digital Systems Validation Engineer
A digital systems validation engineer is responsible for validating the functionality and performance of digital systems. This role requires a solid understanding of digital logic and testing methodologies. This course may be helpful because it provides a solid foundation in number systems, Boolean algebra, and logic gate implementations. Digital systems validation engineers may also find that the discussion of Karnaugh maps and simplification may be practically useful. This foundation may lead to success in this role.
Hardware Verification Engineer
A hardware verification engineer ensures that hardware designs meet specifications and function correctly. Understanding number systems, binary arithmetic, and Boolean algebra is critical for developing effective verification strategies. The course's coverage of logic gates and simplification techniques may aid in creating comprehensive verification plans. This general knowledge may prove useful to a Hardware Verification Engineer.
Automation Engineer
An automation engineer designs and implements automated systems for various industries. This requires knowledge of digital control systems and logic design. The course's focus on Boolean algebra, number systems, and logic gate implementations may be beneficial when designing and troubleshooting automation systems. Automation engineers may find the discussion of Karnaugh maps and simplification useful. This course may help you grasp the necessary principles.
Robotics Engineer
A robotics engineer designs, builds, and programs robots. A fundamental understanding of digital logic and control systems is required. This course may be beneficial to a robotics engineer due to its coverage of number systems, Boolean algebra, and logic gates. The principles of minterm and maxterm expansions and simplification are essential for creating efficient and reliable robotic systems. A robotics engineer may find this general knowledge to be useful.
Test Engineer
A test engineer develops and implements testing procedures for electronic components and systems. Understanding number systems, binary arithmetic, and Boolean algebra is essential for designing effective test strategies. The course's coverage of logic gates and simplification techniques may be beneficial for creating comprehensive test plans. This course may help an aspiring test engineer strengthen their understanding of foundational concepts.

Reading list

We've selected two books that we think will supplement your learning. Use these to develop background knowledge, enrich your coursework, and gain a deeper understanding of the topics covered in Full Course in Fundamentals of logic design.
Classic textbook on digital logic and computer design. It provides a comprehensive overview of the fundamental concepts, including number systems, Boolean algebra, logic gates, and Karnaugh maps. It is commonly used in undergraduate courses and serves as a valuable reference for students and professionals alike. Reading this book will provide a solid foundation for understanding the concepts covered in this course and expand on them.

Share

Help others find this course page by sharing it with your friends and followers:

Similar courses

Similar courses are unavailable at this time. Please try again later.
Our mission

OpenCourser helps millions of learners each year. People visit us to learn workspace skills, ace their exams, and nurture their curiosity.

Our extensive catalog contains over 50,000 courses and twice as many books. Browse by search, by topic, or even by career interests. We'll match you to the right resources quickly.

Find this site helpful? Tell a friend about us.

Affiliate disclosure

We're supported by our community of learners. When you purchase or subscribe to courses and programs or purchase books, we may earn a commission from our partners.

Your purchases help us maintain our catalog and keep our servers humming without ads.

Thank you for supporting OpenCourser.

© 2016 - 2025 OpenCourser