Algorithms for Engineering Informatics
Code | Completion | Credits | Range | Language |
---|---|---|---|---|
2371014 | Z,ZK | 5 | 2P+2C | Czech |
- Course guarantor:
- Lecturer:
- Tutor:
- Supervisor:
- Department of Instrumentation and Control Engineering
- Synopsis:
-
Introduction into algorithms and programming.
Teaching is focused more practically, on the application of algorithms in solving engineering problems. Examples are presented in the language Java.
- Requirements:
-
The course assumes no prior knowledge.
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:
-
For absolute beginners
How computer works
OOP - simplified introduction
Java 1
NetBeans, JavaFX, basic I/O
Basic Syntax: Classes, Data Types, Variables, Operators
Methods
Decision Making, Loops
Loops - for, while and do ... while
Numbers Class
String Class
String & String Buffer Builder Classes
Math class
Recursion
Basic data structures
Queue, stack, heap, Tree
Trees
Terminology . Implementation field , heap, dynamically
Hufmann's tree
Binary trees: search, insertion
AVL trees: search, insertion
2-3-4 trees, 2-3 trees, B-trees, red-black trees
Lists
Linear linked list, inserting nodes in the beginning/end
Inserting the node before the tag. Removing a node.
Special types of lists.
Ssearching
Direct, linear bisection
Hashing method
Sorting
BubbleSort , ShakeSort , ShellSort , InsertSort
QuickSort
Sorting in linear time
CountingSort
BucketSort
Asymmetric ciphers, RSA, MIM attack
Practical use: keys, certificates, signing
- 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:
-
Algorithms at the level of RAD programming languages and object oriented programming.
The goal is to master the practical application of simple algorithms.
- Study materials:
-
Suggested course materials are listed in syllabi that are available????? in the „Thema 01“
- Note:
- Further information:
- No time-table has been prepared for this course
- The course is a part of the following study plans: