Algorithms for Engineering Informatics
Kód | Zakončení | Kredity | Rozsah | Jazyk výuky |
---|---|---|---|---|
E371014 | Z,ZK | 5 | 2+2 |
- Přednášející:
- Josef Kokeš (gar.)
- Cvičící:
- Josef Kokeš (gar.), Vladimír Hlaváč
- Anotace:
-
Basic course of programming.
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): 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.
More info on www.fsid.cvut.cz/cz/u12110/aii/
- Požadavky:
-
Same as lectures
- Osnova přednášek:
-
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)
- Osnova cvičení:
-
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.
- Cíle studia:
- Studijní materiály:
-
1. Kokeš, Josef: Algoritmy pro inženýrskou informatiku. Skriptum ČVUT, 2006
2. Wirth, N.: Algoritmy a struktúry údajov, ALFA, Bratislava 1981.
3. Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms (standardní VŠ učebnice v USA, vyšla ve 45 vydáních)
4. Wroblewski, Piotr: Algoritmy. Computer Press, Brno, 2004
5. Cantu, Marco: Mastering Delphi 7. Sybex 2003 (1011 pages) - existuje též český překlad Mistrovství v Delphi (Grada)
6. Lischner, Ray: Delphi in a Nutshell. O'Reilly, 2002
7. Borland: Delphi Developer's Guide. Borland Software Corporation, CA, USA
8. Šindelář, Jan: Tipy a triky v Delphi. Webový kurs na stránkách www.zive.cz
9. Kadlec, Václav: Umíme to s Delphi. Webový kurs na stránkách www.zive.cz
- Poznámka:
- Rozvrh na zimní semestr 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
Po Út St Čt Pá - Rozvrh na letní semestr 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
Po Út St Čt Pá - Předmět je součástí následujících studijních plánů: