Atnaujintas knygų su minimaliais defektais pasiūlymas! Naršykite ČIA >>

Basic Concept of Data Structure

-15% su kodu: ENG15
53,70 
Įprasta kaina: 63,18 
-15% su kodu: ENG15
Kupono kodas: ENG15
Akcija baigiasi: 2025-03-03
-15% su kodu: ENG15
53,70 
Įprasta kaina: 63,18 
-15% su kodu: ENG15
Kupono kodas: ENG15
Akcija baigiasi: 2025-03-03
-15% su kodu: ENG15
2025-02-28 63.1800 InStock
Nemokamas pristatymas į paštomatus per 11-15 darbo dienų užsakymams nuo 10,00 

Knygos aprašymas

Data structures are essential components in computer science, serving as organized formats to store, manage, and manipulate data efficiently. They enable the effective implementation of algorithms and facilitate operations such as data retrieval, insertion, deletion, and modification. Common data structures include arrays, linked lists, stacks, queues, trees, and graphs, each with unique characteristics and use cases. Arrays provide indexed access to elements but have fixed sizes, while linked lists offer dynamic memory usage with efficient insertions and deletions. Stacks and queues operate on LIFO (Last-In-First-Out) and FIFO (First-In-First-Out) principles, respectively, and are used in various applications like expression evaluation and task scheduling. Trees, such as binary trees and heaps, represent hierarchical data and support fast search and sort operations. Graphs model complex relationships between data points and are essential in network analysis, pathfinding, and numerous other fields. Choosing the appropriate data structure is critical for optimizing performance and resource utilization in software development and problem-solving.

Informacija

Autorius: Preeti Rathi
Leidėjas: LAP LAMBERT Academic Publishing
Išleidimo metai: 2024
Knygos puslapių skaičius: 56
ISBN-10: 6207811100
ISBN-13: 9786207811106
Formatas: 220 x 150 x 4 mm. Knyga minkštu viršeliu
Kalba: Anglų

Pirkėjų atsiliepimai

Parašykite atsiliepimą apie „Basic Concept of Data Structure“

Būtina įvertinti prekę

Goodreads reviews for „Basic Concept of Data Structure“