9786207811076 - advanced data structure de rathi, preeti (8 resultados)
- Tapa blanda
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de AmericaPBShop.store US
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 46,60
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
- Tapa blanda
Librería: California Books, Miami, FL, Estados Unidos de AmericaCalifornia Books
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 47,22
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New.
- Tapa blanda
Librería: PBShop.store UK, Fairford, GLOS, Reino UnidoPBShop.store UK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 45,93
Envío por EUR 3,84Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
- Tapa blanda
Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 43,78
Envío por EUR 13,98Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. In.
Más imágenes- Tapa blanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 39,45
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Taschenbuch. Condición: Neu. Advanced Data Structure | Preeti Rathi | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2024 | LAP LAMBERT Academic Publishing | EAN 9786207811076 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
Idioma: Inglés
Editorial: Omniscriptum, LAP Lambert Academic Publishing, 2024
- Tapa blanda
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 43,90
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Advanced data structures provide powerful tools for efficient manipulation and retrieval of data, crucial in diverse computational tasks. Structures like segment trees excel in handling range queries and updates with logarithmic tim…e complexity, making them invaluable for applications needing frequent computations over contiguous subarrays. Tries, or prefix trees, are optimal for managing and querying sets of strings based on prefixes, essential for autocomplete and dictionary implementations. Heaps, including binary heaps and priority queues, efficiently manage elements with priorities, ensuring quick access to the highest (or lowest) priority item. Hash tables provide average constant-time operations for insertion, deletion, and search, ideal for scenarios requiring fast key-based data retrieval. Each of these structures offers unique advantages, from space efficiency and rapid operations to specialized handling of specific data types and operations, making them essential tools for algorithm design and optimization in various domains. 80 pp. Englisch.
- Tapa blanda
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 43,90
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Advanced data structures provide powerful tools for efficient manipulation and retrieval of data, crucial in diverse computational tasks. Structures like segment trees excel in handling range queries and updates with logarithmic time co…mplexity, making them invaluable for applications needing frequent computations over contiguous subarrays. Tries, or prefix trees, are optimal for managing and querying sets of strings based on prefixes, essential for autocomplete and dictionary implementations. Heaps, including binary heaps and priority queues, efficiently manage elements with priorities, ensuring quick access to the highest (or lowest) priority item. Hash tables provide average constant-time operations for insertion, deletion, and search, ideal for scenarios requiring fast key-based data retrieval. Each of these structures offers unique advantages, from space efficiency and rapid operations to specialized handling of specific data types and operations, making them essential tools for algorithm design and optimization in various domains.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 80 pp. Englisch.
- Tapa blanda
- Impresión bajo demanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 44,59
Envío por EUR 60,69Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Advanced data structures provide powerful tools for efficient manipulation and retrieval of data, crucial in diverse computational tasks. Structures like segment trees excel in handling range queries and updates with logarithmic time com…plexity, making them invaluable for applications needing frequent computations over contiguous subarrays. Tries, or prefix trees, are optimal for managing and querying sets of strings based on prefixes, essential for autocomplete and dictionary implementations. Heaps, including binary heaps and priority queues, efficiently manage elements with priorities, ensuring quick access to the highest (or lowest) priority item. Hash tables provide average constant-time operations for insertion, deletion, and search, ideal for scenarios requiring fast key-based data retrieval. Each of these structures offers unique advantages, from space efficiency and rapid operations to specialized handling of specific data types and operations, making them essential tools for algorithm design and optimization in various domains.
