Course: Solution Methods of Computer Science Problems

« Back
Course title Solution Methods of Computer Science Problems
Course code KMI/MRAV
Organizational form of instruction Seminar
Level of course Master
Year of study not specified
Semester Winter
Number of ECTS credits 3
Language of instruction Czech
Status of course unspecified
Form of instruction Face-to-face
Work placements This is not an internship
Recommended optional programme components None
Lecturer(s)
  • Zacpal Jiří, Mgr. Ph.D.
Course content
The course presents the basic problems in informatics. Students meet various problems of searching, sorting and data structures handling, which are suitable for teaching the elements of algorithms and programming. The problems can be solved by means of various algorithms, on which basic methods of algoritmization are demonstrated. Implementation of the algorithms and their comparison with respect to efficiency and suitability is also discussed. <ol> <li> Principles of problem solving at grammar schools. <li> Searching algorithms. <li> Sorting algorithms. <li> Basic data structures. <li> Presentation of selected problem. </ol>

Learning activities and teaching methods
Demonstration
  • Attendace - 20 hours per semester
  • Preparation for the Course Credit - 20 hours per semester
Learning outcomes
The students become familiar with basic concepts of solution methods of computer science problems.
Propose a teaching of basic algorithms in secondary school.
Prerequisites
unspecified

Assessment methods and criteria
Oral exam, Written exam

Active participation in class. Completion of assigned homeworks. Passing the oral (or written) exam.
Recommended literature
  • Kozen D. C. (1991). The Design And Analysis of Algorithms. Springer.
  • Roubal P. (2000). Informatika a výpočetní technika pro SŠ. ComputerPress.
  • Sedgewick Robert. (1998). Algoritmy v C. SoftPress.


Study plans that include the course
Faculty Study plan (Version) Branch of study Category Recommended year of study Recommended semester