Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Shelter Island, NY : Manning Publication Co.
    ISBN: 9781633438385 , 1633438384 , 9781638359999 , 1638359997
    Language: English
    Pages: 1 online resource (xx, 305 pages) , illustrations
    Parallel Title: Erscheint auch als
    DDC: 005.13/3
    Keywords: Go (Computer program language) ; Computer programming ; Computer multitasking ; Go (Langage de programmation) ; Programmation (Informatique) ; Fonctionnement multitâche ; computer programming
    Abstract: Learn Concurrent Programming with Go teaches readers how to boost the performance of their systems through the power of concurrent programming. It demystifies concurrency, explaining complex topics using simple language, easy-to-follow visuals, and relevant examples readers will face every day as a developer. Suitable for programmers who already know the basics of Go or another C-style language.
    Note: Includes index
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    [Place of publication not identified] : Packt
    ISBN: 9781788474887
    Language: English
    Pages: 1 online resource (1 streaming video file (3 hr., 39 min., 37 sec.)) , digital, sound, color
    Keywords: Scala (Computer program language) ; Computer algorithms ; Data structures (Computer science) ; Functional programming (Computer science) ; Electronic videos ; local
    Abstract: "Scala's functional programming features are a boon to help you design 'easy to reason about' systems to control growing software complexities. In this course, you will look at some classic simple algorithms. Most algorithms are traditionally defined in an imperative manner, typically consisting of repetitions in the form of conditional looping and altering states. Writing these in a functional manner is not always a trivial process. Moving ahead, you will learn to implement these elementary algorithms using a combination of functional concepts instead of the traditional imperative approach. After covering the important functional concepts in Scala you will move on to the decimal to binary conversion and generate sequences algorithms. Further, we will look at implementing a series of algorithms such as generating prime numbers, divide and conquer, greedy algorithms, and functional infix to postfix conversion. By the end of this course, you will be well versed in the functional concepts of Scala and would have implemented all of these."--Resource description page.
    Note: Title from title screen (viewed March 1, 2019). - Date of publication from resource description page
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    ISBN: 9781789533750 , 1789533759
    Language: English
    Pages: 1 online resource (1 volume) , illustrations
    Keywords: Java (Computer program language) ; Data structures (Computer science) ; Computer algorithms ; Electronic books ; Electronic books ; local
    Abstract: Though your application serves its purpose, it might not be a high performer. Learn techniques to accurately predict code efficiency, easily dismiss inefficient solutions, and improve the performance of your application. Key Features Explains in detail different algorithms and data structures with sample problems and Java implementations where appropriate Includes interesting tips and tricks that enable you to efficiently use algorithms and data structures Covers over 20 topics using 15 practical activities and exercises Book Description Learning about data structures and algorithms gives you a better insight on how to solve common programming problems. Most of the problems faced everyday by programmers have been solved, tried, and tested. By knowing how these solutions work, you can ensure that you choose the right tool when you face these problems. This book teaches you tools that you can use to build efficient applications. It starts with an introduction to algorithms and big O notation, later explains bubble, merge, quicksort, and other popular programming patterns. You'll also learn about data structures such as binary trees, hash tables, and graphs. The book progresses to advanced concepts, such as algorithm design paradigms and graph theory. By the end of the book, you will know how to correctly implement common algorithms and data structures within your applications. What you will learn Understand some of the fundamental concepts behind key algorithms Express space and time complexities using Big O notation. Correctly implement classic sorting algorithms such as merge and quicksort Correctly implement basic and complex data structures Learn about different algorithm design paradigms, such as greedy, divide and conquer, and dynamic programming Apply powerful string matching techniques and optimize your application logic Master graph representations and learn about different graph algorithms Who this book is for If you want to better understand common data structures and algorithms by following code examples in Java and improve your application efficiency, then this is the book for you. It helps to have basic knowledge of Java, mathematics and object-oriented programming techniques.
    Note: Description based on online resource; title from title page (Safari, viewed September 5, 2018)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    [Place of publication not identified] : Packt
    ISBN: 9781788476850
    Language: English
    Pages: 1 online resource (1 streaming video file (5 hr., 16 min., 57 sec.)) , digital, sound, color
    Keywords: Scala (Computer program language) ; Computer algorithms ; Data structures (Computer science) ; Functional programming (Computer science) ; Electronic videos ; local
    Abstract: "Scala's functional programming features are a boon when it comes to designing easy-to-reason-about systems to curb growing software complexities. In this course, we will learn about many concepts and tools available in the Scala language by implementing, in a functional manner, some sorting and searching algorithms. Most algorithms are traditionally defined in an imperative manner, typically consisting of repetitions in the form of conditional looping and altering states. Writing these in a functional manner is not always a trivial process. In this course, we will do just that. We will also show how to implement search data structures in a functional and immutable manner. We will look at number sorting, substring searches, hash tables, red black binary trees, and the closest pair algorithm. Along the way, we will talk about bubble sort, merge sort, Knuth-Morris-Pratt string searching, structural sharing in functional data structures, and various problems with immutable data structures. Further, we will explore the classic closest pair algorithm and show how we can solve the problem efficiently in a functional manner. By the end of the course, you will have gained a thorough knowledge of many functional Scala concepts and will understand these algorithms and data structures."--Resource description page.
    Note: Title from title screen (viewed July 30, 2018). - Date of publication from resource description page
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    [Place of publication not identified] : Packt
    ISBN: 9781788472364
    Language: English
    Pages: 1 online resource (1 streaming video file (3 hr., 35 min., 49 sec.)) , digital, sound, color
    Keywords: Scala (Computer program language) ; Computer algorithms ; Graph theory ; Data structures (Computer science) ; Functional programming (Computer science) ; Electronic videos ; local
    Abstract: "Scala's functional programming features are a boon to help you design "easy to reason about" systems to control growing software complexities.In this course we practice many functional techniques by solving various graph problems. We start by looking at how we can represent graph structures in an efficient functional manner. Then we explore both the breadth and depth first search graph traversal techniques. Later we use this techniques to show how they can be used for topological sorting and cycle detection. In this course we also describe more complex algorithms such as finding the shortest path and maximal flow networks. All of these solutions are illustrated with easy to understand diagrams and animations. Special care is taken when writing solution so that the principles of functional programming are followed. By the end of the course, you will be well-versed in all the functional concepts of Scala and you will have refreshed your knowledge of graph algorithms."--Resource description page.
    Note: Title from title screen (viewed August 15, 2018). - Date of publication from resource description page
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    [Place of publication not identified] : Manning Publications
    Language: English
    Pages: 1 online resource (1 sound file (8 hr., 19 min.))
    Edition: [First edition].
    DDC: 005.13/3
    Keywords: Go (Computer program language) ; Computer programming ; Computer multitasking ; Go (Langage de programmation) ; Programmation (Informatique) ; Fonctionnement multitâche ; computer programming ; Audiobooks ; Livres audio
    Abstract: Concurrency doesn't need to be confusing. Start writing concurrent code that improves performance, scales up to handle large volumes of data, and takes full advantage of modern multi-processor hardware. Too many developers think concurrency is extremely challenging. Learn Concurrent Programming with Go is here to prove them wrong! This book uses the easy-to-grasp concurrency tools of the Go language to demonstrate principles and techniques, steadily teaching you the best practices of effective concurrency. Techniques learned in this book can be applied to other languages. In Learn Concurrent Programming with Go you will learn how to: Implement effective concurrency for more responsive, higher performing, scalable software Avoid common concurrency problems such as deadlocks and race conditions Manage concurrency using goroutines, mutexes, readers-writer locks, and more Identify concurrency patterns such as pipelining, worker pools, and message passing Discover advantages, limits, and properties of parallel computing Improve your Go coding skills with advanced multithreading topics Concurrent programming allows multiple tasks to execute and interact simultaneously, speeding up performance and reducing user wait time. In Learn Concurrent Programming with Go, you'll discover universal principles of concurrency, along with how to use them for a performance boost in your Go applications. Expert author James Cutajar starts with the basics of modeling concurrency in your programs, demonstrates differences between message passing and memory sharing, and even introduces advanced topics such as atomic variables and futexes. About the Technology You can improve almost any application's performance and responsiveness by introducing concurrency into the codebase. This book will show you how! It starts with the basics of concurrent programming and builds your skills step by step by exploring scenarios you'll face every day as a developer. Author James Cutajar explains each aspect of concurrency in plain language using the intuitive features baked into the Go language. About the Book Learn Concurrent Programming with Go provides a practical, hands-on introduction to creating software for modern multiprocessor systems. In it, you'll learn how to divide larger programming tasks into independent parts that can run simultaneously. You'll use the Go language to implement common concurrency patterns by utilizing readers-writer locks, semaphores, message passing, and memory sharing. The skills you learn will easily transfer to other languages. What's Inside Prevent deadlocks and race conditions Go concurrency features like goroutines, mutexes, channels, and more Concurrency patterns including pipelining and worker pools About the Reader For programmers with basic knowledge of Go or another C-style language. No experience in concurrent programming required. About the Author James Cutajar has been programming for more than 20 years. He's an open source contributor, blogger, tech evangelist, Udemy instructor, and author. Quotes Concurrency is a notoriously difficult, but important, topic. This book will make it all clear! - Allen B. Downey, author of The Little Book of Semaphores, Think Python, and Probably Overthinking It This is the book I was looking for. It explains the necessary building blocks with easy-to-understand examples. Excellent! - Arne Claus, trivago Uncover the beauty of concurrency, where logic dances with elegance. - Jasmeet Singh, Hashicorp A powerhouse of a book! It lays the foundation for understanding concurrency in any language. - Nathan B. Crocker, Galaxy Digital LP.
    Note: Online resource; title from title details screen (O'Reilly, viewed March 4, 2024)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...