|
|
|
||
The aim of the subject is to teach students how to solve problems and how to make algorithms for it. At first, students learn properties of algorithms. Afterwards, students learn to create typical algorithms such as conditional branched and cyclic algorithms at solving typical examples in programming system Matlab.
Last update: TAJ445 (22.08.2013)
|
|
||
Students will be able to develop programs of middle difficulty in Matlab. At developing algorithms they use principles of good programming practice. Last update: TAJ445 (22.08.2013)
|
|
||
Aktivní účast na seminářích, absolvování závěrečného testu. Last update: POZIVILJ (14.11.2012)
|
|
||
R:Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein (2009). Introduction To Algorithms, Third Edition. MIT Press. ISBN 978-0262033848. R:Knuth, Donald (1997). Fundamental Algorithms, Third Edition. Reading, Massachusetts: Addison-Wesley. ISBN 0-201-89683-4. Last update: Fialová Jana (30.09.2013)
|
|
||
viz Zátěž studenta Last update: POZIVILJ (14.11.2012)
|
|
||
Sestavení algoritmu střední obtížnosti a jeho realizace v programovacím systému Matlab. Last update: POZIVILJ (14.11.2012)
|
|
||
1. MATLAB programming environment, dialogue mode, programming mode, m-editor. 2. Aritmethic and logical operators, vector and matrix operations, functions. , 3. User functions developing, arithmetic assignement, linear algorithms. 4. Algorithm: definition, time and memory complexity, NP-complete problems. 5. Branched algorithms development, conditional statesments. 6. Cycle algorithms with predetermined number of cycles. 7. Cyclic conditional controlled algorithms. Iterative computational methods. 8. Nonlinear equations solving, Newton method, fzero function. 9. Programmable modules, parameters transmission, feval function. 10. Work with data files, import from table calculator, system client-server. 11. Object oriented programming: class, object, property, encapsulation. 12. Object oriented programming: inheritence, polymorphism, overlay of operators and methods, constructor, destructor. 13. Symbolic computing: sense, principles, realization. 14. Symbolic solving of nonlinear equations and differential equations. Last update: Fialová Jana (30.09.2013)
|
|
||
Algorithms Course Materials. Jeff Erickson. University of Illinois Last update: TAJ445 (22.08.2013)
|
|
||
Základy ovládání osobního počítače. Last update: POZIVILJ (08.11.2012)
|
|
||
none Last update: TAJ445 (22.08.2013)
|
Teaching methods | ||||
Activity | Credits | Hours | ||
Příprava na přednášky, semináře, laboratoře, exkurzi nebo praxi | 1 | 28 | ||
Účast na seminářích | 1 | 28 | ||
2 / 2 | 56 / 56 |
Coursework assessment | |
Form | Significance |
Regular attendance | 50 |
Continuous assessment of study performance and course -credit tests | 50 |