Angebote zu "Tree" (10 Treffer)

Git

Git

34,90 € *
ggf. zzgl. Versand

+ Dieses Buch erklärt nicht alles, was Git kann, sondern genau das, was Entwickler wirklich benötigen -- dafür aber detailliert und an praxisnahen Beispielen. + Sehr erfolgreiche Vorauflagen. Git ist eine der beliebtesten Versionsverwaltungen. Die Vielfalt an Kommandos, Optionen und Konfigurationen wirkt anfangs aber oft einschüchternd - obwohl die Grundkonzepte einfach sind und man schon mit wenigen davon effektiv arbeiten kann. Die Autoren dieses Buches bieten daher zunächst eine kompakte Einführung in die Konzepte und jene Befehle, die man im Entwickleralltag wirklich benötigt. Anschließend widmen sie sich ausführlich den wichtigsten Workflows bei der Softwareentwicklung im Team und zeigen, wie Git dort eingesetzt wird. Behandelt werden u.a. folgende Workflows: - Ein Projekt aufsetzen - Mit Feature-Branches entwickeln - Gemeinsam auf einem Branch arbeiten - Kontinuierlich Releases durchführen - Periodisch Releases durchführen - Große Projekte aufteilen Sie lernen indiesem Buch alle wichtigen Git-Befehle und -Funktionen kennen und erfahren, wie Sie sie effektiv anwenden - sowohl über die Kommandozeile als auch mit Tools wie Atlassian Source Tree. Darüber hinaus erfahren Sie, wie Git mit dem Build-Server Jenkins genutzt werden kann oder wie Sie auf Plattformen wie GitHub oder GitLab mit Pull-Requests arbeiten. Zudem lernen Sie fortgeschrittene Features kennen, wie z.B. Submodules, Subtrees und Worktrees. Die 5. Auflage wurde Dank des Feedbacks unserer Leser noch einmal gründlich überarbeitet und ist jetzt an vielen Stellen präziser und besser verständlich. Da Git inzwischen bei vielen Unternehmen schon lange im Einsatz ist, werden die dort versionierten Projekte auch immer größer. Deshalb ist ein neues Kapitel voll mit Tipps zum Umgang mit besonders großen Repositorys hinzugekommen. ´´Eine rundum gelungene Darstellung des Themas, vom Verlag nur Entwicklern empfohlen, ist jedoch auch jedem Anfänger zu empfehlen, der sich durch zunächst unbekannte Begriffe nicht abschrecken lässt. Lesenswert!´´ python-verband.org

Anbieter: buecher.de
Stand: 16.08.2019
Zum Angebot
Data Visualization With Javascript
31,99 € *
ggf. zzgl. Versand

You´ve got data to communicate. But what kind of visualization do you choose, how do you build it, and how do you ensure that it´s up to the demands of the Web? In Data Visualization with JavaScript, you´ll learn how to use JavaScript, HTML, and CSS to build the most practical visualizations for your data. Step-by-step examples walk you through creating, integrating, and debugging different types of visualizations and will have you building basic visualizations, like bar, line, and scatter graphs, in no time. Then you´ll move on to more advanced topics, including how to: - Create tree maps, heat maps, network graphs, word clouds, and timelines - Map geographic data, and build sparklines and composite charts - Add interactivity and retrieve data with AJAX - Manage data in the browser and build data-driven web applications - Harness the power of the Flotr2, Flot, Chronoline.js, D3.js, Underscore.js, and Backbone.js libraries If you already know your way around building a web page but aren´t quite sure how to build a good visualization, Data Visualization with JavaScript will help you get your feet wet without throwing you into the deep end. Before you know it, you´ll be well on your way to creating simple, powerful data visualizations.

Anbieter: buecher.de
Stand: 12.08.2019
Zum Angebot
An Introduction to the Analysis of Algorithms
51,99 € *
ggf. zzgl. Versand

Despite growing interest in the mathematical analysis of algorithms, basic information on methods and models has rarely been directly accessible to practitioners, researchers, or students. This book organizes and presents that knowledge, fully introducing today´s primary techniques for mathematically analyzing algorithms. Robert Sedgewick and the late Philippe Flajolet have drawn from both classical mathematical and computer science material, integrating discrete mathematics, elementary real analysis, combinatorics, algorithms, and data structures. They focus on ´´average-case´´ or ´´probabilistic´´ analysis, while also covering tools for ´´worst case´´ or ´´complexity´´ analysis. Improvements in this edition include: * Upgraded figures and code * Newer style for presenting much of the text´s math * An all-new chapter on trees This book´s thorough, self-contained coverage will help readers appreciate the field´s challenges, prepare them for advanced results covered in Donald Knuth´s books, and provide the background they need to keep abreast of new research. Coverage includes: recurrences, generating functions, asymptotics, trees, strings, maps, sorting, tree search, string search, and hashing algorithms. Ideal for junior- or senior-level courses on mathematical analysis of algorithms, this book will also be useful in courses on discrete mathematics for computer scientists, and in introducing mathematics students to computer science principles related to algorithms and data structures. Product Description Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing primary techniques and results in the field. Robert Sedgewick and the late Philippe Flajolet have drawn from both classical mathematics and computer science, integrating discrete mathematics, elementary real analysis, combinatorics, algorithms, and data structures. They emphasize the mathematics needed to support scientific studies that can serve as the basis for predicting algorithm performance and for comparing different algorithms on the basis of performance. Techniques covered in the first half of the book include recurrences, generating functions, asymptotics, and analytic combinatorics. Structures studied in the second half of the book include permutations, trees, strings, tries, and mappings. Numerous examples are included throughout to illustrate applications to the analysis of algorithms that are playing a critical role in the evolution of our modern computational infrastructure. Improvements and additions in this new edition include Upgraded figures and code Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing primary techniques and results in the field. Authors Robert Sedgewick and the late Philippe Flajolet emphasize the mathematics needed to support scientific studies that can serve as the basis for predicting algorithm performance and for comparing different algorithms on the basis of performance. Improvements and additions in this new edition include upgraded figures and code, an all-new chapter introducing analytic combinatorics, and simplified derivations via analytic combinatorics throughout. The book´s thorough, self-contained coverage will help readers appreciate the field´s challenges and prepare them for advanced study.

Anbieter: buecher.de
Stand: 31.07.2019
Zum Angebot
Algorithms
57,99 € *
ggf. zzgl. Versand

Essential Information that Every Serious Programming Student Needs to Know about Algorithms and Data Structures A Classic Reference The latest version of Sedgewick´s best-selling series, reflecting an indispensable body of knowledge developed over the past several decades. Broad Coverage Full treatment of data structures and algorithms for sorting, searching, graph processing, string processing, and geometric applications, including fifty algorithms every programmer should know. See www.cs.princeton.edu/algs4/top50 . Completely Revised Code New Java implementations written in an accessible, modular programming style, where all of the code is exposed to the reader and ready to use. New versions of quicksort, LZW compression, red-black tree search, RE pattern matching, and many other algorithms. Engages with Applications Algorithms are studied in the context of important scientific, engineering, and commercial applications. Clients and algorithms are expressed in real code, not the pseudo-code found in many other books. Intellectually Stimulating Engages reader interest with clear, concise text, detailed examples with visuals, carefully crafted code, historical and scientific context, and exercises at all levels. A Scientific Approach Develops precise statements about performance, supported by appropriate mathematical models and empirical studies validating those models. Integrated with the Web Visit www.cs.princeton.edu/algs4 for a freely accessible, comprehensive Web site, including text digests, program code, test data, programming projects, exercises, lecture slides, and other resources. Product Description This fourth edition of Robert Sedgewick and Kevin Wayne?s Algorithms is the leading textbook on algorithms today and is widely used in colleges and universities worldwide. This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing -- including fifty algorithms every programmer should know. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use. The algorithms in this book represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering, not to mention students who use computation in the liberal arts. The companion web site, algs4.cs.princeton.edu contains An online synopsis Full Java implementations Test data Exercises and answers Dynamic visualizations Lecture slides Programming assignments with checklists Links to related material The MOOC related to this book is accessible via the ´´Online Course´´ link at algs4.cs.princeton.edu . The course offers more than 100 video lecture segments that are integrated with the text, extensive online assessments, and the large-scale discussion forums that have proven so valuable. Offered each fall and spring, this course regularly attracts tens of thousands of registrants. Robert Sedgewick and Kevin Wayne are developing a modern approach to disseminating knowledge that fully embraces technology, enabling people all around the world to discover new ways of learning and teaching. By integrating their textbook, online content, and MOOC, all at the state of the art, they have built a unique resource that greatly expands the breadth and depth of the educational experience. Features + Benefits The #1 practical resource for everyone seeking to run programs faster or solve larger problems Surveys today´s most useful algorithms, with copious illustrations and examples Contains many new examples, ranging from physics, biology, and engineering to data compression and web search Contains real (not pseudocode) implementations, with detailed performance insights A companion web site, algs4.cs.princeton.edu , with many more resources for instructors, including text digests, program code, test data, programming projects, exercises, lecture slides, and other resources Preface viii Chapter 1: Fundamentals 3 1.1 Basic Programming Model 8 1.2 Data Abstraction 64 1.3 Bags, Queues, and Stacks 120 1.4 Analysis of Algorithms 172 1.5 Case Study: Union-Find 216 Chapter 2: Sorting 243 2.1 Elementary Sorts 244 2.2 Mergesort 270 2.3 Quicksort 288 2.4 Priority Queues 308 2.5 Applications

Anbieter: buecher.de
Stand: 31.07.2019
Zum Angebot
Algorithm Design: Pearson New International Edi...
83,99 € *
ggf. zzgl. Versand

August 6, 2009 Author, Jon Kleinberg, was recently cited in the New York Times for his statistical analysis research in the Internet age. Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science. Features + Benefits Focus on problem analysis and design techniques. Discussion is grounded in concrete problems and examples rather than abstract presentation of principles, with representative problems woven throughout the text. Over 200 well crafted problems from companies such as Yahoo!® and Oracle®. Each problem has been class tested for usefulness and accuracy in the authors´ own undergraduate algorithms courses. Broad coverage of algorithms for dealing with NP-hard problems and the application of randomization, increasingly important topics in algorithms. Algorithm Design Jon Kleinberg and Eva Tardos Table of Contents 1 Introduction: Some Representative Problems 1.1 A First Problem: Stable Matching 1.2 Five Representative Problems Solved Exercises Excercises Notes and Further Reading 2 Basics of Algorithms Analysis 2.1 Computational Tractability 2.2 Asymptotic Order of Growth Notation 2.3 Implementing the Stable Matching Algorithm using Lists and Arrays 2.4 A Survey of Common Running Times 2.5 A More Complex Data Structure: Priority Queues Solved Exercises Exercises Notes and Further Reading 3 Graphs 3.1 Basic Definitions and Applications 3.2 Graph Connectivity and Graph Traversal 3.3 Implementing Graph Traversal using Queues and Stacks 3.4 Testing Bipartiteness: An Application of Breadth-First Search 3.5 Connectivity in Directed Graphs 3.6 Directed Acyclic Graphs and Topological Ordering Solved Exercises Exercises Notes and Further Reading 4 Divide and Conquer 4.1 A First Recurrence: The Mergesort Algorithm 4.2 Further Recurrence Relations 4.3 Counting Inversions 4.4 Finding the Closest Pair of Points 4.5 Integer Multiplication 4.6 Convolutions and The Fast Fourier Transform Solved Exercises Exercises Notes and Further Reading 5 Greedy Algorithms 5.1 Interval Scheduling: The Greedy Algorithm Stays Ahead 5.2 Scheduling to Minimize Lateness: An Exchange Argument 5.3 Optimal Caching: A More Complex Exchange Argument 5.4 Shortest Paths in a Graph 5.5 The Minimum Spanning Tree Problem 5.6 Implementing Kruskal´s Algorithm: The Union-Find Data Structure 5.7 Clustering 5.8 Huffman Codes and the Problem of Data Compression *5.9 Minimum-Cost Arborescences: A Multi-Phase Greedy Algorithm Solved Exercises Excercises Notes and Further Reading 6 Dynamic Programming 6.1 Weighted Interval Scheduling: A Recursive Procedure 6.2 Weighted Interval Scheduling: Iterating over Sub-Problems 6.3 Segmented Least Squares: Multi-way Choices 6.4 Subset Sums and Knapsacks: Adding a Variable 6.5 RNA Secondary Structure: Dynamic Programming Over Intervals 6.6 Sequence Alignment 6.7 Sequence Alignment in Linear Space 6.8 Shortest Paths in a Graph 6.9 Shortest Paths and Distance Vector Protocols *6.10 Negative Cycles in a Graph Solved Exercises Exercises Notes and Further Reading 7 Network Flow 7.1 The Maximum Flow Problem and the Ford-Fulkerson Algorithm 7.2 Maximum Flows and Minimum Cuts in a Network 7.3 Choosing Good Augmenting Paths *7.4 The Preflow-Push Maximum Flow Algorithm 7.5 A First Application: The Bipartite Matching Problem 7.6 Disjoint Paths in Directed and Undirected Graphs 7.7 Extensions to the Maximum Flow Problem 7.8 Survey Design 7.9 Airline Scheduling 7.10 Image Segmentation 7.11 Project Selection 7.12 Baseball Elimination *7.13 A Further Direction: Adding Costs to the Matching Problem Solved Exercises Exercises Notes and Further Reading 8 NP and Computational Intractability 8.1 Polynomial-Time Reductions 8.2 Reductions via ´´Gadgets´´: The Satisfiability Problem 8.3 Efficient Certification and the Definition of NP 8.4 NP-Complete Problems 8.5 Sequencing Problems 8.6 Partitioning Problems 8.7 Graph Coloring 8.8 Numerical Problems 8.9 Co-NP and the Asymmetry of NP 8.10 A Partial Taxonomy of Hard Problems Solved Exercises Exercises Notes and Further Reading 9 PSPACE: A Class of Problems Beyond NP 9.1 PSPACE 9.2 Some Hard Problems in PSPACE 9.3 Solving Quantified Problems and Games in Polynomial Space 9.4 Solving the Planning

Anbieter: buecher.de
Stand: 31.07.2019
Zum Angebot
Serious Python
21,99 € *
ggf. zzgl. Versand

An indispensable collection of practical tips and real-world advice for tackling common Python problems and taking your code to the next level. Features interviews with high-profile Python developers who share their tips, tricks, best practices, and real-world advice gleaned from years of experience. Sharpen your Python skills as you dive deep into the Python programming language with Serious Python. You´ll cover a range of advanced topics like multithreading and memorization, get advice from experts on things like designing APIs and dealing with databases, and learn Python internals to help you gain a deeper understanding of the language itself. Written for developers and experienced programmers, Serious Python brings together over 15 years of Python experience to teach you how to avoid common mistakes, write code more efficiently, and build better programs in less time. As you make your way through the book´s extensive tutorials, you´ll learn how to start a project and tackle topics like versioning, layouts, coding style, and automated checks. You´ll learn how to package your software for distribution, optimize performance, use the right data structures, define functions efficiently, pick the right libraries, build future-proof programs, and optimize your programs down to the bytecode. You´ll also learn how to: - Make and use effective decorators and methods, including abstract, static, and class methods - Employ Python for functional programming using generators, pure functions, and functional functions - Extend flake8 to work with the abstract syntax tree (AST) to introduce more sophisticated automatic checks into your programs - Apply dynamic performance analysis to identify bottlenecks in your code - Work with relational databases and effectively manage and stream data with PostgreSQL If you´ve been looking for a way to take your Python skills from good to great, Serious Python will help you get there. Learn from the experts and get seriously good at Python with Serious Python!

Anbieter: buecher.de
Stand: 11.08.2019
Zum Angebot
Binary Tree Becher
9,95 € *
zzgl. 4,95 € Versand

Dieses T-Shirt spielt darauf an, dass Informatiker auch mit Bäumen zu tun haben : Binärbäumen. Der Binärcode auf dem Shirt bedeutet deshalb: In computer science, a binary tree is a tree data structure. This binary tree is just a joke.

Anbieter: getDigital
Stand: 17.12.2018
Zum Angebot
Fair gehandeltes Öko-T-Shirt: Binary Tree
22,95 € *
zzgl. 4,95 € Versand

Dieser Baum ist eigentlich gar kein Binärbaum. Entschlüsselt man den Code der Blätter in der Baumkrone, wird einem klar warum. (In computer science, a binary tree is a tree data structure. This binary tree is just a joke :))

Anbieter: getDigital
Stand: 17.12.2018
Zum Angebot
Das Signal (1) (MP3-Download)
11,99 € *
ggf. zzgl. Versand

Ein mysteriöses Signal, ein Start-up, das die Welt verändern will und eine Zukunft, die nicht mehr uns gehört. Als in der Weite der finnischen Wälder ein Fremder mit einem High-Tech-Implantat gefunden wird, wittern der Neurochirurg Bill und sein Freund und Informatiker Steve die große Chance, ihrem Start-up zum Durchbruch zu verhelfen. Doch sie wissen nicht, mit welchen Mächten sie sich einlassen und müssen sich schon bald fragen, über welche Grenzen sie für ihren Erfolg bereit sind zu gehen. Zehn Jahre später hat sich die Welt verändert. Luftschiffe ziehen über den Himmel, fremde Pflanzen wachsen in den Wäldern und ganze Landstriche sind verlassen. Inmitten dieser fremden Welt kämpfen ein Vater und seine Tochter in den Bergen Montanas ums Überleben und darum, nicht von ´´den Anderen´´ entdeckt zu werden. Wenn sie noch eine Zukunft haben wollen, müssen sie herausfinden, was es mit dem mysteriösen Signal auf sich hat, das sie empfangen.

Anbieter: buecher.de
Stand: 31.07.2019
Zum Angebot