Algorithms for Engineering Informatics
| Code | Completion | Credits | Range | Language |
|---|---|---|---|---|
| 2371525 | Z,ZK | 5 | 3+2 | Czech |
- Lecturer:
- Josef Kokeš
- Tutor:
- Vladimír Hlaváč
- Synopsis:
-
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.
- Requirements:
-
ask lecturer
- Syllabus of lectures:
-
The principle of operation of the computer, the internal structure of the processor, memory, program.
Procedure calls, branching, cycle, stack.
von Neumann, Harvard, multiprocessor systems, RISC.
Programming languages, interpreter, compiler, object-oriented approach, 4GL.
Local computer networks, principles, topologies.
Fundamentals of Pascal, structure, types of variables, constants definition.
Record, set, file-of-byte, text files use.
Statements, assignments, conditional statements, loops, case.
Procedures, functions, formal parameters declaration.
Standard features of Pascal, Borland Pascal extensions.
Algorithms: Data Structures - queue (FIFO), stack (LIFO), the circular queue.
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.
- 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:
-
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.
- Study materials:
-
Kokeš, Josef: Algoritmy pro inženýrskou informatiku. Vyd. ČVUT, 2006, Wirth, N.: Algoritmy a struktúry údajov, ALFA, Bratislava 1981., Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms (standardní VŠ učebnice v USA), 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
- Note:
- Time-table for winter semester 2011/2012:
- Time-table is not available yet
- 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 Fri - The course is a part of the following study plans: