MATHEMATICAL MODELING OF DATA STRUCTURES IN MODERN SOFTWARE SYSTEMS

Abstract

This article examines the mathematical modeling of data structures used in modern software systems. The study considers arrays, linked lists, stacks, and queues and analyzes their mathematical representations and computational characteristics. Particular attention is paid to time and space complexity and to the dependence of operation costs on the size of the data set. Formal models are used to compare the efficiency of basic operations and to identify appropriate application areas for different data structures. The analysis demonstrates that mathematical modeling can support the selection of data structures and help predict how algorithmic performance changes as the data volume increases.