13E082SAO - Complexity of Algorithms and Selected Methods of Optimization
| Course specification | ||||
|---|---|---|---|---|
| Course title | Complexity of Algorithms and Selected Methods of Optimization | |||
| Acronym | 13E082SAO | |||
| Study programme | Electrical Engineering and Computing | |||
| Module | ||||
| Type of study | bachelor academic studies | |||
| Lecturer (for classes) | ||||
| Lecturer/Associate (for practice) | ||||
| Lecturer/Associate (for OTC) | ||||
| ESPB | 3.0 | Status | elective | |
| Condition | ||||
| The goal | Introducing students to basic concepts of complexity of algorithms and selected methods of optimization will be useful for some topics in studies of electrical engineering and computer science, as well as in solving some practical problems of the real world too. | |||
| The outcome | Students get a theoretical basis and also practical hints in treating efficiency of computing. Based on least square methods and elementary graph theory students can identify and solve some basic problems of optimization. | |||
| Contents | ||||
| URL to the subject page | http://optimizacija.etf.rs/ | |||
| URL to lectures | https://teams.microsoft.com/l/team/19%3aEzyieCISPb1gGuv2mTMbbKlZdTWDnBsFjEqWWNos71A1%40thread.tacv2/conversations?groupId=70666838-5e5f-4cf0-908f-cdbb18e3095a&tenantId=1774ef2e-9c62-478a-8d3a-fd2a495547ba | |||
| Contents of lectures | Turing machines,recursive functions, computational complexity in mathematics, various examples. A brief overview of the theory of pseudo-inverse matrices and its application. Selected methods of the optimization. Discrete least squares method and applications. Linear programming. Combinatorial enumerations and optimizations in the graph 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 vocational electrotechnical subjects. | |||
| Literature | ||||
| ||||
| 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. Working with small student's groups on the program realization of class material. | |||
| Knowledge score (maximum points 100) | ||||
| Pre obligations | Points | Final exam | Points | |
| Activites during lectures | 20 | Test paper | 40 | |
| Practical lessons | 0 | Oral examination | 0 | |
| Projects | 40 | |||
| Colloquia | 0 | |||
| Seminars | 0 | |||