Adobe PDF
(809.72 kB)
| Title Details: | |
|
Linear data structures |
|
| Authors: |
Mastorokostas, Paris |
| Reviewer: |
Thramboulidis, Kleanthis |
| Subject: | MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > PROGRAMMING LANGUAGES |
| Description: | |
| Abstract: |
In this chapter, various data structures are studied. Initially, the categories and characteristics of data structures are presented, followed by the study of sequential structures such as stacks and queues, along with their applications. Then, the concept of linked lists is introduced, and both singly and doubly linked lists, as well as circular lists, are examined. In the next section, implementations of stacks and queues as simple linked lists are developed. The chapter concludes with an extensive example of program development.
|
| Linguistic Editors: |
Bismpa, Anna |
| Type: |
Chapter |
| Creation Date: | 2015 |
| Item Details: | |
| License: |
http://creativecommons.org/licenses/by-nc-nd/3.0/gr |
| Handle | http://hdl.handle.net/11419/1357 |
| Bibliographic Reference: | Mastorokostas, P. (2015). Linear data structures [Chapter]. In Mastorokostas, P. 2015. Procedural programming [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/1357 |
| Language: |
Greek |
| Is Part of: |
Procedural programming |
| Number of pages |
35 |
| Publication Origin: |
Kallipos, Open Academic Editions |