Translations of this page:

Topics of Master SFE valid for the SFE held in summer semester of the academic year 2016/2017 and the winter semester of the academic year 2017/2018

The exam based on SFE topics consists from two questions, one is based on SFE topics from compulsory courses of the degree study programme and the second one is based on SFE topics from the branch of study.

The question shall start with a copy of the topics as can be seen here. The question can be extended or clarified by the committee for the SFE.

Column Subject refers to the main subject of the topic, but the topic can also be found in other subjects.

Topics from the branch of study

Topics from compulsory courses

# Label Topic Subject
1. TO-MIE-SPOL-1 Group theory: Groupoids, semigroups, monoids, and groups. Subgroups, cyclic groups and their generators. MIE-MPI
2. TO-MIE-SPOL-2 Fields and rings: Basic definitions and properties. Finite fileds. Rings of polynomials, irreducible polynomials. MIE-MPI
3. TO-MIE-SPOL-3 Multivariable functions: gradient, Hessian matrix, positive- and negative-(semi)definite and indefinite matrices. Extremal values and optimization. MIE-MPI
4. TO-MIE-SPOL-4 Integration of multivariable functions. MIE-MPI
5. TO-MIE-SPOL-5 PRAM models and algorithms. MIE-PAR
6. TO-MIE-SPOL-6 Direct orthogonal and sparse hypercubic and multistage indirect interconnection networks for parallel computers. MIE-PAR
7. TO-MIE-SPOL-7 Parallel reduction and partallel prefix sum of an array, parallel Euler tour technique. MIE-PAR
8. TO-MIE-SPOL-8 Parallel sorting networks, 0-1 lemma, mesh and hypercubic parallel sorting algorithms. MIE-PAR
9. TO-MIE-SPOL-9 Estimation of parameters of statistical distributions, estimation of the probability density function and the cummulative distribution function. MIE-SPI
10. TO-MIE-SPOL-10 Testing statistical hypotheses about model parameters, t-tests, testing independence, goodness-of-fit tests. MIE-SPI
11. TO-MIE-SPOL-11 Markov chains with discrete and continuous time. Their limit properties. MIE-SPI
12. TO-MIE-SPOL-12 Queueing systems, their limit properties and stationarity. Relationship between Poisson processes and Markov chains. MIE-SPI
13. TO-MIE-SPOL-13 Importance of NP and NPH classes in practical computation. MIE-PAA
14. TO-MIE-SPOL-14 Experimental evaluation of algorithms, especially randomized ones. MIE-PAA
15. TO-MIE-SPOL-15 Principle of local heuristics, the concept of local/global optima, techniques to avoid local optima. MIE-PAA
16. TO-MIE-SPOL-16 Principle of genetic algorithms, importance of selection presure for their functionality. Controlling the selection pressure. MIE-PAA
17. TO-MIE-SPOL-17 Signals, systems, and their properties, automata as representations of systems MIE-TES
18. TO-MIE-SPOL-18 Composition of systems and automata (both discrete and continuous), synchronous reactive models MIE-TES
19. TO-MIE-SPOL-19 Classification of system verification methods (testing, bounded model checking, unbounded model checking). MIE-TES
20. TO-MIE-SPOL-20 Boolean satisfiability: algorithms and their usage in bounded model checking MIE-TES
 
/mnt/www/edux/data/pages/en/szz/mi/2016-17.txt · Last modified: 2018/06/21 09:51 by balikm
 
Recent changes RSS feed Powered by PHP Valid XHTML 1.0 Valid CSS Driven by DokuWiki