Dynamic Data Structures: Lists, Stacks, Queues, and Trees - Couverture souple

Patrut, Bogdan; Socaciu, Tiberiu

 
9783841760043: Dynamic Data Structures: Lists, Stacks, Queues, and Trees
Couverture souple
ISBN 10 : 384176004X ISBN 13 : 9783841760043
Editeur : Lehrbuchverlag, 2011

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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.

Biographie de l'auteur

Dr Bogdan Pătruţ is associate professor in computer science. Dr Tiberiu Socaciu is lecturer in computer science. Their domains of research are procedural programming, data structures, and artificial intelligence. They published several papers and books on programming, algorithms, artificial intelligence, and interactive education.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
Lehrbuchverlag
Date d'édition
2011
Langue
anglais
ISBN 10 
384176004X
ISBN 13 
9783841760043
Reliure
Broché
Nombre de pages
92
Coordonnées du fabricant
non disponible
Personne responsable
non disponible