|
Lecturer(s)
|
-
Vitvarová Jana, Ing. Ph.D.
-
Královcová Jiřina, doc. Ing. Ph.D.
|
|
Course content
|
Lectures 1. Algorithm, program, programming language. Structure of program. Basic elements. Syntax and semantics. Lexical elements. 2. Algorithm. Formal description. Way of algorithms formal description. Diagram, pseudocode, structure text. 3. Data type. Primitive and structured data types. Data representation in the program memmory. Computer numbering formats 4. Variables and constants, their declarations. Primitive dada types. Type's compatibility. Operators, expressions, operation priority. Standard/console input/output. 5. Class as object type. Classes, objects. Attributes, methods. Methods parameters. Static and instance methods. Library class. Wrapping classes. Loops. Basic iteration algorithms. 6. Statements. Simple statements, if, loops. 7. Some other statements. Use cases. Program debugging. 8. Sequence data processing. Primitive algorithms. Initialisation of the algorithms. 9. Array structures - declaration, reading, treatment, basic algorithms, method parameters of array type. 10. Algorithms for maintaining multiple arrays. 11. Text strings. Class String. 12. Sorting and searching - realisation and comparison of several algorithms. 13. Text files - reading and writing data. Opening, closing files. 14. Selected classes - arrays, ArrayList, LinkedList. Practice 1. Java environment. Program structure. Syntax and semantics. Console input and output. 2. Basics. Integrated development environment. 3. Variables. Boolean type, char type - constant values, standard operations, standard functions. 4. Numeral systems. 6. Decision and branching. 7. Algorithms development. 8. Loops. 9. Sequence data processing. 10. Primitive data arrays treatment. 11. Multiple arrays.. 12. Text strings. 13. Text files. 14. Test.
|
|
Learning activities and teaching methods
|
|
Monological explanation (lecture, presentation,briefing), Practicum
|
|
Learning outcomes
|
The course is an introduction to the computer programming. Students learn methods of development and realization of algorithms focused on maintaining numbers, number sequences a text. The programming language Java is used.
Students will acquire the basic concepts of algorithm development and realization of algorithms focused on maintaining numbers, number sequences, and texts in programming language Java.
|
|
Prerequisites
|
Unspecified
|
|
Assessment methods and criteria
|
Combined examination
Participation on seminars. Realization of individual tasks. Credit tests. Pass exam.
|
|
Recommended literature
|
-
CORMEN, T. H. Introduction to algorithms. 3rd ed.. Cambridge, Mass.: MIT Press, 2009. ISBN 978-02-6203-384-8.
-
HEROUT, P. Java - bohatství knihoven. České Budějovice, 2006. ISBN 80-7232-288-5.
-
HEROUT, P. Učebnice jazyka Java. Kopp, České Budějovice., 2003.
-
SCHILDT, H. Java 7: výukový kurz. Computer Press, Brno, 2008. ISBN 978-80-251-3748-2.
|