translated by Google

Bachelor SZZ

For each question, there are also codes of subjects that cover the issue (this is only an indicative list).

Theoretical Foundations of Informatics and Mathematics

  1. Sets, Sessions, and Impressions
    Basic set operations. Sessions and their properties - equivalence and decomposition, arrangement and ordered set. Sitting, display (injection, surjection, bijection).
    IB000, MB101 / MB201
  2. Elementary Number Theory
    Divisibility, Euclidean algorithm, modular operations, prime numbers and their testing, number theory (RSA, DSA, linear and polynomial codes).
    MB104 / MB204
  3. Logic
    Pronounced and predicate logic, operations, quantifiers, syntax. Semantics, truthfulness, feasibility, demonstrability. Normal forms of formulas (conjunctive and disjunctive, prenexic, Horne clauses).
    IB000, IB101
  4. Linear Algebra I
    Operations with vectors and matrices, properties of linear operations and scalar product, solving of systems of linear equations. Gaussian elimination, determinant.
    MB101 / MB201
  5. Linear Algebra II
    Own numbers and vectors, their geometric meaning, inverse matrices, vector subspaces, vector bases. Affine objects, affine transformations.
    MB101 / MB201
  6. Combinatorics and probability
    Elementary combinatorics (combinations, permutations, variations), solving simple combinatorial problems. Probability, conditional probability (Bayes' theorem).
    MB101 / MB201, MB103 / MB203
  7. Statistics
    Descriptive statistics, mean value, median, scattering, correlation. Estimates of statistics and their reliability. Distribution functions, distribution of random variables and their examples.
    MB103 / MB203
  8. Mathematical analysis
    Properties of real functions, polynomials, continuous functions and limits, derivation, indeterminate and certain integral, geometric meaning. Differential equations and their meaning.
    MB102 / MB202, MB103 / MB203
  9. Graphs
    Graph types, trees, peaks, graphs, graph representations. Algorithms for scanning depth and width of a graph and their use. Components of context.
    IB000, IB002
  10. Graphic problems
    Rated charts, shortest path definitions, minimum chart skewers, algorithms for finding the shortest paths (Dijkstrums, Bellman-Ford's algorithm), and minimal skeletons in a graph.
    IB000, IB002
  11. Formal Languages ​​I
    Chomish hierarchy of formal languages. Regular languages, their representations and transfers between them. Variants of finite automata. Nedeterminism and automation determinations. Closing properties of regular languages.
    IB102 / IB005
  12. Formal Languages ​​II
    Contextual languages ​​and their representations. Variants of slot machines (acceptance methods, determinism and non-determinism, extended storage automata). Non-deterministic syntactic analysis. Closure properties of context-free languages.
    IB102 / IB005
  13. Computability
    Turing machine. Stop problem. Decision-making and partial decision-making, indecisiveness. Method of reduction, diagonalization.
    IB102 / IB005 + IB107
  14. Correctness and complexity of the algorithm
    Partial and total correctness, proof of correctness. Asymptotic complexity, O-notation. Reasoning for the correctness and complexity of basic algorithms (eg, shift algorithms, binary search).
    IB002, IB102 / IB107
  15. Complexity
    The complexity of the algorithm vs. the complexity of the problem. Complexity classes (P, NP, PSPACE) and relationships between them, examples of problems from individual classes. The difficulty and completeness of a problem in a given class, polynomial problem-reduction, NP-complete tasks.
    IB102 / IB107
  16. Basic data structures.
    Basic abstract data structures (list, set, stack, queue), related operations and their complexity. Typical implementations, examples of use.
    IB111, IB002
  17. Tree-based data structures
    Tree data structures (binary search trees, B-trees, red-black trees, heaps), related operations and their complexity. Typical implementations, examples of use.
  18. Recursive algorithms
    Method to divide and dominate, advantages and disadvantages of recursion, removal of recursion. Explanation of principles and implementation of recursive algorithms. Relationship between recursion and mathematical induction.
    IB002, IB015
  19. Functional programming
    Functional programming paradigm (principle of calculation, reduction step, reduction strategies and their properties, examples). Higher order functions and their use. Lambda functions. Elementary programming ability in Haskell.
  20. Logic programming
    Logical programming paradigm (principle of calculation, unification, computational trees, queries, free variables). The ability of elementary programming in Prolog.
    IB015, IB101

Programming, computing and information systems

  1. Programming languages
    Data and control structures of programming languages, data types. Compilation, interpretation.
    IB111, PB071, PB161 / PB162
  2. Object Oriented Programming I
    Encapsulation, inheritance, polymorphism. Implementation of the PPE principles in C ++ or Java (customized).
    PB161 / PB162
  3. Object-oriented programming II
    Object programming in imperative language, object collaboration, event driven programming, exceptions. Implementation of the PPE principles in C ++ or Java (customized).
    PB161 / PB162
  4. Basic Computer Principles I
    Numerical systems, relations between numerical systems, display of numbers in computer, principles of arithmetic operations.
    PB150 / PB151
  5. Basic Computer Principles II
    Combination and sequential logic circuits. Von Neumann architecture. Principles of processor work, interrupt.
    PB150 / PB151
  6. Operating system
    Operating system architectures, application programming interfaces for operating systems. Peripherals, their administration, drivers. Processes and threads, process and thread synchronization.
    PB152 / PB153
  7. Process planning
    The nature and objectives of task planning in operating systems. Implementation of processor activity planning. Tackle, Tackle Conditions, and Tack Protection Methods.
    PB152 / PB153
  8. Working with memory
    Memory hierarchy. Work with memory, logical and physical address space, memory management, memory virtualization, segmentation, paging.
    PB152 / PB153
  9. Database I
    Relational Data Model, Relational Scheme, Relational Scheme Keys, Relational Algebra (Projection, Selection, Aggregation, Renaming), Relationship Session.
  10. Database II
    Functional dependencies, normal forms (1NF, 2NF, 3NF, Boyce-Coddova NF), relationships between normal forms. Relational scheme decomposition, schema standardization.
  11. SQL.
    Syntax and command semantics. Commands for querying and updating data, aggregation functions, triggers, and stored procedures. Data definition commands, integrity constraints.
  12. Transactions and query processing
    Transaction processing, its properties. Basic principles of query evaluation (cost of query evaluation, indexing and hash usage).
  13. Computer Networks I
    Computer Network Layer Models (ISO / OSI, TCP / IP): Layer Functionality and Co-ordination, Addressing. Physical layer, signals and their encoding, media access control.
  14. Computer Networks II
    Connecting computer networks. Network protocols, switching and routing, multicast. Assured data transfer, assembly and termination of the connection. Transport Protocols.
  15. Network applications and security I
    Basic application protocols: mail delivery, file transfer, web, name service. Principles of description and quality of service, use for multimedia.
  16. Network applications and security II
    Secure network communication, authentication and encryption, security on individual protocol layers.
  17. Software Engineering I
    SW lifecycle and related activities. Requirements specifications and their types. Structured vs. object-oriented methods of analysis and design.
  18. Software Engineering II
    Testing, verification and validation. Operation, maintenance and further development of the system. UML role in support of SW analysis and design.
  19. Data modeling
    Design of data structures, graphical representation, transfer to relational model. ER diagram (entities, attributes, relationships), UML diagram of classes and their comparison.