Skip navigation.
Home

  • Русский
  • English

Questions for entrance examinations. Specialty 05.13.18

  

Questions for entrance examinations for post-graduate studies in specialty 05.13.18.

1. Theoretical basics of calculating processes’ structure design in automated systems 

  • Primitive concepts of algorithms theory. Turing machine.
  • Basics of random processes theory. Characteristic functions and their properties. Markov processes. Random flows.
  • Basics of graph theory. Relations over set and graphs. Graphs operations. Degree, numbers and matrices of graphs. Graphs and nets.
  • Basics of mathematical programming. Linear programming. Features of nonlinear problems, nonlinear programming. Dynamic programming.
  • Combinatorial analysis, basic concepts. Roster methods in general combinatorial scheme. Roster methods for substitution.
  • Basics of modelling theory: concept of “model”, basic models’ properties, models classification. Concept of simulation, modelling of accidental events, values and processes. Modelling algorithm, general simulation scheme. Methods of simulation results processing. Concept of programming languages.
  • Algorithm theory elements. Notion of discreet automaton. Notion of abstract automaton. Analysis and synthesis of finite automaton. Automaton composition, structural schemes. Algorithmic models describing operation of complex automatons.
  • Principles and methods of algebraic, transcendental and differential equations solving.
  • Basics of logics algebra. Logics algebra functions, their representation and minimizing methods. Analysis and synthesis of combinational logical schemes.
  • Arithmetical basics of computers. Choosing of numerical system. Representation and corresponding number formats. Direct, inverse and additional codes. Logical and character operations. Representation of decimal numbers and alphanumeric information. 

2. Computers and computing systems 

  • Introduction. The history of development for digital computing machinery tools. Computers. Multiprocessor computing systems. Hardware and software computer tools. Module based computer structure, software compatibility.
  • Command systems, addressing, control devices and processors. Operation-address coding principle of control information and Neumann computer systems.
  • Multi-address, single-address and no-address command coding systems: comparison of their efficiency. Setting and changing of sequence order. Immediate, direct, self-relative and indirect addressing: their interconnection with computer memory characteristics and structure.
  • Structural characteristics and perspectives for development of microprocessors and microcomputers.
  • Information teleprocessing and organization. Structure of information communication units. User terminals, data transfer multiplexors. Data transfer devices.
  • Various ways of computer complexing basing on modular principle. Multi-computer complexes, multi-processor computing systems. Interconnection and interaction features of software and hardware tools in computing complexes and systems organization.
  • Computer networks, their functions and composition; computer, communication tools and data switching tools. Types of computer networks. Principles of information control and protection in computer systems. An example of a network.
    • 3. Software for computers and computing systems.  
  • Basic modes of computing process management. Multiprogramming principles. Structure and operation of multiprogramming systems.
  • Definition of operating system (OS). Basic OS components. OS features: reliability, complexity, efficiency and compatibility.
  • OS parallelism. Support of parallel programming and asynchronous interacting processes. Processes interaction. Clock machines, implementation methods. Processes planning strategies. Clinches. Methods eliminating and preventing clinches.
  • Concept of user and resource, dispatch system. Resources distribution strategies. Resources protection.
  • Structure of memory data. Memory control functions. Memory distribution strategies.
  • Information control. Structure and composition of file systems. Logical and physical file systems organization. Access procedure. Access control verification. File operations. Restoration of systemic failures.
  • Methods of devices’ control. Input-output methods. Input-output drivers and planner.
  • OS application issues. Ways of attaining various characteristics in a certain OS version. Programming systems, interaction with OS. 

4. Algorithmic languages and programming.

 

  • Programming systems and languages. Computer-oriented, problem-oriented and universal languages. Alphabet, syntax and semantics. Ways of programming languages description. Translation.
  • Data types, type assigning methods. Constants and variables. Identifiers. Structural data types. Expressions, operations and operators. Arithmetic and logical operations and operators. Arithmetic and logical operations and operators. Stack and Polish notation.
  • Marks and transition operators. Cycle operators and conditional operators. Programming of information input and output. Editing.
  • Block structure. Variables and marks localization. Subprograms and macro-definitions. Methods of parameters transmission in subprograms and macro-commands application.
  • Programming languages features (Assembler, C/C++, Pascal).  

5. Technique of distributed data processing.

  • Concept of distributed data processing system. Sample of distributed processing system development. Distributed data bases.
  • Data transmission technique. Circuit switching. Packet switching. Communication via artificial earth satellites. Optical communication.
  • Computer networks architecture. Protocol hierarchy.  Interconnection of open OSI systems.
  • Local networks. Structure and functioning of local networks. Communication systems. Low-level protocols. High-level protocols and software structure.  

References:

 

  1. V.Lipsky, Combinatorics for programmers. M.: Mir, 1988.
  2. I. L. Akulich, Mathematical programming. Cases and problems. M: Vyssh. Shk., 1986.
  3. Samarsky A.A., Gulin V.V. Numerical methods, M.: Nauka, 1989.
  4. Svami M., Thulasiraman K. Graphs, networks and algorithms, M: Mir, 1984.
  5. Molchanov A.A. Modelling and design of complex systems, K.: Vyscha Shk., 1988.
  6. Kagan B.M. Computers and computing systems, M.: Energoatomizdat, 1985.
  7. J. Donovan, System programming, M.:Mir, 1975.
  8. T. Pratt, Programming languages: development and implementation. M.: Mir, 1979.
  9. T.A. Pavlovskaya, C/C++. Programming in high-level language: Textbook for HEE. St.-P.: Piter, 2003.
  10. R. Sebesta, Basic concept of programming languages (5th edition) publ.house: Viljams, 2001.
  11. Ben-Ari M. Programming languages. Practical comparative analysis. M.: Mir.
  12. E.A. Yakubaitis, Computing networks architecture. M.: Statistika, 1980.
  13. K. Veitsman, Distributed systems of micro- and micro-computers. M.: Finances and statistics, 1983.
  14. M. Kato, D. Iimura, M. Tokoro, Ye. Toma, Computer networks building. M.: Mir, 1988.
  15. D. Bertsekas, R. Gallagger, Data transmission networks. M.: Mir, 1989.
  16. Protocols of information-computer networks. Reference book. / Edited by I.A. Mizina, A.P. Kuleshova. M.; Radio i svjaz’, 1990.