Algorithms; pointer; dynamic data structures, stack, queue

One of the basic abilities students specialized in subjects focused on information technologies should cope with, is algorithmic thinking. However, we must admit that algorithms? training seems to be rather difficult for students, and consequently they may become unconcerned. This contribution is an attempt to illustrate that algorithms training may be appealing and stimulative for students. They participate in the class work, seek challenging tasks and their possible algorithmic solutions. When teaching dynamic data structures, we apply constructivist teaching methods. At first students primarily learn to create algorithms without using any programming languages.