FPF:UINK102 Algorithms and Programming I - Course Information
UINK102 Algorithms and Programming I
Faculty of Philosophy and Science in OpavaWinter 2017
- Extent and Intensity
- 0/0. 4 credit(s). Type of Completion: z (credit).
- Teacher(s)
- doc. RNDr. František Koliba, CSc. (lecturer)
RNDr. Miroslav Langer, Ph.D. (lecturer)
RNDr. Miroslav Langer, Ph.D. (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)
- Information studies with the focus on library science (programme FPF, B7201 InSK)
- Computer Science and Technology (programme FPF, B1801 Inf)
- Course objectives
- The course aims to explore the logic of programming via the algorithm concepts including a problem solving strategies and the use of algorithmic language. Students will become acquainted with the data types, control structures, data structures and functions, data representation on the computer machine level. This course aims to introduce computer programming and emphasis in problem solving on the fundamentals of structured design.
- Syllabus
- 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
- 1. Algorithm, division of the algorithms, recursion, iteration, representation of an algorithm
- Literature
- recommended literature
- msdn.microsoft.com. URL info
- www.algoritmy.net. URL info
- www.itnetwork.cz. URL info
- Prokop, J. Algoritmy v jazyku C a C++. Praha, 2015. ISBN 24797465. info
- http://pascal.webz.cz. 2005. URL info
- Prata, S. Mistrovství v C++. Praha, 2001. info
- David Padrta. Algoritmy a programování. 1999. URL info
- Eduard Polách. PROGRAMOVÁNÍ V JAZYKU TURBO PASCAL. České Budějovice, 1993. URL info
- Buchalcová, A. Algoritmizace a programování. Praha, 1990. 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.
Information on the extent and intensity of the course: Přednáška 6 HOD/SEM, Cvičení 6 HOD/SEM. - Teacher's information
- Hand in homeworks and final project.
- Enrolment Statistics (Winter 2017, recent)
- Permalink: https://is.slu.cz/course/fpf/winter2017/UINK102