Course Objectives
(1) Understand the basic matters of logic circuits.
(2) Understand combination circuits.
(3) Understand basic of sequential circuits.
Rubric
| Ideal Level | Standard Level | Unacceptable Level |
Achievement 1 | Fully understand the basic matters of logic circuits. | Understand the basic matters of logic circuits. | Do not understand the basic matters of logic circuits. |
Achievement 2 | Fully understand combination circuits.
| Understand combination circuits.
| Do not understand combination circuits.
|
Achievement 3 | Fully understand basic of sequential circuits.
| Understand basic of sequential circuits.
| Do not understand basic of sequential circuits.
|
Assigned Department Objectives
Teaching Method
Outline:
The aim of this course is to understand the basic configuration and operating principles of arithmetic circuits, flip-flop circuits, counter circuits, etc., based on the Boolean algebra. Classes also involve exercises so that students can design appropriate circuits on their own.
Style:
Classes will be held in a lecture style, mainly by explaining content following the textbook. As necessary, students will work on exercises and design assignments.
Nakajima will teach in the first semester, and Hoshino in the second. Tsuchida is the liaison.
Notice:
Students are required to learn in an active manner so they can design circuits themselves. If possible, they should construct the circuit they designed and study its operation.
Students who miss 1/4 or more of classes will not be eligible for a grade evaluation.
Characteristics of Class / Division in Learning
Course Plan
|
|
|
Theme |
Goals |
1st Semester |
1st Quarter |
1st |
Binary numbers and Basics for radix conversions |
Can explain binary numbers and Basics for radix conversions.
|
2nd |
Radix conversions and Basics for Logical operations |
Can explain radix conversions and Basics for logical operations.
|
3rd |
Logical operations and Venn diagrams |
Can explain logical operations and Venn diagrams.
|
4th |
Basics for the Boolean algebra |
Can explain the basics of Boolean algebra.
|
5th |
Logical expressions and the Karnaugh map |
Can explain logical expressions and the Karnaugh map.
|
6th |
Karnaugh map exercises |
Can simplify a logical expression using the Karnaugh map.
|
7th |
Quine–McCluskey algorithm |
Can explain the Quine–McCluskey algorithm
|
8th |
Basics of logic circuit design |
Can explain the basics of logic circuit design.
|
2nd Quarter |
9th |
Midterm exam |
Midterm exam
|
10th |
Basics of gate circuits |
Can explain the basics of gate circuits.
|
11th |
Basics of digital ICs |
Can explain the basics of digital ICs.
|
12th |
Combination circuits 1 (e.g. how to design an adder circuit) |
Can explain combination circuits (e.g. how to design an adder circuit).
|
13th |
Combination circuits 2 (e.g. how to design a data converter circuit) |
Can explain combination circuits (e.g. how to design a data converter circuit).
|
14th |
Combination circuits 3 (e.g. how to design a data selector circuit) |
Can explain combination circuits (e.g. how to design a data selector circuit).
|
15th |
Flip-flops 1 (e.g. basic of FFs, operating principles and characteristic equation of RS-FF and JK-FF) |
Can explain flip-flops (e.g. basic of FFs, operating principles and characteristic equation of RS-FF and JK-FF).
|
16th |
Final exam |
|
Evaluation Method and Weight (%)
| Examination | Exercise and Task | Total |
Subtotal | 70 | 30 | 100 |
Basic Proficiency | 0 | 0 | 0 |
Specialized Proficiency | 70 | 30 | 100 |
Cross Area Proficiency | 0 | 0 | 0 |