Wyniki wyszukiwania:

Dieses Lehrbuch ermoglicht einen begeisterten Einstieg ins Programmieren ab 10 Jahren. Programmierunterricht wird dabei als Forderung der konstruktiven Losungsfahigkeit und der exakten Kommunikation zur Steuerung eines Computers verstanden. Die Schuler entdecken und entwickeln die Programmiersprache selbststandig mit und lernen, Aufgaben systematisch zu losen. Beginnend mit einzelnen Anweisungen werden einfache Programme spielerisch eingefuhrt. Das Buch zeichnet sich aus durch seine detaillierten Erklarungen und anschaulichen Darstellungen. Die Programmierumgebung sowie die Arbeitshefte...

This textbook not only provides an elegant route through the theoretical fundamentals of computer science, it also shows that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles, depth of research, and yet directly applicable. It presents the development of the computer scientist's way of thinking: detailing such classic areas as computability and automata theory as well as such fundamental concepts as approximation and randomization in algorithmics. Coverage also explains the basic ideas of cryptography and interconnection network...

This textbook not only provides an elegant route through the theoretical fundamentals of computer science, it also shows that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles, depth of research, and yet directly applicable. It presents the development of the computer scientist's way of thinking: detailing such classic areas as computability and automata theory as well as such fundamental concepts as approximation and randomization in algorithmics. Coverage also explains the basic ideas of cryptography and interconnection network...

This book constitutes the thoroughly refereed post-proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004, held in Bad Honnef, Germany in June 2004.

The 31 revised full papers presented together with 2 invited papers were carefully selected from 66 submissions during two rounds of reviewing and improvement. The papers are organized in topical sections on graph algorithms: trees; graph algorithms: recognition and decomposition; graph algorithms: various problems; optimization and approximation algorithms; parameterized complexity and...

This book constitutes the refereed proceedings of the 4th International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2007. The nine revised full papers and five invited papers presented were carefully selected for inclusion in the book. The contributed papers included in this volume cover both theoretical as well as applied aspects of stochastic computations with a special focus on investigating the power of randomization in algorithmics.