<Ul> <Li> if U and V are distinct variables, the sequence (store (U, x); store (V, y)) is equivalent to (store (V, y); store (U, x)). </Li> </Ul> <Li> if U and V are distinct variables, the sequence (store (U, x); store (V, y)) is equivalent to (store (V, y); store (U, x)). </Li> <P> More generally, ADT definitions often assume that any operation that changes the state of one ADT instance has no effect on the state of any other instance (including other instances of the same ADT)--unless the ADT axioms imply that the two instances are connected (aliased) in that sense . For example, when extending the definition of abstract variable to include abstract records, the operation that selects a field from a record variable R must yield a variable V that is aliased to that part of R . </P> <P> The definition of an abstract variable V may also restrict the stored values x to members of a specific set X, called the range or type of V. As in programming languages, such restrictions may simplify the description and analysis of algorithms, and improve their readability . </P>

Abstract data type in data structure in hindi