Dynamic Data Structures Lists by Patrut Bogdan (2 results)

Author
Title
Refine with Advanced Search

Refine your search

  • Books (2)

  • New (2)

to

Custom price range (US$)

to

    • Language: English

      Published by Lehrbuchverlag, 2011

      384176004X / 9783841760043

      • Softcover

      Seller: preigu, Osnabrück, Germanypreigu

      5-star seller
      Contact seller

      Condition: New

      US$ 26.95

      US$ 81.39 shipping 
      Ships from Germany to U.S.A.

      Quantity: 5 available

      Taschenbuch. Condition: Neu. Dynamic Data Structures | Lists, Stacks, Queues, and Trees | Bogdan Patrut (u. a.) | Taschenbuch | 92 S. | Englisch | 2011 | Lehrbuchverlag | EAN 9783841760043 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

    • Language: English

      Published by Lehrbuchverlag, 2011

      384176004X / 9783841760043

      • Softcover
      • Print on Demand

      Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH

      5-star seller
      Contact seller

      Condition: New

      US$ 28.63

      US$ 70.67 shipping 
      Ships from Germany to U.S.A.

      Quantity: 1 available

      Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Sometimes, storing data with vectors is not the best solution for a problem. We need to store information which is linked between them, in a larger memory space. There are also some situations when we need special data structure to memorize a hierarchy, like a genealogical tree. For such cases and not only, the static data structures are not very helpful. All these disadvantages can disappear once we use the dynamic data structures. The purpose of this book is: a) to make students understand the difference between static and dynamic variables and the role of the pointer variables; b) to point out the advantages of the dynamic allocation; c) to present the different types of data structures dynamically linked (stack, queue, double-linked list, circular list, binary tree); and d) to identify the optimally solvable problems using different types of dynamic structures. Also, some basic operations and many code samples will be presented. Several images will help the reader (teacher or student) for his work. There are also other symbols that mark students' activities. These symbols, together with the explanations from every problem, will turn this book into a useful course book.