Название: Data Structure Using C: Theory and Program
Автор: Ahmad Talha Siddiqui, Shoeb Ahad Siddiqui
Издательство: CRC Press/Manakin Press
Год: 2024
Страниц: 428
Язык: английский
Формат: pdf (true)
Размер: 10.1 MB

In computer science, a data structure is a particular way of storing data in a computer so that it can be used efficiently. Different kinds of data structures are suited to various kinds of applications, and some are highly specialized to certain tasks. For Example, B-Trees are well suited for implementation of databases, while compiler implementations usually use hash tables to look up for identifiers.

Data structures are used almost in every program or software. Data structures are generally based on the ability of a computer to fetch and store data at any place in its memory, specified by an address- a bit string that can be itself stored in memory and manipulated by the program. Thus, the record and array data structure are based on computing the address of data items with arithmetic’s operation; while the linked list data structures are based on storing address of data items within the structure itself.

Definition:
• A data structure is a method of representing data; it not only deals with raw data but also involves the relationship between the data.
• A data structure is defined as a way of representing data in computer memory.
• Data structure is the structural representation of logical relationships between elements of data.

Contents:





ОТСУТСТВУЕТ ССЫЛКА/ НЕ РАБОЧАЯ ССЫЛКА ЕСТЬ РЕШЕНИЕ, ПИШИМ СЮДА!