Java Programming (E371530)
| Departments: | ústav přístrojové a řídící techniky (12110) |
| Abbreviation: | | Approved: | 03.01.2013 |
| Valid until: | ?? | Range: | 3P+2C |
| Semestr: | * | Credits: | 5 |
| Completion: | Z,ZK | Language: | EN |
Annotation
The Java language: structure of a program, declaration of function and procedures, parameters (incl. functional). Standard procedures and functions. Structured programming: structured statements, structured data types. Abstract data types: table, stack, LIFO, list, tree. Binary tree, AVL tree. Abstract operations: search, sort, interpolation, iteration, recursion, backtracking. Basic sorting algorithms. Dynamic variables - records, dynamic data structures. Single and double linked lists, trees.
Teacher's
Ing. Vladimír Hlaváč Ph.D.
Letní 2022/2023
Ing. Vladimír Hlaváč Ph.D.
Zimní 2022/2023
Ing. Vladimír Hlaváč Ph.D.
Letní 2021/2022
doc. Ing. Josef Kokeš CSc.
Zimní 2021/2022
doc. Ing. Josef Kokeš CSc.
Letní 2020/2021
doc. Ing. Josef Kokeš CSc.
Zimní 2020/2021
Structure
NetBeans (NetBeans.org), JavaFX. Basic syntax: Classes, data types, variables, operators, methods.
Statements, assignments, conditional statements, loops, case.
Numbers class, string class, string buffer & string builder classes.
Math class, recursion, date & time. Regular expressions.
Streams, files and I/O, Exceptions handling.
Record, set, file-of-byte, text files use.
Procedures, functions, formal parameters declaration.
Standard features of Java (NetBeans.org).
Algorithms: Data structures - queue (FIFO), stack (LIFO), the circular queue.
Abstract operations: search, sort, interpolation, iteration, recursion, backtracking.
Basic sorting algorithms.
Dynamic variables - declaration and returning the memory. Fragmentation, the garbage collector.
Records, dynamic data structures. Single and double linked list.
Trees, binary trees, B-trees, AVL tree, rotations.
Structure of tutorial
Introduction into running applications in computer classroom, students' accounts, students will be submitted 3 practical excercises to solve.
Simple application. Constants. Simple types, structured types incl. arrays, records, sets, files. Variables. Basics of programming language.
Sorting. Handling events (OnMouse.., Timer]. Using components, their fields (Canvas) and attributes (writing and painting on Canvas).
Printing and I/O functions.
Dynamic data structures: stack, queue, linked list, tree.
Binary tree, AVL tree, B-tree.
Literarture
D. S. Malik,Robert P. Burton: Java Programming: Guided Learning With Early Objects. Course Technology, 2009.
Wirth, N.: Algorithms and data structures. Prentice-Hall, 1986.
Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms.
Requirements
ask lecturer
čs
en