Training Computer Engineering

Computer Engineering

Engineering
Intermediate 120 minutes 5 lessons
Apply math to digital logic, binary arithmetic, Boolean algebra, algorithm complexity, and data structures.

Learning Objectives

  • Perform binary, octal, and hexadecimal conversions
  • Simplify Boolean expressions using laws and Karnaugh maps
  • Analyze algorithm time complexity with Big-O notation
  • Apply modular arithmetic and number theory basics
  • Compute with logic gates and binary arithmetic circuits

Lessons

1
Number Systems & Binary Arithmetic
24 min
2
Boolean Algebra & Logic Gates
24 min
3
Algorithm Complexity — Big-O Notation
24 min
4
Modular Arithmetic & Cryptography Math
24 min
5
Placement Test Practice — Computer Engineering
25 min

Quick Practice

Test your knowledge with a quick interactive challenge from this module.

Loading…
Score: 0/0

Key Concept Flashcards

Loading…
1 / 1

Click the card to flip it