Video Training →Understanding Quine-McCluskey Algorithm
Published by: LeeAndro on 6-10-2020, 06:47 | 
0
Genre: eLearning | MP4 | Video: h264, 1280x720 | Audio: aac, 44100 Hz
Language: English | VTT | Size: 383 MB | Duration: 4 section | 20 lectures | (1h 45m)
Students will be able to understand how K-map minimization can be done in way that is understandable by computers.
What you'll learn
Requirements
Understanding of truth table
Understanding of Karnaugh Map (K-map)
Understanding of Boolean algebra and Boolean expression minimization
Description
This course will present to you a detailed course on how to perform the algorithm of Quine-McCluskey in minimizing Boolean expression. The algorithm will be divided into its two parts - finding p implicants and finding essential p implicants. Comparison with Karnaugh map will be made so that the students can tell why Quine-McCluskey works.
Who this course is for:
Students of the first course in digital electronics who have knowledge in Boolean algebra.
DOWNLOAD
uploadgig
rapidgator
nitroflare
Related News
-
{related-news}