We assume that the reader has had undergraduate courses in mathematics and algorithmics Despite this assumption we present all elementary fundamentals needed for the rest of this book in this chapter. The main reasons to do this are the following ones: (i) to make the book completely self-...
contributions have been carefully reviewed and selected. Among the topics addressed are a broad variety of topics from theoretical computer science, algorithmics and programming theory. The WEA papers deal with graph and network algorithms, flow and routing problems, scheduling and approximation algorithms...
Clearly structured and interactive in nature, the book presents detailed walkthroughs of several algorithms, stimulating a conversation with the reader through informal commentary and provocative questions. Features: no university-level background in mathematics required; ideally structured for classroom-use ...
They were organized in topical sections named: role of programming and algorithmics in informatics for pupils of all ages; national concepts of teaching informatics; teacher education in informatics; contests and competitions in informatics; socio-psychological aspects of teaching informatics; and computer...
This chapter suffers from the typical "out of place" syndrome. It is too short to learn from and too selective for a refresher. Usually, people without a specific time processing background don't jump into adaptive algorithmics.Vladimir Botchev...