Course: Algorithms and Computer Programming 2

» List of faculties » EF » MTI
Course title Algorithms and Computer Programming 2
Course code MTI/ALP2
Organizational form of instruction Lecture + Lesson
Level of course Bachelor
Year of study not specified
Semester Summer
Number of ECTS credits 5
Language of instruction Czech
Status of course Compulsory
Form of instruction Face-to-face
Work placements Course does not contain work placement
Recommended optional programme components None
Lecturer(s)
  • Vitvarová Jana, Ing. Ph.D.
  • Královcová Jiřina, doc. Ing. Ph.D.
Course content
Lectures 1. Object oriented programming concept. Classes, data, methods. Encapsulation, inheritance, polymorphism. 2. Object oriented design. 3. Exceptions. Exception types. Generating and maintaining exceptions. 4. Text strings. 5. Maintaining disk files. Data streams. Text and binary files. 6. Maintaining text files. 7. Maintaining binary files. 8. Numerical algorithms. 9. Geometrical algorithms. 10. Recursive algorithms. 11. Combinatorial algorithms. 12. Container classes. Dynamic data structures. 13. Tree structure. Searching. 14. Java language libraries. Practice 1. Program debugging. 2. Object oriented design - encapsulation. 3. Object oriented design - inheritance, polymorphism. 4. Employment of exception mechanism, generating exceptions. 5. Maintaining of text strings. 6. Maintaining of text files. 7. Maintaining of binary files. 8. Realisation of numerical algorithms. 9. Realisation of geometrical algorithms. 10. Realisation of recursive algorithms. 11. Realisation of combinatorial algorithms. 12. Container classes. 13. Tree structures. 14. Task with searching.

Learning activities and teaching methods
Monological explanation (lecture, presentation,briefing), Working activities (workshops)
  • Class attendance - 56 hours per semester
Learning outcomes
The course deepens the computer programming knowledge. Students learn object oriented programming approach, algorithm development and realization of algorithms in programming language Java. Algorithms are focused on maintaining text strings, maintaining disk files, numerical methods, realization and traversing list and tree structures.
Students will acquire further knowledge in object oriented programming, algorithm development and realization of algorithms in programming language Java. Algorithms are focused on maintaining text strings, maintaining disk files, numerical methods, realization and traversing list and tree structures.
Prerequisites
Any one
MTI/ALP1

Assessment methods and criteria
Combined examination, Oral exam, Written exam

Participation on seminars. Realisation of requested tasks. Pass exam.
Recommended literature
  • BLOCH, J. Java efektivně - 57 zásad softwarového experta. ISBN 80-247-0416-1.
  • Cormen, T. H. Introduction to algorithms. The MIT Press, Cambridge, Massachusetts, 2001.
  • HEROUT, P. Java - bohatství knihoven. České Budějovive, 2006. ISBN 80-7232-288-5.
  • HEROUT, P. Učebnice jazyka Java. Kopp, České Budějovice, 2003.
  • PECINOVSKÝ, R. Návrhové vzory - 33 vzorových postupů pro bjektové programování. Brno, 2007. ISBN 78-80251-1582-4.
  • Sedgewick, R. Algoritmy v C. SoftPress, 2003.
  • Sharon Zakhour. Java 6, Výukový kurz. Brno, 2006. ISBN 978-80-251-1.
  • WRÓBLEWSKI, P. Algoritmy datové struktury a programovací techniky. Computer Press, Brno, 2004.


Study plans that include the course
Faculty Study plan (Version) Category of Branch/Specialization Recommended year of study Recommended semester
Faculty: Faculty of Mechatronics, Informatics and Interdisciplinary Studies Study plan (Version): Information Technology (2013) Category: Informatics courses 1 Recommended year of study:1, Recommended semester: Summer