Course: Algorithms and programming I

« Back
Course title Algorithms and programming I
Course code UI/N1002
Organizational form of instruction Lecture + Lesson
Level of course Bachelor
Year of study 1
Semester Winter
Number of ECTS credits 4
Language of instruction Czech
Status of course Compulsory
Form of instruction Face-to-face
Work placements This is not an internship
Recommended optional programme components None
Course availability The course is available to visiting students
Lecturer(s)
  • KOLIBA František, doc. RNDr. CSc.
  • SKÁCEL Jakub, Mgr.
  • DRASTIK Jan, Mgr.
  • LANGER Miroslav, RNDr. Ph.D.
  • MARTÍNEK Pavel, Mgr.
Course content
1. Algorithm, division of the algorithms, recursion, iteration, representation of an algorithm 2. Asymptotic analysis, time and space complexity 3. Basic terms and syntax: variable, array, operators, arithmetic expressions, branching, cycles, functions 4. Flow charts 5. C++ language: basic syntax, comments, structure of the programm, variables and types of data 6. Functions, function main, structures IF THEN ELSE, SWITCH 7. WHILE, DO WHILE, FOR cycles 8. Sorting, properties and complexity of the sorting algorithms, Bubble sort, Shaker sort, Quick sort, Insert sort, Select sort, Merge sort, Heap sort, Radix sort, Bogo sort, Bozo sort 9. Composite data types, structures 10. Pointers Control Structures (if then), (if then else), multiple (switch) 5. Repetition Control Structures (while do, for) 6. Functions and Procedure (parameters definition and passing) 7. Data Structures arrays (one and two dimensional) 8. Strings files and its operations (open, reset, rewrite, read, write, eof) 9. Records (definition statement) 10. Pointers

Learning activities and teaching methods
Interactive lecture, Lecture with a video analysis
Recommended literature
  • msdn.microsoft.com.
  • www.algoritmy.net.
  • www.itnetwork.cz.
  • Buchalcová, A. Algoritmizace a programování. Praha, 1990.
  • CORMEN, Thomas H., LEISERSON, Charles E., RIVEST, Ronald L, STEIN, C. Introduction to Algorithms.. The MIT Press,, 2009. ISBN 978-0262033848.
  • JINOCH, J. , MÜLLER, K. ,VOGEL, J. Programování v jazyku Pascal. SNTL, Praha, 1988.
  • PINK, Hensley. Learning Pascal Programming: The Beginner's Guide. Amazon Digital Services, 2012. ISBN ASIN:B007HEXQ1M.
  • Prata, S. Mistrovství v C++.. Praha, 2001.
  • Prokop, J. Algoritmy v jazyku C a C++. Praha, 2015. ISBN 24797465.
  • SEDGEWICK, Robert, WAYNE, K. Algorithms. Addison-Wesley Professional, 2011. ISBN ASIN:B004P8J1NA.
  • TOPFER, P. Algoritmy a programování. Praha, Prometheus, 2002. ISBN 80-85849-83-6.
  • WIRTH, N. Algoritmy a štruktúry údajov. ALFA, Bratislava,, 1990. ISBN 80-05-00153-3.


Study plans that include the course
Faculty Study plan (Version) Branch of study Category Recommended year of study Recommended semester
Mathematical Institute in Opava Mathematical Analysis (1-IVT) Mathematics courses 1 Winter
Faculty of Philosophy and Science in Opava Applied Computer Science (1) Informatics courses 1 Winter
Mathematical Institute in Opava Applied Mathematics in Risk Management (3) Mathematics courses 1 Winter
Mathematical Institute in Opava Mathematical Methods in Economics (3) Economy 1 Winter
Mathematical Institute in Opava Applied Mathematics (2014-IVT) Mathematics courses 1 Winter
Mathematical Institute in Opava Mathematical Methods in Economics (2) Economy 1 Winter
Faculty of Philosophy and Science in Opava Computer Science and Technology (1) Electrical engineering, telecommunication and IT 1 Winter
Faculty of Philosophy and Science in Opava Information studies with the focus on library science (2) Journalism, library science and informatics 1 Winter
Mathematical Institute in Opava Mathematics (2014-IVT) Mathematics courses 1 Winter
Mathematical Institute in Opava Mathematics (1-IVT) Mathematics courses 1 Winter