Algorithms for Engineering Informatics

Lecturer:

Josef Kokeš (gar.)

Tutor:

Josef Kokeš (gar.), Vladimír Hlaváč

Synopsis:

Basic course of programming.

Basic concepts: algorithm, parallel algorithms, reentrance. Difference between program and process. Structuring of data, 4GL, visual programming aids, RAD (rapid application development). Structured programming: structured statements, structured data types. Language Pascal (Delphi): block and its properties, program, declaration of function and procedures, parameters (incl. functional). Standard procedures and functions. Abstract data types: table, stack, LIFO, list, tree. Binary tree, AVL tree. Abstract operations: search, sort, interpolation, iteration, recursion, backtracking. Can be subscribed together with E371526.

More info on www.fsid.cvut.cz/cz/u12110/aii/

Requirements:

Same as lectures

Syllabus of lectures:

Basic concepts: algorithm, parallel algorithms, reentrance.

Difference between program and process.

Structuring of data, 4GL, visual programming aids.

Structured programming: structured statements, structured data types.

Language Pascal (Delphi): variables and data types

Language Pascal (Delphi): block and its properties, program, declaration of function and procedures, parameters (incl. functional).

Conditions and cycles.

Standard procedures and functions.

Units - standard and user-defined. Nesting.

Abstract data types: table, stack, LIFO, list, tree. Binary tree, AVL tree (2 lectures)

Abstract operations: search, sort, interpolation, iteration, recursion, backtracking (2 lectures)

Syllabus of tutorials:

Introduction into running applications in 308 laboratory, 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 from Delphi applications.

Dynamic data structures: stack, queue, linked list, tree.

Binary tree, AVL tree, B-tree.

Study Objective:

Study materials:

Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms (more versions)

Cantu, Marco: Mastering Delphi 7. Sybex 2003

Note:

Time-table for winter semester 2011/2012:

	06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon
Tue
Fri
Thu	roomT4:C1-308 Hlaváč V. 14:15–15:45 (lecture parallel1 parallel nr.1) Dejvice Laborator K237 - 308roomT4:C1-308 Kokeš J. 16:00–17:30 (lecture parallel1) Dejvice Laborator K237 - 308
Fri

Time-table for summer semester 2011/2012:

	06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon
Tue
Fri
Thu	roomT4:C2-83 Kokeš J. 10:45–12:15 (lecture parallel1) Dejvice výpůjčka FEL D83roomT4:C1-308 Hlaváč V. 12:30–14:00 (lecture parallel1 parallel nr.1) Dejvice Laborator K237 - 308
Fri

The course is a part of the following study plans: