Java 19: More algorithms and data structures
Software Development

Aún no ha sido puntuado
ISBN: 978-87-403-2619-2
1 edición
Páginas : 215
- Price: 129,00 kr
- Price: €13,99
- Price: £13,99
- Price: ₹250
- Price: $13,99
- Price: 129,00 kr
- Price: 129,00 kr
Descarga GRATIS tus ebooks en 4 sencillos pasos

Unlock your organization's learning potential
Corporate eLibrary
Discover our employee learning solutions
This is a Premium eBook
Bookboon Premium - Gain access to over 800 eBooks - without ads
You can get free access for a month to this - and 800 other books with the Premium Subscription. You can also buy the book below
- Start a 30-day free trial. After trial: 39,99 kr p/m
- Start a 30-day free trial. After trial: €5,99 p/m
- Start a 30-day free trial. After trial: £4,99 p/m
- Start a 30-day free trial. After trial: ₹299 p/m
- Start a 30-day free trial. After trial: $3,99 p/m
- Start a 30-day free trial. After trial: 39,99 kr p/m
- Start a 30-day free trial. After trial: 39,99 kr p/m


Unlock your organization's learning potential
Corporate eLibrary
Discover our employee learning solutions
Los usuarios que vieron este artículo también vieron
-
Java Data Structures and Algorithms
-
Introduction to Web Services with Java
-
The complete web developer Actionable steps to become a web developer & freelancer
-
Go Data Structures and Algorithms
-
Automating Openstack using PHP7
-
CryptoScience The Monies of Today and Tomorrow
-
Java 20: About the system development process Software Development
-
Java 18: Algorithms and data structures Software Development
Acerca del libro
Descripción
The book focus on algorithm paradigms including classic algorithms written in Java. Several data structures are described and implemented, including red-black binary tree, B-tree and B+ tree. A part of the book deals with graphs and classic graph.
Click here to download the source files from this book.
Contenido
- Foreword
- Introduction
- Greedy algorithms
- The load problem
- Exercise 1: The load problem
- Huffman codes
- The load problem
- Divide and conquer
- Closest-Points problem
- Problem 1: Implement the clocest-points problem
- Tower of Hanoi
- Closest-Points problem
- Dynamic programming
- The primes
- The 0/1 Knapsack problem
- Exercise 2: The KnapsackProgram
- The primes
- Backtracking
- Exercise 3: EightQueens, all solutions
- Permutations
- A DisjointSet
- A maze
- Exercise 3: EightQueens, all solutions
- Other algorithms
- Brute force algorithms
- Randomized algorithms
- Sudoku
- Brute force algorithms
- More about trees
- 2-3-4 tress
- Red-black tress
- Exercise 4: Test red-black tree
- General trees
- Exercice 5: Test a general tree
- A search tree
- B trees
- Exercise 6: Test BTree
- B+ trees
- Exercise 7: Test BTree2
- 2-3-4 tress
- Graphs
- Implementing graphs
- Exercise 8: Build a graph
- Problem 2: A dense graph
- GraphTools
- Traversing a graph
- Exercise 9: Traverse a graph
- Shortest path
- Exercise 10: Shortest paths
- Topological sort
- Exercise 11: GraphTester5
- Minimum spanning tree
- Exercise 12: Prim’s algorithms
- Implementing graphs
- Traveling salesman problem
- More on graphs
- More on complexities
- TSP algorithms
- Nearest-Neighbor
- More on graphs
- Final example: ActivityPlanner
- Task description
- Analysis
- The user interface
- Design
- Programmering
- Task description