Numbering Code	U-ENG29 29070 LJ11 U-ENG29 29070 LJ55 U-ENG29 29070 LJ10	Year/Term	2022 ・ First semester
Number of Credits	2	Course Type	Lecture
Target Year		Target Student
Language	Japanese	Day/Period	Wed.2
Instructor name	TAKAGI NAOFUMI (Graduate School of Informatics Professor)
Outline and Purpose of the Course	In this course, we learn about symbolic logic and Boolean algebra, the basis of computer science, and about logic circuits, the basis of digital machine configurations. We first study symbolic logic, especially propositional logic. Next, we take up Boolean algebra, its various characteristics (properties); meanwhile, students will gain logic function simplification methods. We further study the design and analysis of combinational logic circuits, as well as sequential circuits and their models, sequential machines.
Course Goals	1. Students will understand and be able to explain propositional logic. 2. Students will understand and be able to explain the fundamental concepts and various characteristics of Boolean algebra and logic functions. 3. Students will understand and be able to use logic function simplification methods. 4. Students will understand and be able to explain the fundamental concepts and design methods of combinational logic circuits and sequential circuits.
Schedule and Contents	Mathematical preparation (1 class) A review of knowledge necessary for this course, including sets, relationships, etc. Symbolic logic (1 class) Students learn about propositional logic, together with an overview of symbolic logic. Boolean algebra and logic functions (2 classes) Students learn about Boolean algebra and logic expressions, as well as about logic functions and their expressions, etc. Simplification of logic functions (2 classes) Students learn about the simplification of logic functions. Various characteristics of logic functions (2 classes) Students learn about the various properties of logic functions and about logic functions that have special characteristics. Design and analysis of combinational circuits (2 classes) Students learn about design methods and analysis methods for combinational circuits. Sequential machines and sequential circuits (4 classes) Students learn about design methods for sequential circuits, and especially regarding the minimization of, and state allocation for, sequential machines. Term-end examination (1 class) Feedback (1 class) Review, including of the problems on the final examination, etc.
Evaluation Methods and Policy	Evaluation is performed regarding each element of this course's end goals, namely, the final examination (approximately 90%) and exercises (approximately 10%). If an understanding is shown of 80% or higher on the final exam, then the student will pass the course.
Course Requirements	None
Study outside of Class (preparation and review)	Students are to read assigned textbook portions to prepare for each class. Students are to solve the problem exercises assigned during each class and to submit each week's problems before the next class.
Textbooks	Textbooks/References	Logic circuits, Naofumi Takagi, (Ohm-sha), ISBN:9784274215995
References, etc.	Switching and Finite Automata Theory, Third Ed., Zvi Kohavi, Niraj K. Jha, (Cambridge University Press, 2010), ISBN:0521857481, 9780521857482
Related URL	http://www.lab3.kuis.kyoto-u.ac.jp/~ntakagi/ls.html