CHF 84.00

Practical Data Structures and Algorithms for Java Developers
From Fundamentals to Real-World Engineering Inglese · Tascabile

Spedizione di solito entro 6 a 7 settimane

Descrizione

Ulteriori informazioni

Master data structures and algorithms in Java through a practical, engineering-focused approach that goes beyond theory. With modern examples and a structured approach, this book emphasizes not only how algorithms work, but how to choose, adapt, and apply them in real-world systems.
To start, you will conquer fundamental concepts such as arrays and linked lists. From there, the book progresses through essential sorting and searching techniques such as QuickSort and Binary Search. Then, you will explore the implementation and use cases of stacks and queues, followed by tree and graph structures with traversal algorithms. The book ends with you tackling advanced topics, such as dynamic programming, tries, and advanced graph algorithms.
Finally, you will be ready to put your skills to the test and apply your knowledge in real-world situations for performance optimization.
What You Will Learn

  • Implement and optimize essential data structures in Java
  • Solve complex algorithmic problems with confidence
  • Master best practices for writing efficient, scalable Java code for enterprise applications
 

Info autore

Mikhail Davidovich is a Lead Java Engineer with more than 15 years of experience building scalable, high-performance systems using Java and related technologies. Throughout his career, he has worked on complex enterprise and distributed systems across multiple industries, focusing on performance, reliability, and maintainability.
In addition to hands-on software development, Mikhail actively participates in technical mentoring, knowledge sharing, and engineering education. He regularly speaks on back-end architecture, distributed systems, and modern Java development topics, helping developers bridge the gap between theoretical concepts and real-world engineering challenges.
Mikhail's expertise spans Java, Spring, cloud-native systems, microservices, distributed architectures, and performance optimization. Combining practical industry experience with a strong focus on engineering thinking, he brings a real-world perspective to the study of data structures and algorithms.

Riassunto

Master data structures and algorithms in Java through a practical, engineering-focused approach that goes beyond theory. With modern examples and a structured approach, this book emphasizes not only how algorithms work, but how to choose, adapt, and apply them in real-world systems.
To start, you will conquer fundamental concepts such as arrays and linked lists. From there, the book progresses through essential sorting and searching techniques such as QuickSort and Binary Search. Then, you will explore the implementation and use cases of stacks and queues, followed by tree and graph structures with traversal algorithms. The book ends with you tackling advanced topics, such as dynamic programming, tries, and advanced graph algorithms.
Finally, you will be ready to put your skills to the test and apply your knowledge in real-world situations for performance optimization.
What You Will Learn:

  • Implement and optimize essential data structures in Java
  • Solve complex algorithmic problems with confidence
  • Master best practices for writing efficient, scalable Java code for enterprise applications
Who This Book Is For: 
Java developers with a basic understanding of programming concepts who want to deepen their knowledge of data structures and algorithms. Secondary audiences include students, competitive programmers, and software engineers preparing for technical interviews.

Dettagli sul prodotto

Autori Mikhail Davidovich
Editore Springer, Berlin
 
Contenuto Libro
Forma del prodotto Tascabile
Data pubblicazione 26.12.2026
Categoria Scienze naturali, medicina, informatica, tecnica > Informatica, EDP > Linguaggi di programmazione
 
EAN 9798868830129
ISBN 9798868830129
Numero di pagine 162
Illustrazioni VI, 162 p. 79 illus., 9 illus. in color.
Dimensioni (della confezione) 17.8 x 25.4 cm
 
Categorie Java, Algorithmen und Datenstrukturen, Algorithms, Informationstheorie, Data Structures and Information Theory, dynamic programming, Performance optimization, Data Structures, Java Programming, recursion, Graph algorithms, sorting algorithms, technical interviews
 

Recensioni dei clienti

Per questo articolo non c'è ancora nessuna recensione. Scrivi la prima recensione e aiuta gli altri utenti a scegliere.

Scrivi una recensione

Top o flop? Scrivi la tua recensione.

Per i messaggi a CeDe.ch si prega di utilizzare il modulo di contatto.

I campi contrassegnati da * sono obbligatori.

Inviando questo modulo si accetta la nostra dichiarazione protezione dati.