|
|
|
||
Last update: Kubová Petra Ing. (02.01.2018)
|
|
||
Last update: Kubová Petra Ing. (02.01.2018)
Students will be able to: Understand fundamental algorithmics. Use procedural programming skills that are crucial for further studying. |
|
||
Last update: Kubová Petra Ing. (02.01.2018)
R:Brassard, G., Bratley, P. ''Fundamentals of Algorithmics.'' Prentice Hall, 1995. ISBN 0133350681. R:Sedgewick, R. ''Algorithms in C, Parts 1--5.'' Addison Wesley, 2001. ISBN 0201756080. |
|
||
Last update: Kubová Petra Ing. (02.01.2018)
https://edux.fit.cvut.cz/courses/BI-PA1/ (login necessary) |
|
||
Last update: Kubová Petra Ing. (02.01.2018)
1. Algorithm, program, programming languages. Development environments. 2. Variables, assignment statement, input and output for integer data types. 3. Data types for real numbers. Expressions. 4. Control structures, branching, cycles. 5. Functions, input/output parameters. 6. Decomposition of a problem into subproblems, recursion. 7. Arrays, strings. 8. Pointers, dynamic variables. 9. Files. 10. Complexity of algorithms, sorting and searching. 11. Structures, structured files. 12. Linked lists. 13. Modular programming, other features of C.
|
|
||
Last update: Kubová Petra Ing. (02.01.2018)
none |
|
||
Last update: Kubová Petra Ing. (02.01.2018)
žádné |