RI3AOR Computer architecture V: 2+1+0 VI: 2+1+1

RI3IDE Pulse and digital electronics V: 3+2+2 VI: 3+2+1

Pulse electronics: Switching properties of diode, BJT and MOSFET. Logic gates in bipolar technology (RTL, DTL, TTL, STTL, ASTTL, ALSTTL, ECL, three stage output). Logic gates in NMOS and CMOS technology. Flip-Flops (positive feedback concept, SR, T, JK, D and MS flip-flops; TTL, ECL, NMOS and CMOS logic). Anstable and monostable circuits. Comparators (differential, Schmidt trigger). Time base generators (Miller, Bootstrap). Digital electronics: Registers. Shift registers. Combinational digital systems (decoders, coders, multiplexers, demultiplexers, PAL, PLA). Sequential digital systems (parallel and serial binary counters, bi-directional counters). Memories (static, dynamic, ROM, PROM, EPROM, EEPROM, NVRAM). Arithmetic and logic units (adders, multipliers). A/D converters. D/A converters.

RI3PJM Programming languages and methods V: 2+2+0 VI: 2+2+0

Semester I: Introduction. Object-oriented concepts. History of C++. The C++ language overview. Elements of C++ inherited from the C language. Classes and objects. Abstraction and instance. Class definition. Member functions. Access control. Static members. Friends. Structures and unions. Class nesting. Constructors and destructors. Operator overloading. Operators in C++. Operator functions. Binary and unary operators. Special operators treatments. Inheritance. Concept of generalization/specialization relationship. Derived classes and inheritance. Protected members. Deriving modes. Polymorphism. Virtual member functions. Dynamic binding. Multiple inheritance. Templates. Mechanism for creating generics. Template definition. Functions templates. Class templates. Instantiating templates. Exception handling. Exception types and objects. Throwing and handling exceptions. Applied techniques. Random number generators. Compression. Cryptography.

Semester II: Software portability. Bytecode and Java virtual machine. Compilers and tools. Classes and objects. Contract and implementation. Fields. Access control. Constructors. Methods. Parameters. Overloading methods. Garbage collection. Nested Classes and Packages. Access rights. Static and inner classes. Relationships. Packages. Extending classes. Extending a class. Extending contract. Overriding methods. The Object class. Interfaces. References of interface types. Interface usage example. Interface methods and fields. Single and multiple inheritance. When to use interfaces? Exceptions. Testing for errors. Statement throw. Exception handling. Construct try-catch-finally. GUI (Graphical User Interface) programming. Package AWT. Event handling. Assembly Language. Processor architecture. Addressing modes. Instruction set. Memory models. Directives. Literature: [1] Stroustrup, B., The C++ Programming Language, Special third edition, Addison-Wesley Publishing Company, 2000. [2] Arnold, K., Gosling, J., Holmes, D., The Java Programming Language, 3rd Edition, Addison-Wesley, 2000. [3] Schildt, H., Java 2: The Complete Reference, The McGraw-Hill Companies, 2001.

RI3OT Fundamentals of telecommunications V: 3+2+1 VI: 3+2+1

Introduction. Model of communication system and process. Introduction to information theory. Signals and spectra. Characteristics of real signals. Introduction to theory of random processes. Random noise. Transmission of signals through linear and nonlinear systems. Analog modulation. Analog communication systems. Analog communication systems and noise. Sampling process. A/D conversion. Time division multiplexmultiple access. Baseband digital transmission. Line codes. Intersymbol interference. Digital transmission through bandlimited channels. Nyquist's criterions. Correlative coding. Adaptive equalization. Elements of decision theory. Optimum receiver. Digital transmission via carrier modulation. Coherent and noncoherent digital modulation techniques. Noise in digital modulation systems. Spectral efficiency. Digital transmission systems hieararchy. Elements of coding theory. Spread spectrum techniques. Code division multiple access. Principles of adaptive signal processing. Overview of modern communication systems. Personal communication systems. Future development in communication systems.

RI3E Electromagnetics V: 2+2+0

INTRODUCTION. VECTOR ANALYSIS. ELECTROSTATIC FIELDS. Electrostatic fields in vacuum. Conductors in electrostatic fields. Electrostatic fields in dielectric media. Capacitances. Electric energy. STATIONARY FIELDS. Stationary currents. Stationary magnetic fields. QUASI-STATIONARY FIELDS. Basic equations for quasi-stationary fields. Inductances. Magnetic energy. DYNAMIC FIELDS. Maxwell equations and Lorentz potentials. Complex vectors. Poynting theorem. Electric circuits at high frequencies. UNIFORM PLANE ELECTROMAGNETIC WAVES. Uniform plane waves in ideal dielectrics. Uniform plane waves in lossy media. Reflection and refraction. TRANSMISSION LINES. Lines with homogeneous dielectrics. Lines with inhomogeneous dielectrics. Planar lines. Phase and group velocity. Telegraphers' equations. Transients. Multiconductor lines. RADIATION. ELECTROMAGNETIC COMPATIBILITY.

RI3E2 Electronics 2 V: 3+2+1

Frequency response of amplifiers. Large signal amplifiers (classes A, B and AB, efficiency, distortions, stability, negative feedback). Unipolar transistors (physical models, JFET, enhanced and depletion MOSFET). Amplifiers (JFET and MOSFET amplifiers, CMOS amplifiers, characteristic configurations). Rectifiers (half and full-wave rectifiers, capacitor and L filters, regulated power supplies). Linear oscillators (RC: Wien-Bridge oscillator; LC: Colpitts, Hartley and Pirce's oscillator, crystal oscillators).

RI3SAU Automatic control systems VI: 3+2+0

Mathematical models of physical systems. Transfer function concept. Examples of transfer-function representation of electrical circuits, mechanical systems, electro-mechanical control-system devices, synchro generators, and typical control-system components. Feedback control system block diagram. Open-loop and closed-loop system transfer functions. System characteristic equation. Signal-flow diagram and Mason's theorems. Concept of state. State differential equation and output equation. System motion in the state space: evaluation of the transition matrix. Discrete system model: evaluation of system difference equation. Controllability and observability properties. Definition of Liapunov's stability. Algebraic (Routh-Hurwitz) and grapho-analytical (Mikhailov and Nyquist) stability criteria. Control system structure design. System astatism and steady-state accuracy. Constants of position, velocity, and acceleration. Control system transient response specifications in the frequency and time domains. System compensations: cascade, minor feedback loop, feedforward, and compensation with respect to a measured external disturbance. Bode diagram approach. Root locus method for negative- feedback systems. Design of phase-lead, phase-lag, and lead-lag compensators. System design utilizing the Bode-diagram approach. Design utilizing the root loci. Synthesis of multivariable control systems. State feedback and output feedback Quadratic cost function. Parameter optimization. Linear quadratic optimal control by state feedback (Kalman's controller). Pole assignment design by state- and output-feedback. Design of identity observer. Errors and constraints in a observer utilization. Conventional nonlinear industrial two- and three-position controllers. Conventional linear proportional (P), proportional+integral (PI), proportional+integral+derivative (PID) controllers. Choice of linear control law with respect to control system specifications, type of actuator, process dynamics, measuring noise, and properties of an external disturbance. Experimental setting of controller parameter: the Ziegler Nichols procedure. Coupling of more control loops having linear conventional controllers. Introduction to digital control systems. Concept of pulse transfer function. Derivation of system state difference equation. Fundamentals of digital control system design.

RI3SP Data structrures VI: 3+2+0

Introduction. About algorithms and data structures. Linear data structures. Arrays (operations, storing in memory, triangular matrices, and sparse arrays). Lists (operations with singly and doubly linked lists, circular lists, applications). Stacks and queues (operations, sequential and linked representations, applications). Non-linear data structures. Trees: binary trees, topologies and representations, minimisation of internal and external path lengths, tree traversals, threaded binary trees. Graphs: representations, breadth-first and depth-first traversals, spanning trees (Prim, Kruskal), transitive closure (Warshall), shortest paths (Floyd, Dijkstra), flow maximisation (Ford-Fulkerson, matching), topological sorting and critical path finding (CPM). Searching. Basic searching methods (sequential and binary) and their improvements. Binary search tree: inquiry, insertion and deletion, balancing (AVL trees), optimal binary search tree, application (symbol table). m-ary search tree. B,B*, and B+ trees, digital search trees. Hashing - hash functions dependent and independent on key distribution, collision solving using open addressing (linear, quadratic, double hashing) and chaining (separate and coalesced), performance of hashing, external hashing (standard, dynamic and extended). Sorting. Internal sorting: comparison sorting insertion methods (direct, Shellsort), selection methods (direct, using trees, Heapsort) and exchange methods (Bubblesort, Quicksort), sorting methods with linear complexity (Radix, counting sort, addressing sort), performances of sorting methods. External sorting: direct merging, natural merging, multiway merging, polyphase merging and cascade merging.