UIN2034 Algorithms and Programming III

Faculty of Philosophy and Science in Opava
Winter 2014
Extent and Intensity
0/2/0. 3 credit(s). Type of Completion: z (credit).
Teacher(s)
doc. RNDr. Lucie Ciencialová, Ph.D. (seminar tutor)
Mgr. Zbyněk Dušek (seminar tutor)
RNDr. Miroslav Langer, Ph.D. (seminar tutor)
Guaranteed by
doc. RNDr. Lucie Ciencialová, 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 || 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
there are 11 fields of study the course is directly associated with, display
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.
Literature
    recommended literature
  • Oracle Inc. JavaTutorials. Lesson: Concurrency. URL info
  • PECINOVSKÝ, R:. Myslíme objektivně v jazyku Java. Praha: Grada, 2009. ISBN 978-80-247-2653-3. info
  • FLANAGAN, D. Programování v jazyce Java. Praha: Computer Press, 1997. ISBN 80-85896-78-8. info
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.
The course is also listed under the following terms Summer 1994, Summer 1995, Summer 1996, Summer 1997, Summer 1998, Summer 1999, Summer 2000, Summer 2001, Summer 2002, Summer 2003, Summer 2004, Summer 2005, Summer 2007, Summer 2008, Summer 2009, Summer 2010, Summer 2011, Summer 2012, Winter 2012, Winter 2013, Winter 2015, Winter 2016, Winter 2017, Winter 2018, Winter 2019, Winter 2020, Winter 2021, Winter 2022.
  • Enrolment Statistics (Winter 2014, recent)
  • Permalink: https://is.slu.cz/course/fpf/winter2014/UIN2034