??01 Principles of Programming Languages - ????? ...

Programming exercices. ... Objects and images, the lens equation, sign
conventions, the lensmaker's formula, compound lens system, meniscus. ....
signal transmission systems,channel capasity, digital coding of analog signal,
quantization, ...

Part of the document


?????? ???????????? ??? ???????????????


?01 ????v?? ?

??????? ??????????? ???????. ??????????? ???????, ?????v????, ??????.
?v????????? (????, ?v??????, ???????????? ?v?????????). ???????? ??????????
(??????? ?????????). ????????? (??????? ?????????). ??????? ??????????,
??????v???? ?????????? (??????? v??????????). ?v??????????.


?02 Logic Design

Digital system technology, digital circuits, encoding, Boolean algebra,
logic gates, logic functions, logic circuits and minimization, XOR gates
and their applications (parity circuits, comparators), iterative logic
arrays, combinational circuit analysis and design, arithmetic and logic
circuits (adders, subtracters, ALUs, multipliers), decoders, encoders,
demultiplexers, multiplexers, programmable logic devices (PLA, PAL, ROM),
three-state buffers, latches and flip-flops, parallel and shift registers,
counters and memories RAM. Laboratory: digital design based on various
SSI/MSI devices.


?03 ???????? ???????

??????? ???????: ??????, ??????? ??? ????????????, ??????? ????????????.
?????? ???? ?????????? ?????. ??????, ?????????, ??????. ???v??v??.
????????? ????? (????, ????????, ?v???????? ?????). ?????v??? ??? ???????.
???????? ?v???????: ??????? ??????? ??? ?????????, ??????? ?????. ?????????
??? ?????????????? ??????? (SVD, ???????? ????? Jordan). ?????????
???????????? ??? ???????????????. ???????????, ???????????? ??? ???????????
?????. ??????? ?????.


?04 Introduction to Programming

Introduction (software and hardware). Problem solving techniques.
Algorithms (design and representation of algorithms). Introduction to C.
Decision and loop statements. Functions. Enumerations, arrays (sorting,
merging, searching), structures. Text files. Binary files (merging,
sorting, searching). Introduction to linked lists. Programming exercices.




?05 Introduction to Informatics and Telecommunications

Computers and algorithms, the hierarchy of software-hardware, algorithm
design, computability, correctness and complexity of algorithms, structure
and operation of computing systems, categories of programming languages,
compilers of programming languages, operating systems, artificial
intelligence, social effects of computers. Computer networks. Network
architecture in layers and basic design principles. Methods of data
transfer. Internet technologies. High speed networks, mobile and personal
networks. Signals and systems, time and frequency domain, sampling, signal
and image compression.


?06 ????v?? ??

?v????????? ?????? ??????????, ??????? ?????????, ?????????. ?????? Taylor.
??????????? ?v?????????. ???????? ?v????????? ?? ?????? ??????????.
???????? ????????????. ??????????? ????????????. ???????? ????v????????
????v??? (????????? Stokes, Gauss ??? Green).


?07 ?v????

????????? ??? ?????????. ?????. ???? ??? ?????. ???????????? ??????.
?v?????? ??? ????????????? ???????. ????????. ????????? ??????. ?????
??????v?????? ??????. ??????? ??????v?????? ??????. ???????? ??????.
????????? ??? ????????? ?????? ??????????. ????. ???????????? ????????.
???????, ?????????? ??? ?????. ?v?????? ???? ??? ??????????. ????????
????????. ???? ??? ??????. ????? ??? ?v??v??????? ???. ?v?????? ?v????.
?v???? ?????????? ??? ??????????.


?08 Data Structures

Data Structures Introduction. The Abstract Data Type (ADT). The ADT array,
record, set and string. Stacks, Recursion, Queues, Lists, Trees (binary and
binary search trees), AVL Trees. Graphs. Applications.





?09 Discrete Mathematics

Introduction to set theory, proof methods, basics of enumerative
combinatorics, discrete probability, recurrence relations, introduction to
graph theory, asymptotic complexity, introduction to number theory.



?10 Object-Oriented Programming

Introduction to object oriented programming concepts. The C++ programming
language: basic language constructs, namespaces, overloading, objects and
classes, inheritance and composition, templates, abstract classes,
exception handling, introduction to the standard library. Introduction to
the STL and generic programming. Overview of Java. Other object oriented
programming languages. An introduction to the theory of objects.




?11 ??????????? ??? ????????? ???? ???????????

??????????? ??????? ??? ?? ?????? ?????????, ????? p-n, ??????
(?????v?????, ?????? ?v???????), ?????????? ??????, ?????, Flip-Flop,
Transistor FET, JFET, MOSFET, CMOS ???, ?????????.


?12 Numerical Analysis

Round off error analysis. Numerical solution of nonlinear equations (Fixed
point, Newton-Raphson). Numerical solution of linear systems (Direct
Methods (Gaussian Elimination, Gauss-Jordan), Iterative methods (Jacobi,
Gauss-Seidel, SOR)). Numerical methods for computing eigenvalues and
eigenvectors. Interpolation. Least Squares method. Numerical
Differentiation. Numerical Integration. Numerical solution of ordinary
Differential equations.





?13 Fields and Waves

Electricity: electric charge and potential, capacitors and dielectrics,
current, resistance and electromotive force, continuous current circuits,
moving charges and magnetic field, self inductance and mutual inductance,
alternative current, R-L-C circuits. Electromagnetism: Fields and
Potentials. Flux and Circulation. Maxwell equations. Electromagnetic fields
and sources. Maxwell Integral equations (Ampere, Faraday and Gauss laws).
Wave equation of Electromagnetic field. Phasors. Limit conditions. Poynting
vector. Plane waves. Polarization. Reflection and Diffraction of plane
waves. Radiation. Fundamental Parameters of Antennas. Type of Antennas.
Linear wire antennas. Optics: Light. Speed of light. Index of refraction.
Fermat's principle of least time. Huygen's Construction. Snell's law.
Dispersion of light. Dispersion and refraction examples. Birefringence.
Polarization and polarizers. Malus' law. Brewster's law. Coherence of light
Geometric or ray optics. Laws of reflection and refraction, Total internal
reflection, critical angle. Prisms. Guided waves optics. Fibers. Mirrors.
Planar, concave and convex spherical mirrors, the mirror's equation,
magnification, sign conventions. Lenses. Thin lenses. Paraxial
approximation and ray tracing. Objects and images, the lens equation, sign
conventions, the lensmaker's formula, compound lens system, meniscus.
Optical aberrations, chromatic and monochromatic aberrations. Optical
Instruments. Multiple lenses, the eye, magnifiers, microscopes, telescopes,
the camera. Interference. Constructive and destructive interference. Double
slit. Multiple slits. Single slit with finite width. Diffraction. Near
field (Fresnel) diffraction. Far field (Fraunhofer) diffraction. Bragg's
law. Diffraction grating. Resolution of an aperture and a grating.
Photon, the quantum of light.




?14 ??????????? ??? ???????? ???????????

???????? ???????????. ?????v???? ?????????? ??? ?????????? ???????????.
?v????? ??????????, ?v????????? ????????? ??? ?v???????? ???????????.
???????? ?v???????? ?v????? ??????????. ????? ??? ?????????? ???? ???? ???
?v???? ????????. ??????? ????????? ??? ?v?????? ?????????. ?????????? ??v
??????????? ????v ??? ??? ????????? ???? ??? ??? ????????? ?v??? ??? ???
???????? ????????. ???????? ?????????? ??? ??????? ??????????? v????????.


?15 Computer Architecture ?

Technology, performance and cost of computer systems, fundamental
instruction set architectures, operands, memory organization (big endian,
little endian and address alignment), addressing modes, instruction set
encoding, operation-instruction types, levels of instruction
representation, compilation from C language to Assembly and machine
language, stack implementation, RISC and CISC architecture examples, the
MIPS instruction set architecture, simple RISC datapath design, memory
hierarchy, caches, virtual memory, interfacing processors and I/O devices,
busses, interrupts, direct memory access. Laboratory: Assembly language
programming for Intel 80x86 and MIPS (use of the SPIM simulator).




?16 Communication Networks

Introduction to the basic concepts and technologies of communication
networks. Internet: architecture, addresses, routing and transport
protocols. Local area networks: shared-medium multiple-access algorithms,
performance evaluation, technologies, Ethernet. Asynchronous Transfer Mode
(ATM): architecture, routing, end-to-end services. Data link layer and
retransmission protocols. Congestion control and flow control mechanisms in
the Internet. Methods for performance evaluation of networks.


?17 Algorithms and Complexity

Efficiency, Analysis and Order. Solving Recurrences. The Master Method.
Heaps and Priority Queues, Binary Trees, Hashing, Union and Find, the
Heapsort Algorithm. Elementary Graph Algorithms, Breadth-First Search,
Depth-First Search, Connected Components. The Divide and Conquer Approach,
Merge Sort, Quick Sort. Greedy Algorithms, Minimum Spanning Trees, Prim's
and Kruskal's Algorithms, Shortest Paths in Graphs, the Fractional Knapsack
Problem, the Activity-Selection Problem. Dynamic Programming, the 0-1
Knapsack Problem. The Backtracking Technique, the n-Queens Problem.
Decision Problems, the classes P and NP. NP-Complete and NP-Hard Problems.




K18 Implementation of Database Management Systems

Introduction to Database Management Systems, differences from File
Management Systems, physical characteristics of external storage units
(mostly disks), data organ