The array and linear table narrative is correct with 5

By definition, both a linear table and an array are ordered sets of data elements.

First of all, arrays have the concept of dimensions (such as three-dimensional arrays) while linear tables do not, although we can design some linear tables with pointer data structures to mimic the operation of multidimensional arrays, but this is beyond the concept of conventional linear tables.

Second, you can't do the same thing on an array as you can do on a linear table. For example, we don't normally insert and delete data on arrays, and similarly, we can't directly access the data unit (e.g., the ith element in the table) in a linear table through the data series.

However, for beginners, in order to facilitate the digestion of the two concepts, we can understand one-dimensional arrays (note that they are one-dimensional) as linear tables, since most of them have similar properties. But we can't say that a linear table is just an array, that's not true.

Some people in this question say that "linear tables are deposited first and then out, and those that are deposited are taken out first", which is obviously confusing the concepts of linear tables and stacks.

ad pair b, linear tables also require contiguous memory space

c, the type of each element of a linear table is not specified, that is, it can also be a "redivible" element, such as an array.

e, searching, modifying, inserting, and deleting are all operations on arrays and linear tables.

With regard to linear tables, the following statement is true and false ().

a.Each element has a direct difference precursor and a direct successor.

b.There is at least one element in a linear table.

c.The elements in the table must be arranged in order from smallest to largest or from largest to smallest.

d.With the exception of the first element and the last element, each element has one and only one direct predecessor and one direct successor.

Correct Answer: With the exception of the first element and the last element, each element has one and only one direct precursor and one direct successor.

The following statement about linear tables is correct ().

a.The number of data elements contained in a linear table can be arbitrary.

b.The data element in a linear table cannot be a composite type.

c.Each node in a linear table has one and only one direct precursor and a direct successor.

d.The data elements in a linear table can be any data type, such as integer, solid, character, or so on.

Correct Quiver Answer: The data elements in a linear table can be any data type, such as integer, solid, character, etc.

Answer]: The sequential storage of a linear table is called a sequential table. The sequence table is to check all the elements in the linear table according to their logical order.

sequentially stored in a continuous piece of storage space starting from the specified storage location in the computer memory, which is not convenient for insertion and deletion; The chained storage of linear tables is called a linked list. In chained storage, storage nodes are linked to the next node by pointers, eliminating the need to occupy a contiguous storage unit and facilitating insertion and deletion operations.

The correct statement about linear tables is ().

a.Each element has a precursor and a successor.

b.There is at least one element in a linear table.

c.The order in which the elements in the table are sorted must be from smallest to largest or largest to smallest.

d.With the exception of the first element and the last element, the rest of the elements have one and only one precursor and one successor.

Correct Answer: Except for the first element and the last element, the rest of the elements have one and only one precursor and one successor.

For linear tables, the following statement is true ().

a.Each element has a direct precursor and a direct successor.

b.There must be at least one element in the linear table.

c.The elements of the manuscript must be arranged in an orderly manner.

d.With the exception of the first element and the last element, each element has a direct precursor and a direct successor.

Correct Answer: With the exception of the first element and the last element, each element has a direct precursor and a direct successor.

The so-called array is a set of elements of the same data type arranged in a certain order, that is, a set of variables of the same type with a name, and then distinguish them by number, this name is called the array name, and the number is called the subscript. The individual variables that make up an array are called the components of the array, also known as the elements of the array, and sometimes referred to as the subscript variables. Arrays are a form of programming that organizes several variables of the same type in an orderly form for ease of processing.

These sequential collections of data elements of the same kind are called arrays.

An array is not the same as a linear table.

The difference is mainly in dynamic allocation, modern languages support dynamic arrays, which can determine the size of the array at runtime, but earlier languages do not, so the array must be sized in the compiler.

Linear linked lists, on the other hand, can dynamically determine the size, delete and add at any time, and know the number of elements. Arrays, unless defined dynamically, need to know the number of elements yourself. For example, c89 does not support dynamic arrays, but c99 does.

ISO C++ is also not supported, but C+0X does.

An array is a composite data type that comes with a compiled language.

Generalized tables and linear tables are concepts in terms of data structures, and they are both defined as a finite sequence (a1, a2, a3,...，an）。However, in a linear table, the AI is limited to a single element, while in a generalized table, the AI can be a single element or a sub-generalized table. Therefore, linear tables can be represented by a sequential storage structure such as arrays, or they can be represented by linked lists.

Generalized tables, on the other hand, can generally only be represented by linked lists.

There is no concept of array in the data structure, even if there is, the corresponding should be a static linked list, a static linked list is a kind of linear table, and a generalized table is also a kind of table, but the data elements in it can be recursive, and the array belongs to a linear table, and they both belong to a linear structure.

Generalized tables belong to the tree structure.

You seem to be confusing the logical structure of your data with the structure of your storage.

There are only two types of data storage structures: sequential storage structure and chain storage structure, the former one is to use the relative position of data elements in the memory to represent its logical structure, and the other is to use pointers to represent its logical relationship.

Conclusion: In terms of storage structure, linear data may be either sequential or chained.

Linear tables are linear structures and are also sequential storage structures.