FPF:UIN2034 Algorithms and Programming III - Course Information
UIN2034 Algorithms and Programming III
Faculty of Philosophy and Science in OpavaWinter 2015
- Extent and Intensity
- 0/2/0. 3 credit(s). Type of Completion: z (credit).
- Teacher(s)
- RNDr. Miroslav Langer, Ph.D. (seminar tutor)
- Guaranteed by
- RNDr. Miroslav Langer, Ph.D.
Institute of Computer Science – Faculty of Philosophy and Science in Opava - Prerequisites
- UIAI206 Algorithms and Programming II || UIBUC05 Algorithms and programming II || UIKKB13 Algorithms and Programming II || UIKSB20 Algorithms and programming II || UINK103 Algorithms and Programming II || UINK113 Algorithms and Programming II || UIN1003 Algorithms and Programming II
Basics of programming and algorithms. - 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)
- Computer Science and Technology (programme FPF, B1801 Inf)
- Computer science in combination with another discipline (programme FPF, B1803 InDO)
- Computer science in combination with another discipline (programme FPF, B6107 HuSt)
- Mathematical Analysis (programme MU, M1101)
- Mathematical Methods in Economics (programme MU, B1101)
- Mathematics (programme MU, B1101)
- Computer Technology and its Applications (programme FPF, B1702 AplF)
- Course objectives
- Students learn the principles of object-oriented programming using the Java programming language. They learn to apply the principles of inheritance, polymorphism and encapsulation, learn to use defined structures such as branching, cycles, work with inputs and outputs, exception handling, etc.
- Syllabus
- The content of the course: the principles of inheritance, polymorphism and encapsulation, use of predefined structures such as branching, loops, work with inputs and outputs, exception handling, etc.
Furthermore, the course content :
Algorithms for sorting and classification. Universal algorithms for sorting - select sort, insert sort and others.
Sort by altering , shifting with decreasing step, sorting with selection of binary tree,
repeated partial arranged sorting, merging .
Special algorithms for sorting - sorting integers by repeated sorting, sorting words, real
sorting numbers.
Search algorithms - search problem in one-dimensional associative search.
Search trees - height and weight- balanced trees. One-dimensional address search.
Multidimensional search.
Recursive programming - recursive functions, recursive programs, recursive
subroutines. Relations recursion and iteration.
Parallel Programming - Parallel architectures and algorithms.
- The content of the course: the principles of inheritance, polymorphism and encapsulation, use of predefined structures such as branching, loops, work with inputs and outputs, exception handling, etc.
- Literature
- 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
- Obtaining more than 50% of the points from elaborated tasks that are assigned during the semester.
- Enrolment Statistics (Winter 2015, recent)
- Permalink: https://is.slu.cz/course/fpf/winter2015/UIN2034