Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2023/2024

Algorithms for Engineering Informatics

The course is not on the list Without time-table
Code Completion Credits Range Language
2371526 Z,ZK 4 2P+1C Czech
Garant předmětu:
Lecturer:
Tutor:
Supervisor:
Department of Instrumentation and Control Engineering
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:

Big-O notation.

Algorithms with numbers - Cryptography, Universal hashing, Divide-and-conquer algorithms, Recurrence relations, Mergesort, The fast Fourier transform.

Depth-fit search in undirected graph, Depth-fit search in directed graphs, Strongly connected components.

Paths in graphs - Distances, Breadth-first search, Lengths on edges, Dijkstra's algorithm, Priority queue implementations, Shortest paths in the presence of negative edges, Shortest paths in dags.

Greedy algorithms - Minimum spanning trees, Huffman encoding, Horn formulas.

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:
Further information:
No time-table has been prepared for this course
The course is a part of the following study plans:
Data valid to 2024-06-22
Aktualizace výše uvedených informací naleznete na adrese https://bilakniha.cvut.cz/en/predmet1907506.html