14 Results for : nontrivial
-
Algorithms and Data Structures
Algorithms are at the heart of every nontrivial computer application, and algorithmics is a modern and active area of computer science. Every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retrieval of data, frequently used algorithms, and basic techniques for modeling, understanding and solving algorithmic problems. This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, and optimization. The algorithms are presented in a modern way, with explicitly formulated invariants, and comment on recent trends such as algorithm engineering, memory hierarchies, algorithm libraries and certifying algorithms. The authors use pictures, words and high-level pseudocode to explain the algorithms, and then they present more detail on efficient implementations using real programming languages like C++ and Java.The authors have extensive experience teaching these subjects to undergraduates and graduates, and they offer a clear presentation, with examples, pictures, informal explanations, exercises, and some linkage to the real world. Most chapters have the same basic structure: a motivation for the problem, comments on the most important applications, and then simple solutions presented as informally as possible and as formally as necessary. For the more advanced issues, this approach leads to a more mathematical treatment, including some theorems and proofs. Finally, each chapter concludes with a section on further findings, providing views on the state of research, generalizations and advanced solutions.- Shop: buecher
- Price: 46.99 EUR excl. shipping
-
Ultrafilters and Topologies on Groups
This book presents the relationship between ultrafilters and topologies on groups. It shows how ultrafilters are used in constructing topologies on groups with extremal properties and how topologies on groups serve in deriving algebraic results about ultrafilters.The contents of the book fall naturally into three parts. The first, comprising Chapters 1 through 5, introduces to topological groups and ultrafilters insofar as the semigroup operation on ultrafilters is not required. Constructions of some important topological groups are given. In particular, that of an extremally disconnected topological group based on a Ramsey ultrafilter. Also one shows that every infinite group admits a nondiscrete zero-dimensional topology in which all translations and the inversion are continuous.In the second part, Chapters 6 through 9, the Stone-Cêch compactification betaG of a discrete group G is studied. For this, a special technique based on the concepts of a local left group and a local homomorphism is developed. One proves that if G is a countable torsion free group, then betaG contains no nontrivial finite groups. Also the ideal structure of betaG is investigated. In particular, one shows that for every infinite Abelian group G, betaG contains 22 G minimal right ideals.In the third part, using the semigroup betaG, almost maximal topological and left topological groups are constructed and their ultrafilter semigroups are examined. Projectives in the category of finite semigroups are characterized. Also one shows that every infinite Abelian group with finitely many elements of order 2 is absolutely -resolvable, and consequently, can be partitioned into subsets such that every coset modulo infinite subgroup meets each subset of the partition.The book concludes with a list of open problems in the field. Some familiarity with set theory, algebra and topology is presupposed. But in general, the book is almost self-contained. It is aimed at graduate students and researchers working in topological algebra and adjacent areas.- Shop: buecher
- Price: 51.99 EUR excl. shipping
-
Seven Languages in Seven Weeks
You should learn a programming language every year, as recommended by The Pragmatic Programmer. But if one per year is good, how about Seven Languages in Seven Weeks? In this book you'll get a hands-on tour of Clojure, Haskell, Io, Prolog, Scala, Erlang, and Ruby. Whether or not your favorite language is on that list, you'll broaden your perspective of programming by examining these languages side-by-side. You'll learn something new from each, and best of all, you'll learn how to learn a language quickly. You should learn a programming language every year, as recommended by The Pragmatic Programmer. But if one per year is good, how about Seven Languages in Seven Weeks? In this book you'll get a hands-on tour of Clojure, Haskell, Io, Prolog, Scala, Erlang, and Ruby. Whether or not your favorite language is on that list, you'll broaden your perspective of programming by examining these languages side-by-side. You'll learn something new from each, and best of all, you'll learn how to learn a language quickly. Ruby, Io, Prolog, Scala, Erlang, Clojure, Haskell. With Seven Languages in Seven Weeks, by Bruce A. Tate, you'll go beyond the syntax-and beyond the 20-minute tutorial you'll find someplace online. This book has an audacious goal: to present a meaningful exploration of seven languages within a single book. Rather than serve as a complete reference or installation guide, Seven Languages hits what's essential and unique about each language. Moreover, this approach will help teach you how to grok new languages. For each language, you'll solve a nontrivial problem, using techniques that show off the language's most important features. As the book proceeds, you'll discover the strengths and weaknesses of the languages, while dissecting the process of learning languages quickly--for example, finding the typing and programming models, decision structures, and how you interact with them. Among this group of seven, you'll explore the most critical programming models of our time. Learn the dynamic typing that makes Ruby, Python, and Perl so flexible and compelling. Understand the underlying prototype system that's at the heart of JavaScript. See how pattern matching in Prolog shaped the development of Scala and Erlang. Discover how pure functional programming in Haskell is different from the Lisp family of languages, including Clojure. Explore the concurrency techniques that are quickly becoming the backbone of a new generation of Internet applications. Find out how to use Erlang's let-it-crash philosophy for building fault-tolerant systems. Understand the actor model that drives concurrency design in Io and Scala. Learn how Clojure uses versioning to solve some of the most difficult concurrency problems. It's all here, all in one place. Use the concepts from one language to find creative solutions in another-or discover a language that may become one of your favorites.- Shop: buecher
- Price: 24.99 EUR excl. shipping
-
Game Query
Game Query - Nontrivial Trivia from the Minds at The Economist: ab 7.99 €- Shop: ebook.de
- Price: 7.99 EUR excl. shipping