Home >Teaching >Computational logic

Computational logic

Organisation

Bachelor: 2h/week course and 2h/month exercises, Winter semester
Lecturer: Sorin Grigorescu
Exercises: Sorin Grigorescu
Language: Romanian

Content
Lecture Description Course
1 Numbering systems course
2 Floating point representation 1 course
3 Floating point representation 2 course
4 Codes course
5 Alphanumeric codes course
6 Boolean algebra course
7 Boolean functions course
8 Boolean functions representations course
9 Boolean functions representations via logic circuits course
10 Complete systems of functions course
11 Synthesis of combinational logic circuits course
12 Boolean functions minimization: Karnaugh diagrams course
13 Minimization of incomplete defined boolean functions course
14 Minimization of boolean functions systems course
Homework
Homework Description Materials
1 Mathematics of discrete automation slides
2 Boolean functions 1 slides
3 Boolean functions 2 slides
4 Minimization of boolean functions slides
5 Number systems slides
6 Binary number system slides
Examination

Written and practical exam at the end of the semester.

References

F. Moldoveanu, Circuite Logice si Comenzi Secventiale, Editura Universitatii Transilvania din Brasov, 2003.