Opis ebooka: Mastering Algorithms with C
There are many books on data structures and algorithms, including some with useful libraries of C functions. Mastering Algorithms with C offers you a unique combination of theoretical background and working code. With robust solutions for everyday programming tasks, this book avoids the abstract style of most classic data structures and algorithms texts, but still provides all of the information you need to understand the purpose and use of common programming techniques.
Implementations, as well as interesting, real-world examples of each data structure and algorithm, are included.
Using both a programming style and a writing style that are exceptionally clean, Kyle Loudon shows you how to use such essential data structures as lists, stacks, queues, sets, trees, heaps, priority queues, and graphs. He explains how to use algorithms for sorting, searching, numerical analysis, data compression, data encryption, common graph problems, and computational geometry. And he describes the relative efficiency of all implementations. The compression and encryption chapters not only give you working code for reasonably efficient solutions, they offer explanations of concepts in an approachable manner for people who never have had the time or expertise to study them in depth.
Anyone with a basic understanding of the C language can use this book. In order to provide maintainable and extendible code, an extra level of abstraction (such as pointers to functions) is used in examples where appropriate. Understanding that these techniques may be unfamiliar to some programmers, Loudon explains them clearly in the introductory chapters.
Contents include:
- Pointers
- Recursion
- Analysis of algorithms
- Data structures (lists, stacks, queues, sets, hash tables, trees, heaps, priority queues, graphs)
- Sorting and searching
- Numerical methods
- Data compression
- Data encryption
- Graph algorithms
- Geometric algorithms
Wybrane bestsellery
-
How do you create a mission-critical site that provides exceptional performance while remaining flexible, adaptable, and reliable 24/7? Written by the manager of a UI group at Yahoo!, Developing Large Web Applications offers practical steps for building rock-solid applications that remain effecti...(74.95 zł najniższa cena z 30 dni)
74.85 zł
119.00 zł(-37%) -
C++ is a complex language with many subtle facets. This is especially true when it comes to object-oriented and template programming. The C++ Pocket Reference is a memory aid for C++ programmers, enabling them to quickly look up usage and syntax for unfamiliar and infrequently used aspects of the...(51.24 zł najniższa cena z 30 dni)
76.87 zł
89.90 zł(-14%) -
Czy jesteś gotowy, aby wznieść swoje umiejętności programowania w Pythonie na zupełnie nowy poziom? Najnowsza publikacja renomowanego autora Kevina Clarksona to prawdziwa skarbnica wiedzy dla doświadczonych programistów, którzy pragną zgłębić najbardziej zaawansowane aspekty tego wszechstronnego ...
-
Jeśli chcesz po prostu zrozumieć działanie algorytmów, a nie masz ochoty na mozolne przedzieranie się przez setki trudnych stron, to trzymasz w ręku właściwą książkę! Dzięki temu interesującemu, przystępnemu podręcznikowi szybko przyswoisz sobie najważniejsze pojęcia i łatwo zrozumiesz, w jaki sp...(40.20 zł najniższa cena z 30 dni)
46.90 zł
67.00 zł(-30%) -
Unlock the power of C programming to embark on an epic journey of programming expertise with our comprehensive C programming book KEY FEATURES ? Get a solid foundation of C programming by learning the basic principles, including data types, variables, operators, and control structures. ? Hands-...(96.53 zł najniższa cena z 30 dni)
96.03 zł
109.00 zł(-12%) -
Unlock the power of C++ and enhance your algorithmic thinking with this course. From understanding basic operations to mastering complex structures, this course provides a structured pathway for new programmers. Start your coding journey today!
-
This course offers an in-depth introduction to Java and algorithmic thinking, ideal for beginners. Starting with fundamental computer concepts, it progresses through Java programming basics, & algorithmic principles, concluding with file management.
-
Explore the essentials of PHP programming and algorithmic concepts, starting from the basics. This course offers step-by-step guidance to help you understand how computers work, how to use development environments, and more.
Ebooka "Mastering Algorithms with C" przeczytasz na:
-
czytnikach Inkbook, Kindle, Pocketbook, Onyx Boox i innych
-
systemach Windows, MacOS i innych
-
systemach Windows, Android, iOS, HarmonyOS
-
na dowolnych urządzeniach i aplikacjach obsługujących formaty: PDF, EPub, Mobi
Masz pytania? Zajrzyj do zakładki Pomoc »
Audiobooka "Mastering Algorithms with C" posłuchasz:
-
w aplikacji Ebookpoint na Android, iOS, HarmonyOs
-
na systemach Windows, MacOS i innych
-
na dowolnych urządzeniach i aplikacjach obsługujących format MP3 (pliki spakowane w ZIP)
Masz pytania? Zajrzyj do zakładki Pomoc »
Kurs Video "Mastering Algorithms with C" zobaczysz:
-
w aplikacjach Ebookpoint i Videopoint na Android, iOS, HarmonyOs
-
na systemach Windows, MacOS i innych z dostępem do najnowszej wersji Twojej przeglądarki internetowej
Szczegóły ebooka
- ISBN Ebooka:
- 978-05-965-5195-7, 9780596551957
- Data wydania ebooka:
- 2009-02-09 Data wydania ebooka często jest dniem wprowadzenia tytułu do sprzedaży i może nie być równoznaczna z datą wydania książki papierowej. Dodatkowe informacje możesz znaleźć w darmowym fragmencie. Jeśli masz wątpliwości skontaktuj się z nami sklep@ebookpoint.pl.
- Język publikacji:
- angielski
- Rozmiar pliku ePub:
- 2.7MB
- Rozmiar pliku Mobi:
- 7.2MB
Spis treści ebooka
- Mastering Algorithms with C
- A Note Regarding Supplemental Files
- Preface
- Organization
- Part I
- Part II
- Part III
- Organization
- Key Features
- About the Code
- Conventions
- How to Contact Us
- Acknowledgments
- I. Preliminaries
- 1. Introduction
- 1.1. An Introduction to Data Structures
- 1.2. An Introduction to Algorithms
- 1.2.1. General Approaches in Algorithm Design
- 1.2.1.1. Randomized algorithms
- 1.2.1.2. Divide-and-conquer algorithms
- 1.2.1.3. Dynamic-programming solutions
- 1.2.1.4. Greedy algorithms
- 1.2.1.5. Approximation algorithms
- 1.2.1. General Approaches in Algorithm Design
- 1.3. A Bit About Software Engineering
- 1.4. How to Use This Book
- 1. Introduction
- 2. Pointer Manipulation
- 2.1. Pointer Fundamentals
- 2.2. Storage Allocation
- 2.3. Aggregates and Pointer Arithmetic
- 2.3.1. Structures
- 2.3.2. Arrays
- 2.4. Pointers as Parameters to Functions
- 2.4.1. Call-by-Reference Parameter Passing
- 2.4.2. Pointers to Pointers as Parameters
- 2.5. Generic Pointers and Casts
- 2.5.1. Generic Pointers
- 2.5.2. Casts
- 2.6. Function Pointers
- 2.7. Questions and Answers
- 2.8. Related Topics
- 3. Recursion
- 3.1. Basic Recursion
- 3.2. Tail Recursion
- 3.3. Questions and Answers
- 3.4. Related Topics
- 4. Analysis of Algorithms
- 4.1. Worst-Case Analysis
- 4.1.1. Reasons for Worst-Case Analysis
- 4.1. Worst-Case Analysis
- 4.2. O-Notation
- 4.2.1. Simple Rules for O-Notation
- 4.2.2. O-Notation Example and Why It Works
- 4.3. Computational Complexity
- 4.4. Analysis Example: Insertion Sort
- 4.5. Questions and Answers
- 4.6. Related Topics
- II. Data Structures
- 5. Linked Lists
- 5.1. Description of Linked Lists
- 5.2. Interface for Linked Lists
- list_init
- list_destroy
- list_ins_next
- list_rem_next
- list_size
- list_head
- list_tail
- list_is_head
- list_is_tail
- list_data
- list_next
- 5.3. Implementation and Analysis of Linked Lists
- 5.3.1. list_init
- 5.3.2. list_destroy
- 5.3.3. list_ins_next
- 5.3.4. list_rem_next
- 5.3.5. list_size, list_head, list_tail, list_is_tail,list_data, and list_next
- 5. Linked Lists
- 5.4. Linked List Example: Frame Management
- 5.5. Description of Doubly-Linked Lists
- 5.6. Interface for Doubly-Linked Lists
- dlist_init
- dlist_destroy
- dlist_ins_next
- dlist_ins_prev
- dlist_remove
- dlist_size
- dlist_head
- dlist_tail
- dlist_is_head
- dlist_is_tail
- dlist_data
- dlist_next
- dlist_prev
- 5.7. Implementation and Analysis of Doubly Linked Lists
- 5.7.1. dlist_init
- 5.7.2. dlist_destroy
- 5.7.3. dlist_ins_next
- 5.7.4. dlist_ins_ prev
- 5.7.5. dlist_remove
- 5.7.6. dlist_size, dlist_head, dlist_tail, dlist_is_head, dlist_is_tail, dlist_data, dlist_next, and dlist_ prev
- 5.8. Description of Circular Lists
- 5.9. Interface for Circular Lists
- clist_init
- clist_destroy
- clist_ins_next
- clist_rem_next
- clist_size
- clist_head
- clist_data
- clist_next
- 5.10. Implementation and Analysis of Circular Lists
- 5.10.1. clist_init
- 5.10.2. clist_destroy
- 5.10.3. clist_ins_next
- 5.10.4. clist_rem_next
- 5.10.5. clist_size, clist_head, clist_data, and clist_next
- 5.11. Circular List Example: Second-Chance Page Replacement
- 5.12. Questions and Answers
- 5.13. Related Topics
- 6. Stacks and Queues
- 6.1. Description of Stacks
- 6.2. Interface for Stacks
- stack_init
- stack_destroy
- stack_ push
- stack_ pop
- stack_ peek
- stack_size
- 6.3. Implementation and Analysis of Stacks
- 6.3.1. stack_init
- 6.3.2. stack_destroy
- 6.3.3. stack_ push
- 6.3.4. stack_ pop
- 6.3.5. stack_ peek, stack_size
- 6.4. Description of Queues
- 6.5. Interface for Queues
- queue_init
- queue_destroy
- queue_enqueue
- queue_dequeue
- queue_ peek
- queue_size
- 6.6. Implementation and Analysis of Queues
- 6.6.1. queue_init
- 6.6.2. queue_destroy
- 6.6.3. queue_enqueue
- 6.6.4. queue_dequeue
- 6.6.5. queue_ peek, queue_size
- 6.7. Queue Example: Event Handling
- 6.8. Questions and Answers
- 6.9. Related Topics
- 7. Sets
- 7.1. Description of Sets
- 7.1.1. Definitions
- 7.1.2. Basic Operations
- 7.1.3. Properties
- 7.1. Description of Sets
- 7.2. Interface for Sets
- set_init
- set_destroy
- set_insert
- set_remove
- set_union
- set_intersection
- set_difference
- set_is_member
- set_is_subset
- set_is_equal
- set_size
- 7.3. Implementation and Analysis of Sets
- 7.3.1. set_init
- 7.3.2. set_destroy
- 7.3.3. set_insert
- 7.3.4. set_remove
- 7.3.5. set_union
- 7.3.6. set_intersection
- 7.3.7. set_difference
- 7.3.8. set_is_member
- 7.3.9. set_is_subset
- 7.3.10. set_is_equal
- 7.3.11. set_size
- 7.4. Set Example: Set Covering
- 7.5. Questions and Answers
- 7.6. Related Topics
- 8. Hash Tables
- 8.1. Description of Chained Hash Tables
- 8.1.1. Collision Resolution
- 8.1.2. Selecting a Hash Function
- 8.1.2.1. Division method
- 8.1.2.2. Multiplication method
- 8.1. Description of Chained Hash Tables
- 8.2. Interface for Chained Hash Tables
- chtbl_init
- chtbl_destroy
- chtbl_insert
- chtbl_remove
- chtbl_lookup
- chtbl_size
- 8.3. Implementation and Analysis of Chained Hash Tables
- 8.3.1. chtbl_init
- 8.3.2. chtbl_destroy
- 8.3.3. chtbl_insert
- 8.3.4. chtbl_remove
- 8.3.5. chtbl_lookup
- 8.3.6. chtbl_size
- 8.4. Chained Hash Table Example: Symbol Tables
- 8.5. Description of Open-Addressed Hash Tables
- 8.5.1. Collision Resolution
- 8.5.1.1. Linear probing
- 8.5.1.2. Double hashing
- 8.5.1. Collision Resolution
- 8.6. Interface for Open-Addressed Hash Tables
- ohtbl_init
- ohtbl_destroy
- ohtbl_insert
- ohtbl_remove
- ohtbl_lookup
- ohtbl_size
- 8.7. Implementation and Analysisof Open Addressed Hash Tables
- 8.7.1. ohtbl_init
- 8.7.2. ohtbl_destroy
- 8.7.3. ohtbl_insert
- 8.7.4. ohtbl_remove
- 8.7.5. ohtbl_lookup
- 8.7.6. ohtbl_size
- 8.8. Questions and Answers
- 8.9. Related Topics
- 9. Trees
- 9.1. Description of Binary Trees
- 9.1.1. Traversal Methods
- 9.1.1.1. Preorder traversal
- 9.1.1.2. Inorder traversal
- 9.1.1.3. Postorder traversal
- 9.1.1.4. Level-order traversal
- 9.1.1. Traversal Methods
- 9.1.2. Tree Balancing
- 9.1. Description of Binary Trees
- 9.2. Interface for Binary Trees
- bitree_init
- bitree_destroy
- bitree_ins_left
- bitree_ins_right
- bitree_rem_left
- bitree_rem_right
- bitree_merge
- bitree_size
- bitree_root
- bitree_is_eob
- bitree_is_leaf
- bitree_data
- bitree_left
- bitree_right
- 9.3. Implementation and Analysis of Binary Trees
- 9.3.1. bitree_init
- 9.3.2. bitree_destroy
- 9.3.3. bitree_ins_left
- 9.3.4. bitree_ins_right
- 9.3.5. bitree_rem_left
- 9.3.6. bitree_rem_right
- 9.3.7. bitree_merge
- 9.3.8. bitree_size, bitree_root, bitree_is_eob, bitree_is_leaf, bitree_data, bitree_left, bitree_right
- 9.4. Binary Tree Example: Expression Processing
- 9.5. Description of Binary Search Trees
- 9.6. Interface for Binary Search Trees
- bistree_init
- bistree_destroy
- bistree_insert
- bistree_remove
- bistree_lookup
- bistree_size
- 9.7. Implementation and Analysis of Binary Search Trees
- 9.7.1. Rotations in AVL Trees
- 9.7.1.1. LL rotation
- 9.7.1.2. LR rotation
- 9.7.1.3. RR rotation
- 9.7.1.4. RL rotation
- 9.7.1. Rotations in AVL Trees
- 9.7.2. bistree_init
- 9.7.3. bistree_destroy
- 9.7.4. bistree_insert
- 9.7.5. bistree_remove
- 9.7.6. bistree_lookup
- 9.7.7. bistree_size
- 9.8. Questions and Answers
- 9.9. Related Topics
- 10. Heaps and Priority Queues
- 10.1. Description of Heaps
- 10.2. Interface for Heaps
- heap_init
- heap_destroy
- heap_insert
- heap_extract
- heap_size
- 10.3. Implementation and Analysis of Heaps
- 10.3.1. heap_init
- 10.3.2. heap_destroy
- 10.3.3. heap_insert
- 10.3.4. heap_extract
- 10.3.5. heap_size
- 10.4. Description of Priority Queues
- 10.5. Interface for Priority Queues
- pqueue_init
- pqueue_destroy
- pqueue_insert
- pqueue_extract
- pqueue_ peek
- pqueue_size
- 10.6. Implementation and Analysis of Priority Queues
- 10.7. Priority Queue Example: Parcel Sorting
- 10.8. Questions and Answers
- 10.9. Related Topics
- 11. Graphs
- 11.1. Description of Graphs
- 11.1.1. Search Methods
- 11.1.1.1. Breadth-first search
- 11.1.1.2. Depth-first search
- 11.1.1. Search Methods
- 11.1. Description of Graphs
- 11.2. Interface for Graphs
- graph_init
- graph_destroy
- graph_ins_vertex
- graph_ins_edge
- graph_rem_vertex
- graph_rem_edge
- graph_adjlist
- graph_is_adjacent
- graph_adjlists
- graph_vcount
- graph_ecount
- 11.3. Implementation and Analysis of Graphs
- 11.3.1. graph_init
- 11.3.2. graph_destroy
- 11.3.3. graph_ins_vertex
- 11.3.4. graph_ins_edge
- 11.3.5. graph_rem_vertex
- 11.3.6. graph_rem_edge
- 11.3.7. graph_adjlist
- 11.3.8. graph_is_adjacent
- 11.3.9. graph_adjlists, graph_vcount, graph_ecount
- 11.4. Graph Example: Counting Network Hops
- 11.5. Graph Example: Topological Sorting
- 11.6. Questions and Answers
- 11.7. Related Topics
- III. Algorithms
- 12. Sorting and Searching
- 12.1. Description of Insertion Sort
- 12.2. Interface for Insertion Sort
- issort
- 12.3. Implementation and Analysis of Insertion Sort
- 12.4. Description of Quicksort
- 12.5. Interface for Quicksort
- qksort
- 12. Sorting and Searching
- 12.6. Implementation and Analysis of Quicksort
- 12.7. Quicksort Example: Directory Listings
- 12.8. Description of Merge Sort
- 12.9. Interface for Merge Sort
- mgsort
- 12.10. Implementation and Analysis of Merge Sort
- 12.11. Description of Counting Sort
- 12.12. Interface for Counting Sort
- ctsort
- 12.13. Implementation and Analysis of Counting Sort
- 12.14. Description of Radix Sort
- 12.15. Interface for Radix Sort
- rxsort
- 12.16. Implementation and Analysis of Radix Sort
- 12.17. Description of Binary Search
- 12.18. Interface for Binary Search
- bisearch
- 12.19. Implementation and Analysis of Binary Search
- 12.20. Binary Search Example: Spell Checking
- 12.21. Questions and Answers
- 12.22. Related Topics
- 13. Numerical Methods
- 13.1. Description of Polynomial Interpolation
- 13.1.1. Constructing an Interpolating Polynomial
- 13.1.2. Evaluating an Interpolating Polynomial
- 13.1. Description of Polynomial Interpolation
- 13.2. Interface for Polynomial Interpolation
- interpol
- 13.3. Implementation and Analysis of Polynomial Interpolation
- 13.4. Description of Least-Squares Estimation
- 13.5. Interface for Least-Squares Estimation
- lsqe
- 13.6. Implementation and Analysis of Least-Squares Estimation
- 13.7. Description of the Solution of Equations
- 13.7.1. Finding Roots with Newtons Method
- 13.7.2. Computing the Derivative of a Polynomial
- 13.7.3. Understanding the First and Second Derivative
- 13.7.4. Selecting an Initial Point for Newtons Method
- 13.7.5. How Newtons Method Works
- 13.8. Interface for the Solution of Equations
- root
- 13.9. Implementation and Analysis of the Solution of Equations
- 13.10. Questions and Answers
- 13.11. Related Topics
- 14. Data Compression
- 14.1. Description of Bit Operations
- 14.2. Interface for Bit Operations
- bit_ get
- bit_set
- bit_xor
- bit_rot_left
- 14.3. Implementation and Analysis of Bit Operations
- 14.3.1. bit_ get
- 14.3.2. bit_set
- 14.3.3. bit_xor
- 14.3.4. bit_rot_left
- 14.4. Description of Huffman Coding
- 14.4.1. Entropy and Minimum Redundancy
- 14.4.2. Building a Huffman Tree
- 14.4.3. Compressing and Uncompressing Data
- 14.4.4. Effectiveness of Huffman Coding
- 14.5. Interface for Huffman Coding
- huffman_compress
- huffman_uncompress
- 14.6. Implementation and Analysis of Huffman Coding
- 14.6.1. huffman_compress
- 14.6.2. huffman_uncompress
- 14.7. Huffman Coding Example: Optimized Networking
- 14.8. Description of LZ77
- 14.8.1. Maintaining a Dictionary of Phrases
- 14.8.2. Compressing and Uncompressing Data
- 14.8.3. Effectiveness of LZ77
- 14.9. Interface for LZ77
- lz77_compress
- lz77_uncompress
- 14.10. Implementation and Analysis of LZ77
- 14.10.1. lz77_compress
- 14.10.2. lz77_uncompress
- 14.11. Questions and Answers
- 14.12. Related Topics
- 15. Data Encryption
- 15.1. Description of DES
- 15.1.1. Computing Subkeys
- 15.1.2. Enciphering and Deciphering Data Blocks
- 15.1. Description of DES
- 15.2. Interface for DES
- des_encipher
- des_decipher
- 15.3. Implementation and Analysis of DES
- 15.3.1. des_encipher
- 15.3.2. des_decipher
- 15.4. DES Example: Block Cipher Modes
- 15.5. Description of RSA
- 15.5.1. Computing Public and Private Keys
- 15.5.2. Enciphering and Deciphering Data Blocks
- 15.6. Interface for RSA
- rsa_encipher
- rsa_decipher
- 15.7. Implementation and Analysis of RSA
- 15.7.1. rsa_encipher
- 15.7.2. rsa_decipher
- 15.8. Questions and Answers
- 15.9. Related Topics
- 16. Graph Algorithms
- 16.1. Description of Minimum Spanning Trees
- 16.1.1. Prims Algorithm
- 16.1. Description of Minimum Spanning Trees
- 16.2. Interface for Minimum Spanning Trees
- mst
- 16.3. Implementation and Analysis of Minimum Spanning Trees
- 16.4. Description of Shortest Paths
- 16.4.1. Dijkstras Algorithm
- 16.5. Interface for Shortest Paths
- shortest
- 16.6. Implementation and Analysis of Shortest Paths
- 16.7. Shortest Paths Example: Routing Tables
- 16.8. Description of the Traveling-Salesman Problem
- 16.8.1. Applying the Nearest-Neighbor Heuristic
- 16.9. Interface for the Traveling-Salesman Problem
- tsp
- 16.10. Implementation and Analysis of the Traveling-Salesman Problem
- 16.11. Questions and Answers
- 16.12. Related Topics
- 17. Geometric Algorithms
- 17.1. Description of Testing Whether Line Segments Intersect
- 17.1.1. Standard Test for Intersecting Line Segments
- 17.1.2. Computer Test for Intersecting Line Segments
- 17.1. Description of Testing Whether Line Segments Intersect
- 17.2. Interface for Testing Whether Line Segments Intersect
- lint
- 17.3. Implementation and Analysis of Testing Whether Line Segments Intersect
- 17.4. Description of Convex Hulls
- 17.4.1. Jarviss March
- 17.5. Interface for Convex Hulls
- cvxhull
- 17.6. Implementation and Analysis of Convex Hulls
- 17.7. Description of Arc Length on Spherical Surfaces
- 17.7.1. Rectilinear and Spherical Coordinates
- 17.7.2. Converting Between Coordinate Systems
- 17.7.3. Computing the Length of an Arc
- 17.8. Interface for Arc Length on Spherical Surfaces
- arclen
- 17.9. Implementation and Analysis of Arc Length on Spherical Surfaces
- 17.10. Arc Length Example: Approximating Distances on Earth
- 17.11. Questions and Answers
- 17.12. Related Topics
- Index
- About the Author
- Colophon
- Copyright
O'Reilly Media - inne książki
-
Large language models (LLMs) and generative AI are rapidly changing the healthcare industry. These technologies have the potential to revolutionize healthcare by improving the efficiency, accuracy, and personalization of care. This practical book shows healthcare leaders, researchers, data scient...(149.84 zł najniższa cena z 30 dni)
149.79 zł
199.00 zł(-25%) -
With hundreds of tools preinstalled, the Kali Linux distribution makes it easier for security professionals to get started with security testing quickly. But with more than 600 tools in its arsenal, Kali Linux can also be overwhelming. The new edition of this practical book covers updates to the ...(162.16 zł najniższa cena z 30 dni)
161.66 zł
209.00 zł(-23%) -
Learn how to implement and manage a modern customer data platform (CDP) through the Salesforce Data Cloud platform. This practical book provides a comprehensive overview that shows architects, administrators, developers, data engineers, and marketers how to ingest, store, and manage real-time cus...(185.73 zł najniższa cena z 30 dni)
185.63 zł
249.00 zł(-25%) -
Real-time applications are becoming the norm today. But building a model that works properly requires real-time data from the source, in-flight stream processing, and low latency serving of its analytics. With this practical book, data engineers, data architects, and data analysts will learn how ...(210.15 zł najniższa cena z 30 dni)
209.65 zł
279.00 zł(-25%) -
Methods of delivering software are constantly evolving in order to increase speed to market without sacrificing reliability and stability. Mastering development end to end, from version control to production, and building production-ready code is now more important than ever. Continuous deploymen...(171.52 zł najniższa cena z 30 dni)
171.42 zł
239.00 zł(-28%) -
As the transformation to hybrid multicloud accelerates, businesses require a structured approach to securing their workloads. Adopting zero trust principles demands a systematic set of practices to deliver secure solutions. Regulated businesses, in particular, demand rigor in the architectural pr...(153.28 zł najniższa cena z 30 dni)
153.23 zł
209.00 zł(-27%) -
This concise yet comprehensive guide explains how to adopt a data lakehouse architecture to implement modern data platforms. It reviews the design considerations, challenges, and best practices for implementing a lakehouse and provides key insights into the ways that using a lakehouse can impact ...(181.58 zł najniższa cena z 30 dni)
181.48 zł
249.00 zł(-27%) -
In today's fast-paced world, more and more organizations require rapid application development with reduced development costs and increased productivity. This practical guide shows application developers how to use PowerApps, Microsoft's no-code/low-code application framework that helps developer...(150.57 zł najniższa cena z 30 dni)
150.52 zł
209.00 zł(-28%) -
Welcome to the systems age, where software professionals are no longer building software&emdash;we're building systems of software. Change is continuously deployed across software ecosystems coordinated by responsive infrastructure. In this world of increasing relational complexity, we need t...(140.94 zł najniższa cena z 30 dni)
140.89 zł
209.00 zł(-33%) -
This book provides an ideal guide for Python developers who want to learn how to build applications with large language models. Authors Olivier Caelen and Marie-Alice Blete cover the main features and benefits of GPT-4 and GPT-3.5 models and explain how they work. You'll also get a step-by-step g...(142.83 zł najniższa cena z 30 dni)
142.63 zł
209.00 zł(-32%)
Dzieki opcji "Druk na żądanie" do sprzedaży wracają tytuły Grupy Helion, które cieszyły sie dużym zainteresowaniem, a których nakład został wyprzedany.
Dla naszych Czytelników wydrukowaliśmy dodatkową pulę egzemplarzy w technice druku cyfrowego.
Co powinieneś wiedzieć o usłudze "Druk na żądanie":
- usługa obejmuje tylko widoczną poniżej listę tytułów, którą na bieżąco aktualizujemy;
- cena książki może być wyższa od początkowej ceny detalicznej, co jest spowodowane kosztami druku cyfrowego (wyższymi niż koszty tradycyjnego druku offsetowego). Obowiązująca cena jest zawsze podawana na stronie WWW książki;
- zawartość książki wraz z dodatkami (płyta CD, DVD) odpowiada jej pierwotnemu wydaniu i jest w pełni komplementarna;
- usługa nie obejmuje książek w kolorze.
Masz pytanie o konkretny tytuł? Napisz do nas: sklep[at]helion.pl.
Książka, którą chcesz zamówić pochodzi z końcówki nakładu. Oznacza to, że mogą się pojawić drobne defekty (otarcia, rysy, zagięcia).
Co powinieneś wiedzieć o usłudze "Końcówka nakładu":
- usługa obejmuje tylko książki oznaczone tagiem "Końcówka nakładu";
- wady o których mowa powyżej nie podlegają reklamacji;
Masz pytanie o konkretny tytuł? Napisz do nas: sklep[at]helion.pl.
Książka drukowana
Oceny i opinie klientów: Mastering Algorithms with C Kyle Loudon (0) Weryfikacja opinii następuję na podstawie historii zamówień na koncie Użytkownika umieszczającego opinię. Użytkownik mógł otrzymać punkty za opublikowanie opinii uprawniające do uzyskania rabatu w ramach Programu Punktowego.