FI:I001 Introduction to Programming - Course Information
I001 Introduction to Programming
Faculty of InformaticsAutumn 1998
- Extent and Intensity
- 2/2. 4 credit(s). Recommended Type of Completion: k (colloquium). Other types of completion: zk (examination), z (credit).
- Teacher(s)
- doc. RNDr. Renata Ochranová, CSc. (lecturer)
- Guaranteed by
- Contact Person: doc. RNDr. Renata Ochranová, CSc.
- Prerequisites (in Czech)
- ! U111 Design of Algorithms for CS II &&! U110 Návrh algoritmů pro VT I &&! I002 Design of Algorithms I
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- Informatics (programme FI, B-IN)
- Informatics (programme FI, M-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
- Information Technology (programme FI, B-IN)
- Syllabus
- Output, constants.
- Input, variables.
- Conditional statement, loop.
- Text file.
- Algorithms based on recurrence relation.
- Procedures and functions, parameters, recursion, side effect.
- Data types (abstraction, representation, data processing): array, string, set, record, file, text file.
- Basic algorithms: searching, sorting.
- Numerical algorithms: precision, error.
- Non-numerical algorithms: text processing, graphics.
- Algorithm analysis: correctness, effectivity.
- Asymptotic time complexity: polynomial, exponential and optimal algorithms.
- Language of instruction
- Czech
- Further Comments
- The course is taught annually.
The course is taught every week.
- Enrolment Statistics (Autumn 1998, recent)
- Permalink: https://is.muni.cz/course/fi/autumn1998/I001