数据结构(专科)作业1（Data structure (specialist) job 1）.doc

数据结构(专科)作业1（Data structure (specialist) job 1） We only live once in the world, so we should cherish the time. You must live a real life and live a worthy life. - Pavlov Data structure (specialist) job 1 The first chapter is introduction I. radio questions 1., an array element a[i] is equivalent to the representation of A. A * (a+i), B, a+i, C, *a+i, D, a+i 2., for two functions, if the function name is the same, but only the C is different, it is not overloaded function. A parameter type, B parameter number, C function type 3. if you need to access the arguments directly using the parameters, you should specify the parameter variables as B parameters. The A pointer B references the C value 4. the complexity of the following program segment is C. For (int i=0; im; i++) For (int j=0; jn; j++) A[i][j]=i*j; A, O (M2), B, O (N2), C, O (m*n), D, O (m+n) 5. the number of S statements executed is D when the following segment is executed. For (int i=1; i=n; i++) For (int j=1; j=i; j++) S; A, N2, B, n2/2, C, n (n+1), D, n (n+1) /2 6. the following algorithm has a time complexity of B. Int f (unsigned, int, n) { If (n==0||n==1) return 1; Else return n*f (n-1); } A, O (1), B, O (n), C, O (N2), D, O (n,...) Two. Fill in the blanks 1., the logical structure of data is divided into four categories: set structure, linear structure, tree structure and graph structure. 2., the storage structure of data is divided into four kinds: sequential structure, link structure, index structure and hash structure. 3. in linear structure, tree structure and graph structure, there are 1 pairs of 1 and 1 pairs of N and M to N respectively between the precursor and the successor node. 4. an abstract data type consists of two parts: data and operation. 5., when the length of a parameter type is large, it should be best described as reference to save the space of the parameter value, the transmission time, and the space of the storage parameters. 6. when you need to access the corresponding argument w