DIGITAL LOGIC DESIGN
-
Updated
May 21, 2025 - C++
#
k-map
Here are 12 public repositories matching this topic...
⚡ A collection of Digital Logic Design (DLD) lab work and projects 🔌. Includes circuit designs, truth tables, simulations, and practical implementations. Covers core concepts of logic gates, combinational & sequential circuits, and hands-on problem-solving in digital systems.
education simulation counters logic-gates boolean-algebra finite-state-machines truth-tables registers decoders encoders lab-exercises digital-logic-design sequential-circuits flip-flops k-map combinational-circuits multiplexers timing-diagrams
-
Updated
Aug 24, 2025
Tic-Tac-Toe AI powered by Karnaugh Maps and Boolean Logic
python karnaugh-map discrete-mathematics computer-architecture boolean-algebra game-ai logic-minimization boolean-logic digital-logic-design tictactoe-ai algorithmic-game-theory k-map low-level-logic
-
Updated
Apr 4, 2026 - Python
A program for generating k-maps based on user input.
go cli golang command-line bdd gherkin cucumber karnaugh-map command-line-tool godog k-map kmap go117 golang117
-
Updated
May 31, 2022 - Go
🔧 Welcome to the Digital Systems and Microprocessors Repository! 📚✨ Immerse yourself in a meticulously curated knowledge reservoir on Digital Systems and Microprocessors. 🌐💡 Explore the intricacies of digital circuitry, processor architectures, and system design. 🚀💻 Master the art of efficient digital computing in this dynamic space! 👨💻🌐
digital-logic-design d-flipflop micro-processor flip-flops k-map proteus-v8 4-bit-comparator jk-flipflop 5-bit-comparator 8-bit-comparator sr-flip-flop
-
Updated
Aug 2, 2023
This is a circuit wich can do addition and substraction and shows the values in 7 segment display. The only limitation is that it can only convert 4 bit binary input to BCD to feed the display so it cant show the sum more than 15.
-
Updated
Feb 12, 2025
python karnaugh-map boolean-algebra boolean-operations karnaugh-map-solver 4-variable k-map k-map-solver
-
Updated
Jun 29, 2024 - Python
An interactive Karnaugh Map (K-Map) Solver that simplifies Boolean expressions using Gray Code ordering. It provides a step-by-step learning experience with K-Map visualization, SOP minimization, logic circuit generation, and instant validation.
-
Updated
Jul 17, 2026 - HTML
Implementing Quine-McCluskey and Petrick methods to compute the minimization of a Boolean function
-
Updated
Oct 4, 2019 - Python
Object-oriented C++ code that can solve the Karnaugh map of N variables
-
Updated
Apr 24, 2024
Improve this page
Add a description, image, and links to the k-map topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the k-map topic, visit your repo's landing page and select "manage topics."