This 3 unit course on Logic Circuits and Design meets for 3 hours per week. It has prerequisites of Fundamental of Electrical Circuits and a co-requisite of Logic Circuits and Design Laboratory. The course outline covers topics such as gates, truth tables, Boolean algebra, K-maps, flip-flops, counters, registers, sequential circuits, and memory addressing.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
2K views
Logic Circuits and Design
This 3 unit course on Logic Circuits and Design meets for 3 hours per week. It has prerequisites of Fundamental of Electrical Circuits and a co-requisite of Logic Circuits and Design Laboratory. The course outline covers topics such as gates, truth tables, Boolean algebra, K-maps, flip-flops, counters, registers, sequential circuits, and memory addressing.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1
Course Name Logic Circuits and Design
Course This course
Description
Number of Units 3 units
for Lecture Number of 3 hours per week Contact Hour per Week Prerequisites Fundamental of Electrical Circuits Co-requisites Logic Circuits and Design Laboratory Program To be identified by the program Outcomes Course Outcomes To be identified by the program Course Outline 1. Gates, Truth Tables, Boolean Algebra, Function Simplification 2. K-Maps Circuit Implementation Using K-Maps, SOP and POS Representation, NAND/NOR implementations. 3. Mux, Demux, Decoders, Code Conversion (BCD to Binary, Excess-3 to Binary, Gray Code) 4. Latches and Flip-Flops: SR,D,JK.,T 5. Counter Design, Register Design ,ALU Function 6. Sequential Circuits, Excitation Function, State Table, State Diagram. 7. Sequential Circuits Design with Different Flip-Flops. 8. Synchronous and Asynchronous Circuits Analysis and Design, Excitation Function, Flow Table 9. Algorithms State Machine 10. Addressing and Decoding of Memory and I/O Systems