1. | ![]() |
강의소개 및 수의 체계와 변환 | 1.Digital Systems 2.Switching Circuits 3.Number Systems and Conversion | ![]() |
2. | ![]() |
수의 체계와 변환 | 1.Binary Arithmetic 2.Representation of Negative Numbers 3.Binary Codes | ![]() |
3. | ![]() |
부울 대수와 간소화 1 | 1.Introduction 2.Basic Operation 3.Basic Operation | ![]() |
4. | ![]() |
부울 대수와 간소화 2 | 1.Boolean Expression and Truth Table, Basic Theorem 2.Commutative, Associative and Distributive Laws 3.Simplification Theorem | ![]() |
5. | ![]() |
부울 대수와 간소화 3 | 1.Multiplying Out 2.Factoring 3.DeMorgan’s Laws | ![]() |
6. | ![]() |
부울 대수와 간소화 4 | 1.Multiplying Out and Factoring Expressions 2.Exclusive-OR and Equivalence Operations 3.The Consensus Theorem etc. | ![]() |
7. | ![]() |
최소항과 최대항의 전개 | 1.Conversion of English Sentences to Boolean Equations 2.Combinational Logic Design Using a Truth Table 3.Minterm and Maxterm Expansions etc. | ![]() |
8. | ![]() |
카노맵 | 1.Minimum Forms of Switching Functions 2.Two- and Three-Variable Karnaugh Maps 3.Four-Variable Karnaugh Maps etc. | ![]() |
9. | ![]() |
콰인맥클러스키방법 | 1.Determination of Prime Implicants 2.The Prime Implicant Chart 3.Petrick’s Method etc. | ![]() |
10. | ![]() |
다단 게이트회로 Nand와 Nor 게이트 | 1.Multi-Level Gate Circuits 2.NAND and NOR Gates 3.Design of Two-Level Circuits Using NAND and NOR Gates etc. | ![]() |
11. | ![]() |
게이트를 이용한 조합회로설계 | 1.Review of Combinational Circuit Design 2.Design of Circuits with Limited Gate Fan-in 3.Gate delays and Timing Diagrams etc. | ![]() |
12. | ![]() |
멀티플렉서, 디코더, 프로그래머블 논리소자 1 | 1.Multiplexers 2.Three-State Buffers 3.Decoders and Encoders | ![]() |
13. | ![]() |
멀티플렉서, 디코더, 프로그래머블 논리소자 2 | 1.Read-Only Memories 2.Programmable Logic Devices 3.Complex Programmable Logic Devices etc. | ![]() |