| Course Unit Code | 352-0501/01 |
|---|
| Number of ECTS Credits Allocated | 4 ECTS credits |
|---|
| Type of Course Unit * | Compulsory |
|---|
| Level of Course Unit * | Second Cycle |
|---|
| Year of Study * | First Year |
|---|
| Semester when the Course Unit is delivered | Winter Semester |
|---|
| Mode of Delivery | Face-to-face |
|---|
| Language of Instruction | Czech |
|---|
| Prerequisites and Co-Requisites | There are no prerequisites or co-requisites for this course unit |
|---|
| Name of Lecturer(s) | Personal ID | Name |
|---|
| BAB75 | doc. Ing. Marek Babiuch, Ph.D. |
| Summary |
|---|
| Subject Applied Informatics is a fundamental subjects that shape the profile of graduates in the field of Information technology. Its aim is to familiarize students with the procedures of algorithms and data structures, problem solving, etc. Information obtained in this subject is the basis for the realization of applications in the related subjects of study. |
| Learning Outcomes of the Course Unit |
|---|
Students are able to explain the basic concepts of information theory, coding and cryptography. Students are able to describe basic algorithms for data retrieval and sorting and explain their time complexity.
In database systems they are able to formulate SQL queries and work with databases from a specific programming language. They also know XML, validate XML documents and query XML data. They have an overview of markup languages, scripting languages and javascript. |
| Course Contents |
|---|
1. Introduction to subject content, credit system requirements. Creating algorithms and their characterization, evaluation of algorithms.
2. The encoding properties of codes, shortest length codes, constant change codes (Gray code).
3. Monitoring and self-correcting codes (linear codes, Hamming codes, cyclic codes).
4. Data encryption. Simple and complex data types, program structures, data transfer.
5. Algorithms for searching and sorting files in memory, files with many different elements. Evaluation of algorithms and their performance.
6. External sorting algorithms, sorting combining external files using memory.
7. Dynamic data structures. Linear lists, implementation of stack and queue.
8. Dynamic data structures. Binary trees, search trees.
9. Dynamic data structures. Balancrd trees, optimal trees. B-trees and their use in creating indexes.
10. Solving problems using tree structures. Searching algorithms, heuristic algorithms. Genetic algorithms.
11. Multi-criteria analysis.
12. Data compression, application of algorithms for searching and sorting,
lossless algorithms, the use of hashing.
13. Data compression, loss-making algorithms. |
| Recommended or Required Reading |
|---|
| Required Reading: |
|---|
BABIUCH, M. Sylaby k předmětu Aplikovaná informatika. Ostrava: VŠB-TU Ostrava, 2019. Dostupný ze systému LMS. URL: http://www.lms.vsb.cz.
FARANA, R. Metody kódování, šifrování a bezpečnosti dat. 1. vyd. Ostrava 2013. 156 s. ISBN 80-7078-398-2.
FARANA R. Kapitoly ze základů informatiky. Ostrava : VŠB - Technická univerzita Ostrava, 2003, 106 s. ISBN: 80-248-0265-1.
ZURAWSKI, R. The Industrial Information Technology Hanbook. Danvers, MA, U.S.A.: CRC Press LLC, 2005. ISBN 0-8493-1985-4. |
BABIUCH, M. Sylaby k předmětu Aplikovaná informatika. Ostrava: VŠB-TU Ostrava, 2019. Dostupný ze systému LMS. URL: http://www.lms.vsb.cz.
FARANA, R. Metody kódování, šifrování a bezpečnosti dat. 1. vyd. Ostrava 2013. 156 s. ISBN 80-7078-398-2.
FARANA R. Kapitoly ze základů informatiky. Ostrava : VŠB - Technická univerzita Ostrava, 2003, 106 s. ISBN: 80-248-0265-1.
ZURAWSKI, R. The Industrial Information Technology Hanbook. Danvers, MA, U.S.A.: CRC Press LLC, 2005. ISBN 0-8493-1985-4. |
| Recommended Reading: |
|---|
LAURENČÍK, M. SQL: podrobný průvodce uživatele. Praha: Grada Publishing, 2018. Průvodce. ISBN 978-80-271-0774-2.
KALUŽA, Jindřich a Ludmila KALUŽOVÁ. Informatika. Praha: Ekopress, 2012. ISBN 978-80-86929-83-5.
PLÁVKA, J. Algoritmy a zložitosť. Košice: TU Košice, 1998, 82 s. ISBN 80-7166-
026-4.
ŠARMANOVÁ, J. Teorie zpracování dat. 1. vyd. Ostrava: VŠB-TU Ostrava, 1997,
106 s. ISBN 80-7078-491-1.
VIRIUS, M. Základy algoritmizace. Praha: Vydavatelství ČVUT, 1995. 195 s. ISBN 80-01-01346-4.
WIRTH, N. Algoritmy a štruktúry údajov. Bratislava: Alfa, 1989. 488 s. ISBN 80-05-00153-3.
RAPHAEL, B. and I. F. C. SMITH. Engineering informatics: fundamentals of computer-aided engineering. 2nd ed. Chichester: Wiley, 2013. ISBN 978-1-119-95341-8.
ZURAWSKI, R. The Industrial Information Technology Hanbook. Danvers, MA, U.S.A.: CRC Press LLC, 2005. ISBN 0-8493-1985-4.
GROFF, J. R. and P. N. WEINBERG. Using SQL. Berkeley: McGraw-Hill/Osborne, c1990. ISBN 0-07-881524-X. |
LAURENČÍK, M. SQL: podrobný průvodce uživatele. Praha: Grada Publishing, 2018. Průvodce. ISBN 978-80-271-0774-2.
KALUŽA, Jindřich a Ludmila KALUŽOVÁ. Informatika. Praha: Ekopress, 2012. ISBN 978-80-86929-83-5.
PLÁVKA, J. Algoritmy a zložitosť. Košice: TU Košice, 1998, 82 s. ISBN 80-7166-
026-4.
ŠARMANOVÁ, J. Teorie zpracování dat. 1. vyd. Ostrava: VŠB-TU Ostrava, 1997,
106 s. ISBN 80-7078-491-1.
VIRIUS, M. Základy algoritmizace. Praha: Vydavatelství ČVUT, 1995. 195 s. ISBN 80-01-01346-4.
WIRTH, N. Algoritmy a štruktúry údajov. Bratislava: Alfa, 1989. 488 s. ISBN 80-05-00153-3.
RAPHAEL, B. a I. F. C. SMITH. Engineering informatics: fundamentals of computer-aided engineering. 2nd ed. Chichester: Wiley, 2013. ISBN 978-1-119-95341-8.
ZURAWSKI, R. The Industrial Information Technology Hanbook. Danvers, MA, U.S.A.: CRC Press LLC, 2005. ISBN 0-8493-1985-4.
GROFF, J. R. a P. N. WEINBERG. Using SQL. Berkeley: McGraw-Hill/Osborne, c1990. ISBN 0-07-881524-X. |
| Planned learning activities and teaching methods |
|---|
| Lectures, Tutorials, Project work |
| Assesment methods and criteria |
|---|
| Task Title | Task Type | Maximum Number of Points
(Act. for Subtasks) | Minimum Number of Points for Task Passing |
|---|
| Exercises evaluation and Examination | Credit and Examination | 100 (100) | 51 |
| Exercises evaluation | Credit | 35 (35) | 0 |
| Project | Project | 20 | 0 |
| Written exam | Written test | 15 | 0 |
| Examination | Examination | 65 (65) | 0 |
| Written examination | Written examination | 45 | 0 |
| Oral | Oral examination | 20 | 0 |