III Data Structures. Introduction.

Question 1

Dynamic

Answer 1

Sets are as fundamental to computer science as they are to mathematics. Whereas
mathematical sets are unchanging, the sets manipulated by algorithms can grow,
shrink, or otherwise change over time. We call such sets dynamic

Question 2

DICTIONARY

Answer 2

Algorithms may require several different types of operations to be performed on
sets. For example, many algorithms need only the ability to insert elements into,
delete elements from, and test membership in a set. We call a dynamic set that
supports these operations a dictionary. Other algorithms require more complicated
operations. For example, min-priority queues,

Question 3

Elements of dynamic set

Answer 3

Typically, each element is represented by an
object whose attributes can be examined and manipulated if we have a pointer to
the object.
Some
kinds of dynamic sets assume that one of the object’s attributes is an identifying
key. If the keys are all different, we can think of the dynamic set as being a set
of key values.
The object may contain satellite data, which are carried around in
other object attributes but are otherwise unused by the set implementation.
It may have attributes that are manipulated by the set operations; these attributes may
contain data or pointers to other objects in the set.
Some dynamic sets presuppose that the keys are drawn from a totally ordered
set, such as the real numbers, or the set of all words under the usual alphabetic
ordering. A total ordering allows us to define the minimum element of the set, for
example, or to speak of the next element larger than a given element in a set.

Question 4

Operations on dynamic sets

Answer 4

1. Queries

2. Modifying operations.