The entry into the recursion starts with calculation algorithms such as n!, Fibonacci sequence, gcd and lcm and continues with recursive graphics. A prime example of recursion is the algorithm of the problem "Towers of Hanoi". However, the applet presented here has been using the knowledge of the data structure "stack" forward. At various examples such as term calculators, waiting rooms and car washs linear data structures List, Stack and Queue are demonstrated. It continues with examples of searching and sorting. Finally, tree structures are presented with various examples.
Informatics
Introductory phase (EF): In the early stages of teaching computer science in the EF there are different approaches eg with Greenfoot. Here I will but introduce projects realized with Netbeans. the first projects deal with simple graphics and string manipulations. Based on the graphic examples, an entrance to the object-oriented programming (ball as moving circle, billiard ball subclass of ball knows a pool table, circle and square as a subclass of the abstract class figure, polymorphism, etc.).
Qualifying phase I (Q1): A first project deals with recursive algorithms, then various projects follow on "Linear Data Structures" (List, Stack, Queue) and on the theme of "Searching and Sorting". Finally, projects are being implemented to tree structures.
Qualification Phase II (Q2): Here various projects for client / server programming are presented.
Informatics
If you click on the text section in the Newsflash module left, all the text is displayed.
