OT3SAO - Complexity of Algorithms and Selected Methods of Optimization

Course specification
Course title Complexity of Algorithms and Selected Methods of Optimization
Acronym OT3SAO
Study programme Electrical Engineering and Computing
Module Telecommunications and Information Technologies
Type of study bachelor academic studies
Lecturer (for classes)
Lecturer/Associate (for practice)
    Lecturer/Associate (for OTC)
    ESPB 3.0 Status elective
    Condition Mathematics 1 (OO1MM1), Mathematics 2 (OO1MM2)
    The goal Basic concepts and algorithms of combinatorial optimization will be useful in treating some problems in telecommunication. Finite fields prepare the student for coding theory.
    The outcome Students get a mathematical basis and also practical hints in treating problems of combinatorial optimization, as well as appropriate mathematical basis for coding theory.
    Contents of lectures Turing machine, the definition of the complexity of algorithms. Problem classes P and NP. Traveling problem salesman, huristic approaches. Network optimization: Minimal spanning network. Extremal paths. Maximal network flows. Finite fields: Existence and construction. Multiplication group. Primitive polynomial, the method of calculating of the minimal polynomials. Applications to coding theory.
    Contents of exercises Through examples, tasks and problems student learns how to apply theorems and basic concepts that are learnt through theoretical contents. Especially students are prepared how to solve problems that are occurring in Telecomunacitions.
    1. D. Cvetković, S. Simić: Odabrana poglavlja iz diskretne matematike, Akademska misao, Beograd 2004. (Original title)
    Number of hours per week during the semester/trimester/year
    Lectures Exercises OTC Study and Research Other classes
    1 1 0.5
    Methods of teaching Combination of traditional presentation on blackboard, slides, free mathematical software (SAGE, GeoGebra,…) communication with students through internet and individual work with students while working on home work tasks, and explanation of current topics.
    Knowledge score (maximum points 100)
    Pre obligations Points Final exam Points
    Activites during lectures 25 Test paper 50
    Practical lessons 0 Oral examination 0
    Projects 0
    Colloquia 25
    Seminars 0