Algorithms for Engineering Informatics
Code  Completion  Credits  Range  Language 

E371014  Z,ZK  5  2P+2C  English 
 Garant předmětu:
 Lecturer:
 Tutor:
 Supervisor:
 Department of Instrumentation and Control Engineering
 Synopsis:

Basic introduction into Java (tasks can be solved in any language; Pascal/Delphi course alternatively for who is interested). Algorithms with numbers  divideandconquer algorithms, recurrence relations, the fast Fourier transform. BigO notation. Sorting algorithms  bubble sort, insert sort, selection sort, heap sort, quick sort, mergesort. Graphs  depthfirst search in undirected graph, depthfirst search in directed graphs, strongly connected components. Paths in graphs  distances, breadthfirst 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.
 Requirements:

The course strongly assumes prior knowledge of programming.
For the Exams: knowledge prescribed in lectures. The exam has a practical and oral parts. The practical part of the exam  write and debug a simple program on given task.
For Assessment, the student receies three tasks to program.
 Syllabus of lectures:

Introduction into Java programming (all examples in Java).
Theory of algorithms. Complexity of algorithms. BigO notation.
Mathematical algorithms  multiplication of two matrices, the greatest common divisor, the least common multiple ( LCM ) , Euclid's algorithm.
Factorial, recursion, factorization.
Divideandconquer algorithms, recurrence relations, the fast Fourier transform.
Sorting algorithms  bubble sort, combo sort, insert sort, selection sort, heap sort, quick sort, mergesort. Counting sort.
Data structures, linked lists (stack, circular queue), trees (binary, AVL, redblack; Btrees).
Graphs and graph algorithms  terminology, notation , theory, breadthfirst search (BFS), depthfirst search (DFS), minimum spanning tree.
Paths in graphs  distances, breadthfirst search, lengths on edges, Dijkstra's algorithm, priority queue implementations, shortest paths in the presence of negative edges, shortest paths in dags (directed acyclic graphs). Greedy algorithms  minimum spanning trees, Huffman encoding, Horn formulas.
Cryptography  historical ciphers, search primes, factorization, symmetric ciphers.
 Syllabus of tutorials:

Introduction into running applications in 308 laboratory, students' accounts.
Simple application. Constants. Simple types, structured types incl. arrays, records, sets, files. Variables. Basics of programming language.
Sorting. Handling events and exceptions.
Printing from Java applications, I/O operations.
Dynamic data structures: stack, queue, linked list, tree.
Binary tree, AVL tree, Btree.
Graph algorithms.
Each student will be submitted 3 practical excercises to solve, in the range of lectures. Their solutions will create part of the final classification.
 Study Objective:

This subject introduces advanced programming skills and algorithms.
Teaching is focused more practically, on the application of algorithms in solving engineering problems. Examples are presented in the language Java.
 Study materials:

Study materials including lecture slides and preparations are provided by lecturer.
 Note:
 Further information:
 ???? katedrální stránka předmětu http://www.compileonline.com
 No timetable has been prepared for this course
 The course is a part of the following study plans: