|
Lecturer(s)
|
-
Královcová Jiřina, doc. Ing. Ph.D.
|
|
Course content
|
Lectures 1. Development platform.Structure of program. Basic elements. Variables, constants, types. 2. Development platform. Basic actions. Standard input and output. 3. Evaluation of real expressions. Evaluation of integer expressions. 4. Logical statements. Boolean expressions. Decision algorithms. Decision trees. 5. Loops. Basic iteration algorithms. 6. Maintaining number sequences without their saving in array structures. 7. More complex algorithms with decisions and iterations. 8. Class methods, code structure, parameters of methods. 9. Array structures - reading, maintaining, basic algorithms, methods. 10. Sorting - realisation and comparison of several algorithms. 11. Searching - realisation and comparison of several algorithms. 12. Algorithms for maintaining multiple arrays. 13.-14. Recursive methods. Practice 1. Console input and output. 2. Number types - constant values, operations, standard functions. Operator priorities. Expressions. Random numbers. 3. Boolean type, char type - constant values, standard operations, standard functions. 4. Logical statements. Boolean expressions. 5. Loop statements. 6.-7. Algorithms development. 8. Object programming. Class type. Methods of class. Parameters of methods. 9. Arrays, arrays maintaining, basic algorithms. 10. Sorting. 11. Searching. 12. Multidimensional arrays. 13.-14. Recursion and its usage.
|
|
Learning activities and teaching methods
|
Monological explanation (lecture, presentation,briefing), Working activities (workshops)
- Class attendance
- 56 hours per semester
|
|
Learning outcomes
|
The course is an introduction to the computer programming. Students learn methods of development and realisation of algorithms focused on maintaining numbers and number sequences. The programming language Java is used.
Students will acquire the basic concepts of algorithm development and realization of algorithms focused on maintaining numbers and number sequences in programming language Java.
|
|
Prerequisites
|
Unspecified
|
|
Assessment methods and criteria
|
Combined examination, Oral exam, Written exam
Participation on seminars. Realisation of requested tasks. Pass exam.
|
|
Recommended literature
|
-
Cormen, T. H. Introduction to algorithms. The MIT Press, Cambridge, Massachusetts, 2001.
-
HEROUT, P. Učebnice jazyka Java. Kopp, České Budějovice, 2003.
-
Sedgewick, R. Algoritmy v C. SoftPress, 2003.
-
Sharon Zakhour. Java 6, Výukový kurz. Brno, 2006. ISBN 978-80-251-1.
-
WRÓBLEWSKI, P. Algoritmy datové struktury a programovací techniky. Computer Press, Brno, 2004.
|