Beginning Data Structures and Algorithms in Java / Najlacnejšie knihy
Beginning Data Structures and Algorithms in Java

Kód: 05074113

Beginning Data Structures and Algorithms in Java

Autor B. M. Harwani

Data structures provide a way of storing and organizing data so that it can be used efficiently. Beginning Data Structures in Java provides Java developers at any level a thorough overview of data structures, and equips them with ... celý popis

45.66


Očakávaná novinka
Termín neznámy

Informovať o naskladnení

Pridať medzi želanie

Mohlo by sa vám tiež páčiť

Darujte túto knihu ešte dnes
  1. Objednajte knihu a vyberte Zaslať ako darček.
  2. Obratom obdržíte darovací poukaz na knihu, ktorý môžete ihneď odovzdať obdarovanému.
  3. Knihu zašleme na adresu obdarovaného, o nič sa nestaráte.

Viac informácií

Informovať o naskladnení knihy

Informovať o naskladnení knihy


Súhlas - Odoslaním žiadosti vyjadrujem Súhlas so spracovaním osobných údajov na marketingové účely.

Zašleme vám správu akonáhle knihu naskladníme

Zadajte do formulára e-mailovú adresu a akonáhle knihu naskladníme, zašleme vám o tom správu. Postrážime všetko za vás.

Viac informácií o knihe Beginning Data Structures and Algorithms in Java

Nákupom získate 113 bodov

Anotácia knihy

Data structures provide a way of storing and organizing data so that it can be used efficiently. Beginning Data Structures in Java provides Java developers at any level a thorough overview of data structures, and equips them with the tools they need to apply their knowledge in the real world. The book starts with small initial problems that programmers, students or trainers usually face and gradually dives deeper for complex concepts. The solutions are paired with explanation and figures at every step. By the end of the book, readers will be well versed with the deep concepts of data structures and the different operations that can be applied to them The book provides solutions to: What are Linked Lists and the operations that can be performed with them What are Stacks, Queues, Circular Queues and Sparse Matrices How Binary Search trees are made and how can they be traversed recursively and non-recursively What are AVL trees and how are they balanced The concept of Threaded binary trees and searching, inserting and deleting nodes from threaded trees How Graphs are represented through Adjacency Linked List and Adjacency Matrices and how the Breadth first and Depth fist search techniques are implemented on Graphs Different sorting techniques including bubble sort, insertion sort, selection sort, quick sort, merge sort, radix sort, shell sort etc. Minimal spanning trees including Kruskal, Prim's algorithms Conversions between infix to postfix, infix to prefix, etc. The book will be of great use for any Java developer working on system programming.

Parametre knihy

Zaradenie knihy Knihy po anglicky Computing & information technology Computer programming / software development Object-oriented programming (OOP)

45.66



Osobný odber Bratislava a 2642 dalších

Copyright ©2008-24 najlacnejsie-knihy.sk Všetky práva vyhradenéSúkromieCookies


Môj účet: Prihlásiť sa
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Nákupný košík ( prázdny )

Vyzdvihnutie v Zásielkovni
zadarmo nad 59,99 €.

Nachádzate sa: