The aim is to design, construct and simulate combinational and sequential circuits, which are gradually assembled using basic gates in simple circuit networks to form more complex arithmetic circuits and memory applications. The theoretical foundations are consolidated through exercises in order to then implement and test specific tasks and applications using modern software-supported simulation.

Lecture, joint solving of examples, preparation of worksheets by students at home and presentation in the course units, software-supported design and simulation of digital circuits.

This course expands on the content presented in the lecture "Design of digital circuits" and supplements it with examples of Boolean algebra, the optimization of digital circuits and finite automata (sequential circuits). Students learn the (software-supported) design and implementation of simple circuits, the correct function of which is verified by simulation.Boolean algebra, standard nomal forms, algebraic transformationsCircuit minimization, KV diagramsCombinatorial circuits (conception, design, implementation, testing)Design of sequential circuits (conception, design, implementation, testing)Finite state machinesSoftware-supported design and simulation of digital circuits

Written examWithout documents75 minutesTo reach 40 points21 points necessary for a positive exam gradeFull course content2 exam dates at the end of the course, 2-3 weeks apart. Participants are free to take the first, second or both exams. In any case, the last grade achieved counts. A positive grade on the exam is a prerequisite for a positive overall assessment.

Exam covers all topics of this course.

It is a course with continuous assessment, in which participants receive ongoing assessment in the form of points for their performance.A total of 100 points can be achieved, which are made up as follows:3 worksheets with 10 examples each worth one point. So: 3 x 10 = 30 points.2 projects of 15 points each. So 2 x 15 = 30 points.1 exam of 40 points.Therefore: 30 + 30 + 40 = 100 points.Solved tasks on the exercise sheets must be ticked in an online tick list by the respective course date in order to receive the corresponding point. A tick means that the task can be presented in the course, either correctly or with open questions. The same applies to the two projects.Attendance at the individual lectures is compulsory, although two absences will be tolerated with appropriate feedback. Multiple absences (>= 3) will result in a negative overall assessment.The course is considered passed if both of the following criteria are met:Final exam points >= 21 (out of 40)Total points of the course => 51 (out of 100)The exact grading key and the detailed assessment modalities will be issued in the first course unit.