EE-Learning
Boolean Function Minimization – II
Catogry:
Computing
Subject:
Computer Science
Course:
Digital Systems Design
Lecture List
Digital System Design Current State of the Art
Design of a Micro Programmed CPU
Design of Computer Instruction Set and the CPU – 6
Design of Computer Instruction Set and the CPU – 5
Design of Computer Instruction Set and the CPU – 4
Design of Computer Instruction Set and the CPU – 3
Design of Computer Instruction Set and the CPU – 2
Design of Computer Instruction Set and the CPU – 1
Algorithmic State Machines Chart
Design of Memory Circuits
Design of Arithmetic Circuits – II
Design of Arithmetic Circuits – I
Programmable Logic Devices – III
Programmable Logic Devices – II
Programmable Logic Devices – I
Finite State Machine Design and Optimization
Finite State Machine Design
Design of Registers and Counter
Design of Sequential Modules
Synchronous Sequential Circuit Design
Logic Design with PLA
Combinational Logic Design
Combinational Logic Problem Design
Design of Combinational Circuits
Design of Complex Combinational Circuits
Design of Common Digital Elements
Design of Subtractor Circuits
Design of ADDER Circuits
Combinational Circuit Design
Hazzard Covers by K – Map
Boolean Function Minimization – III
Boolean Function Minimization – II
Boolean Function Minimization – I
Boolean Algebra – II
Boolean Algebra – I
Digital Logic – III
Digital Logic – II
Digital Logic – I
Introduction – II
Introduction – I