The problems of data typing and structuring are investigated. The definition of an algorithm reflecting an important property of alternativity is introduced. In the classical theory of algorithms, the provisions providing the two principles of a modern digital computer are distinguished: program execution control of the program and placement of the executed program in memory along with other data. Possible structures of algorithms, algorithmically unsolvable problems, complexity of algorithms, abstract models of computers are considered. The logical foundations of the computer, ways of representing and converting data in various number systems and performing basic arithmetic and logical operations are studied. The possibilities of parallel execution of operations are explored. The functions of the operating system for providing modes of computer use, interrupt system, multi-channel access, virtual memory are given. The concept of "tagged" architecture, which contributes to the increase of information security, is given. The "von Neumann" and "non-von Neumann" architectures are considered.
For undergraduate and graduate students, post-graduate students, university professors of information technology and economics, for researchers and developers of digital computers.