Course: Algorithms and Programming

» List of faculties » FES » USII
Course title Algorithms and Programming
Course code USII/EALG
Organizational form of instruction Lecture + Tutorial
Level of course Bachelor
Year of study not specified
Semester Summer
Number of ECTS credits 5
Language of instruction English
Status of course Compulsory
Form of instruction Face-to-face
Work placements This is not an internship
Recommended optional programme components None
Lecturer(s)
  • Horák Oldřich, RNDr. Ing. Ph.D.
Course content
Introduction to the course, definitions of a computer and a computer system. Technical and programming equipment of computers. Methods of task solving on a computer. Algorithmization of tasks. Basic terms used in algorithmization and programming. Programming languages. Constants, variables, terms, and commands. Block programme structure. Data types. Classification of data types. Basic commands. Standard procedures of input and output data. Structured commands. Structured data types. Principles of the object-oriented programming.

Learning activities and teaching methods
Monologic (reading, lecture, briefing), Work with text (with textbook, with book), Methods of individual activities
  • Preparation for an exam - 14 hours per semester
  • Home preparation for classes - 42 hours per semester
  • Term paper - 5 hours per semester
  • Practical training - 28 hours per semester
  • Preparation for a credit (assessment) - 5 hours per semester
  • Independent critical reading - 28 hours per semester
  • Contact teaching - 28 hours per semester
Learning outcomes
Students are acquainted with essentials of informatics and technical equipment of computers as well as the Python programming language and the basics of flowcharts.
Students will be able to analyze problem, create and algorithm, write it in a form of a flow chart and programme it in Python. They will be able to understand basic terms of programming.
Prerequisites
unspecified

Assessment methods and criteria
Oral examination, Written examination, Home assignment evaluation

Assignment granting is conditioned by completion of tasks at seminars (minimum achievement of 60 percent is required) and submission of a project. Examination: successul defence of a project (students develop and defend their own programmes on selected topics). Detailed information will be provided during the first lecture.
Recommended literature
  • Cormen, Thomas H. Introduction to algorithms. Cambridge, Massachusetts ;: The MIT Press, 2009. ISBN 978-0-262-53305-8.
  • Goyal, S.D. Design and Analysis of Algorithm. USP, 2010. ISBN 978-8190856539.
  • Mehlhorn, K., Sanders, P. Algorithms and Data Structures: The Basic Toolbox. 2008.
  • Zelle, J.M. Python Programming: An Introduction to Computer Science. Franklin, 2004. ISBN 978-1887902991.


Study plans that include the course
Faculty Study plan (Version) Category of Branch/Specialization Recommended year of study Recommended semester