Title Details: | |
Open Data Structures: An Introduction |
|
Authors: |
Morin, Pat Tzouramanis, Theodoros (Tr.) Markou, Euripides (Tr.) Manolopoulos, Yannis (Tr.) |
Subject: | MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > ALGORITHMS AND COMPLEXITY > FUNDAMENTAL DATA STRUCTURES AND ALGORITHMS MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > SOFTWARE DEVELOPMENT FUNDAMENTALS > FUNDAMENTAL DATA STRUCTURES MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > ALGORITHMS AND COMPLEXITY > ADVANCED DATA STRUCTURES, ALGORITHMS AND ANALYSIS MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > DISCRETE STRUCTURES > GRAPHS AND TREES MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > PROGRAMMING LANGUAGES |
Keywords: |
Data Structures
Algorithms Time and Space Complexity Searching Sorting Arrays Lists Queues Stacks Heaps Graphs Trees Hashing Computer Programming Python C++ Java |
Description: | |
Abstract: |
The book covers the design, implementation and analysis of some of the most well-known data structures in the literature of informatics and computer science, such as, for example, the stack, the queue, the deque, the list (implemented using an array or pointers), the skip list, several hash table methods, the binary tree (including the binary search tree, the treap, the scapegoat tree and the red-black tree), the heap (including the binary heap and the randomized meldable heap), the graph (including its representation by a matrix or as a collection of lists), some specialised data structures for integers (including various forms of binary digital trees), the B-tree, etc. The algorithms for implementing the data structures are given in pseudocode (on the basis of the Python programming language) and in the C++ and Java programming languages. The book is organised into 14 chapters and can adequately cover a 13-week academic semester for the "Data Structures" undergraduate course. In addition, some chapters of the book can be taught at a more advanced stage of the academic curriculum, including in the context of relevant postgraduate courses. The book provides the student with the necessary background for the effective use of the data structures in a wide range of application domains in informatics and computer science. The material of the book aims to enable students to analyse the performance of data structures, to compare their efficiency and suitability for solving various problems, to design complex and application-specific data structures, and to implement them with efficient algorithms in the programming language of their choice.
|
Linguistic Editors: |
Galanopoulos, Ioannis |
Technical Editors: |
Karatzides, Dimitrios |
Graphic Editors: |
Tzouramanis, Theodoros Markou, Euripides Manolopoulos, Yannis |
Type: |
Undergraduate textbook |
Creation Date: | 11-01-2024 |
Item Details: | |
ISBN |
978-618-228-182-6 |
License: |
Attribution - NonCommercial - ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
DOI | http://dx.doi.org/10.57713/kallipos-414 |
Handle | http://hdl.handle.net/11419/12117 |
Bibliographic Reference: | Morin, P., Tzouramanis, T. (Tr.), Markou, E. (Tr.), & Manolopoulos, Y. (Tr.). (2024). Open Data Structures: An Introduction [Undergraduate textbook]. Kallipos, Open Academic Editions. https://dx.doi.org/10.57713/kallipos-414 |
Language: |
Greek |
Consists of: |
1. Introduction 2. Array-Based Lists 3. Linked Lists 4. Skiplists 5. Hash Tables 6. Binary Trees 7. Random Binary Search Trees 8. Scapegoat Trees 9. Red-Black Trees 10. Heaps 11. Sorting Algorithms 12. Graphs 13. Data Structures for Integers 14. External Memory Searching |
Number of pages |
378 |
Publication Origin: |
Kallipos, Open Academic Editions |
User comments | |
There are no published comments available! | |