Universal Linear Data Structure
Rustam Kabulov VosilovichDepartment of software engineering, Candidate of Physical and Mathematical Sciences, Tashkent University of Information Technologies named after Muhammad al-Khwarizimi, Tashkent, Republic of Uzbekistan
2020 International Conference on Information Science and Communications Technologies (ICISCT)conference2020en
Ochiq kirish: yoʻq
ABI
Annotatsiya
The paper is devoted to the relevant issue of formalizing the description of a universal linear data structure. In modern programming, various data structures are described as linear data structures. The paper presents general functions for performing operations on such data structures as vector, deck, list, set and multiset. The conditions that these functions must meet are introduced as axioms. To describe the axioms, an approach based on an abstract data type, algebraic and formal grammatical approaches were used.
Hali tarjima qilinmagan
Mavzular
Identifikatorlar
Iqtiboslar va manbalar
0 ta iqtibos11 ta foydalanilgan manba