FPF:UIN1002 Algorithms and programming I - Course Information
UIN1002 Algorithms and programming I
Faculty of Philosophy and Science in OpavaWinter 2015
- Extent and Intensity
- 2/2/0. 4 credit(s). Type of Completion: z (credit).
- Teacher(s)
- doc. RNDr. František Koliba, CSc. (lecturer)
Ing. Jiří Blahuta, Ph.D. (seminar tutor)
Mgr. Jan Drastik, Ph.D. (seminar tutor)
Mgr. Lukáš Mamula (seminar tutor)
Mgr. Marek Menšík, Ph.D. (seminar tutor)
RNDr. Michal Perdek (seminar tutor)
Mgr. Jakub Skácel (seminar tutor)
Mgr. Bc. Tomáš Wagner (seminar tutor) - Guaranteed by
- doc. RNDr. František Koliba, CSc.
Institute of Computer Science – Faculty of Philosophy and Science in Opava - 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
- Applied Computer Science (programme FPF, B1802 AplI)
- Applied Mathematics (programme MU, B1101)
- Applied Mathematics in Risk Management (programme MU, B1101)
- Information studies with the focus on library science (programme FPF, B7201 InSK)
- Computer Science and Technology (programme FPF, B1801 Inf)
- Mathematical Analysis (programme MU, M1101)
- Mathematical Methods in Economics (programme MU, B1101)
- Mathematics (programme MU, B1101)
- Course objectives
- Algorithms and programming course is the introduction to the programming. The aim of the course is to learn about data types (standard and user defined), cycles, procedures, and functions and how to use it in correct form. Further, the students will explore the basic methods for algorithms optimization.
- Syllabus
- 1. The history of programming. Compilers and interpreters. Algorithms.
2. Basic data types.
3. User defined data types.
4. Input and output. Formatted output.
5. Logical operators and commands. Cycles.
6. Procedures and functions. Parameters.
7. Procedures connected with files.
8. Blocking structure of programs, optimization.
9. Ongoing test.
10. Dynamic data variables.
11. Continuous lists.
12. Abstract data structures.
13. Binary trees.
- 1. The history of programming. Compilers and interpreters. Algorithms.
- Literature
- required literature
- CORMEN, Thomas H., LEISERSON, Charles E., RIVEST, Ronald L, STEI. Introduction to Algorithms. The MIT Press,, 2009. ISBN 978-0262033848. info
- WIRTH, N. Algoritmy a štruktúry údajov. ALFA, Bratislava,, 1990. ISBN 80-05-00153-3. info
- recommended literature
- PINK, Hensley. Learning Pascal Programming: The Beginner's Guide. Amazon Digital Services, 2012. ISBN ASIN:B007HEXQ1M. info
- SEDGEWICK, Robert, WAYNE, K. Algorithms. Addison-Wesley Professional, 2011. ISBN ASIN:B004P8J1NA. info
- TOPFER, P. Algoritmy a programování. Praha, Prometheus, 2002. ISBN 80-85849-83-6. info
- JINOCH, J. , MÜLLER, K. ,VOGEL, J. Programování v jazyku Pascal. SNTL, Praha, 1988. info
- Teaching methods
- Interactive lecture
Lecture with a video analysis - Assessment methods
- Credit
- Language of instruction
- Czech
- Further comments (probably available only in Czech)
- The course can also be completed outside the examination period.
- Teacher's information
- 1 ongoing test, combined exam
- Enrolment Statistics (Winter 2015, recent)
- Permalink: https://is.slu.cz/course/fpf/winter2015/UIN1002