Algorithmics

Garant předmětu:

Lecturer:

Tutor:

Supervisor:

Department of Computer Science

Synopsis:

The course is an introduction into basics of algorithmic problem solving using the Java language. Its core are data, their types, expressions, statements (exemplified by those at Java programming language), basics of programming techniques and data abstractions. The course does not involve topics concerning hardware, telecommunications or other programming languages or assemblers.

Requirements:

For assessment: elaboration of a semester work and getting the necessary number of points.

Syllabus of lectures:

1. Algorithms, programs and programming languages

2. Variables, expressions and assignments

3. Control structures

4. Procedures and functions

5. Top-down program design

6. Arrays

7. Classes and object I

8. Files

9. Text files

10. Complexity of algorithms

11. Classes and objects II

12. Linked structures

13. Data abstractions

14. Reserve

Syllabus of tutorials:

1. Computer laboratory usage

2. Data representation

3. Variables, expressions, assignments, input and output

4. Branches

5. Loops

6. Procedures and functions

7. Arrays

8. Strings and another classes

9. Recursion

10. Files

11. Complexity of algorithms

12. Data structures

13. Data structures

14. Reserve

Study Objective:

Study materials:

1. Horton, I.: Beginning Java 2, 2nd edition, Wrox Press Inc, 1999

Note:

Further information:

No time-table has been prepared for this course

The course is a part of the following study plans: