Course: Didactics of Computer Science 2

« Back
Course title Didactics of Computer Science 2
Course code KMI/DI2AV
Organizational form of instruction Lecture + Exercise
Level of course Master
Year of study not specified
Semester Summer
Number of ECTS credits 4
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
Students get acquainted with the common features of Computer Science teaching at different types of schools, they learn the criteria for the selection of a programming language, they train passing from simple to complex topics. They also learn handling recursive algorithms as endless cycles, structured data types, basic features of object programming, and the Comenius LOGO software as a tool for complex programs creation. <ol> <li>Common features of Computer Science teaching at different types of schools. <li>Criteria for the selection of a programming language. <li>Striding over barriers in abstraction -- from simple to complex. <li>Recursive algorithm as an endless cycle. <li>Structured data types, words and sentences as an example. <li>Comenius LOGO software as tool for complex programs creation. <li>Teaching algorithms on grammar schools. <li>Basic features of object programming -- Pros and Cons of object-oriented programming teaching. <li>Pedagogical patterns in Computer Science. </ol>

Learning activities and teaching methods
Lecture, Demonstration
  • Preparation for the Course Credit - 22 hours per semester
  • Preparation for the Exam - 24 hours per semester
  • Attendace - 40 hours per semester
Learning outcomes
The goal of the course is to evaluate the role of a teacher and specify the contents of voluntary courses, with respect to the differences among groups of students and with respect to the evolution of programming paradigms from procedural to object-oriented programming.
Apply didactic principles in teaching of IT subjects in secondary schools.
Prerequisites
unspecified
KMI/DI1AV

Assessment methods and criteria
Oral exam, Written exam

Active participation in class. Completion of assigned homeworks. Passing the oral (or written) exam.
Recommended literature
  • Abelson H., diSessa A. (1986). Turtle geometry: The Computer as a Medium for Exploring Mathematics. MIT Press.
  • H. Abelson, G. J. Sussman. (1985). Structure and Interpretation of Computer Programs (SICP). MIT Press.
  • M. Kudělka, M. Kopka. (1997). Algoritmus a program. Školský informační servis.
  • M. Kudělka. Programování v jazyku Comenius LOGO. Pracovní text (postscript).


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