39 hod., compulsory

The continuous and discrete expression of the information by a signal, the terms "the signal quantity" an "the code". The general logic element, its static an dynamic characteristics and its static and dynamic noise immunity. The passive and active logic elemnts. Morelevel and binary logics, the positive and negative logics and the duality of binary logic elements.
The Boolean function and the modes of its inscription (the sentence, the truth-table, the set of status indexes, the Haase´s graph, th Karnagh´s and Svoboda´s chart, the Booleant matrix). The binary and the symmetrical (Gray´s) code. The term "neighbour" and the neighbouring peaks and corps in the Haase´s graph.
The hazards of the first and second order, their elminitation by the aid of the minimization of the Boolean function. The material saves due to this minimization. The minimization of the combinational circuit with one output (the Quine Mc Cluskey´s and Svoboda´s method). The internal and external disturbances.
The minimization of a combinational circuit with more outputs, the evaluation of minimization methods, morelevel combinational circuits.
The general finite automata. Finite automata Mealy and Moore. The term "internal statues" of the finite automata, the evolution table, the transfer table. The Boolean equations and the means of inscription of the time discretization. The asynchronous and synchronous function of the finite automata, the rule of inertia.
The combinational feedback at the final automata and its design. The Boolean equation and its solution by a chart-method. Its one solution and more solutions, the rise of additional for relation between the independent variables.
The ralization of non-standard logic elements. The function of the decision circuit and the logic switch in a logic element.
The transfer of binary signal over a bus, the rise of internal disturbances due to the reflections, the impedances of the inputs and outputs of the logic elements, the transfer capacity an the frequency-band of the bus, binary codes with and without return to zero.
The code methods for the safety of the data transfer on the bus, the detection of one or more errors, the length and cross parity. The cyclic codes, the Bose-Chaudhuri-Hocquent codes, the Reed-Solomon codes and the convolution codes and their encoding and decoding, the Meggit´s decoder.
The semiconductor write/read memories (RAM), their construction from elementary parts, read-only (ROM) memories, programmable ROM, erasable EPROM, electrically erasable EEPROM.
The programmable logic arrays and their architectures, developing systems, the programme PGAL. The testing of a programmed logic array.
The auxiliary and supporting circuits for microprocessors and the circuits of the middle and large scale integration, the basic types and selected single-purpose circuits. VHDL language, basic principles.

13 hod., compulsory

The inscription of the Boolean functions into the charts and graphs, exaples, the minimization of a function with one output only.
The examples of morelevel encoders a the minimization of a group of Boolean functions.
The sequential circuits described as finiote automatas.
The design of the feedback circuits of a finite automata by the aid of the solution of Boolean equations.
The design of a program for programming of a logic array.
The written test