计算机专业英语课件3.ppt

计算机专业英语 计算机专业英语 Happy! Relaxed! 第3章 Software Knowledge 3.1 Data Structures 3.2 Operating System 3.3 Programming Languages 3.4 Software Engineering 3.5 Software Testing and Maintenance 3.1 Data Structures General data structure types include the array, the file, the record, the table, the tree, and so on. In computer programming, a data structure may be selected or designed to store data for the purpose of working on it with various algorithms. If we provide a set of possible data values and a set of operations that act on the values, we can think of the combination as a data type. We will call any data type whose values are composed of component elements that are related by some structure a structured data type, or data structure. Integer Integer is amounts to a particular collection of axioms or rules that must be obeyed. The way in which integers are represented is unimportant provided only that all readers understand the notation—binary, octal, decimal, hexadecimal, twos complement, ones complement or sign and magnitude, the choice does not matter. List The list is a flexible abstract data type. It is particularly useful when the number of elements to be stored is not known before running a program or can change during running. It is well suited to sequential processing of elements because the next element of a list is readily accessible from the current element. It is less suitable for random access to elements as this require a slow linear search. Array and Record The data types arrays and records are native to many programming languages. By using the pointer data type and dynamic memory allocation, many programming languages also provide the facilities for constructing linked structures. Arrays, records, and linked structures provide the building blocks for implementing what we might call higher-level abstractions. Stack A stack is a data type whose major attributes are determined by the rules governing the insertion and deletion of its