translated by Google

Machine-translated page for increased accessibility for English questioners.

IVV Questions

Minor Study Plan

Theoretical foundations of informatics

  1. Propositional logic. Syntax, semantics, derivation system of propositional logic, proofs in propositional logic, truthfulness and provability of logic formulas. (IB000)
  2. Functions and recursion. Recursive function definitions, recursive data types (lists, trees), functions over recursive data types. (IB114)
  3. Data structures and their implementation. Abstract data types: list, array, stack, queue, binary tree, generic tree, search tree. Implementation of binary and search trees and operations over them. (IB113, IB114)
  4. Graphs. Graph types, trees, vertices, oriented graphs, graph representation. Depth and width graph search algorithms and their use. Context components. (IB114)
  5. Sorting. Basic algorithms, algorithms for sorting by heap, merging, splitting. (IB114)
  6. Regular languages. Regular languages, regular grammars, regular expressions, finite automata. Properties of regular languages, relation between finite automata and regular grammars. (IB110)
  7. Finite automata. Definition, finite automaton construction, finite automaton minimization, nondeterministic finite automaton to deterministic automaton. (IB110)
  8. Computability. Turing machine as a universal computational model. Stop problem. Decidability and partial decidability, undecidability. Diagonalization. (IB110)
  9. Complexity. Complexity of algorithm versus problem complexity. Complexity classes (P, NP, PSPACE) and relations between them, examples of problems from individual classes. Difficulty and completeness of the problem in a given class, polynomial reduction of problems, NP-complete problems. (IB110)
Program, computing and information systems

  1. Computational systems I. Numerical systems, relations between systems, display of integer in computer, arithmetic. Codes, internal, external, detection and correction. Processors, their parameters and architectures. (PB150)
  2. Programming. Structured programming in imperative language, data and control structures of programming languages, data types, procedures and functions, block and modular structure of a program. (IB113).
  3. Operating system. Operating system architectures, operating system interfaces. Processes, process synchronization, deadlocks, and deadlock protection methods. Working with memory, logical and physical address space, memory management and its execution. Planning on operating systems. (PB153)
  4. Computer networks. Topology, access methods and computer network architectures (Ethernet, Fast Ethernet, Token-ring, ATM, etc.). Wireless communication technology. OSI model. TCP / IP. Interconnection of computer networks and routing of information. (PB156)
  5. Database I. Relational model, relational scheme, relational schema keys, integrity constraints, relational algebra, relation joining. (PB168)
  6. Database II. SQL Query Language (select statement, relation join, aggregate function). Query Processing. Basic principles, example. Indexing. Transaction. Transaction processing properties.
  7. Software Engineering. Software development. Requirements specification, system analysis and design, testing, verification and validation, system operation. UML usage in software development. (PB007)