2001年度程序员级下午试题（2001 programmer level afternoon questions）.docVIP

2001年度程序员级下午试题（2001 programmer level afternoon questions） 2001 programmer level afternoon questions Examination questions one Read the following procedure or function description and C code will be filled __ (n) __ the words written in the corresponding column of the answer sheet. [function 1.1] The function StrCmp () compares the sizes of two strings, s and t. If the s T function returns a negative number; if s = t, the function returns 0; if s t, the function returns a positive number. [function 1.1] Int StrCmp (char, *s, char, *t) {while (*s *t __ (1) __) { S++; t++; } Return __ (2) __; } [procedure 1.2] In the matrix of rows of n n, each row has the largest number, and this procedure asks for the smallest of these n maximum numbers [program 1.2] #include stdio.h #define N 100int a[N][N]; Void, main () {int, row, col, Max, min, n; Enter a valid n / * ( 100), and input m n integers into an array of a code slightly. For (row = 0; row n; row++) { For (max = a[row][0], col = L; col n; col++) If (__ (3) __) max = a[row][col]; If (__ (4) __) min = max; Else if (__ (5) __) min = max; } Printf (The, min, of, Max, numbers,%d\n, is, min); } Examination questions two Read the following procedures and C code will be filled __ (n) __ the words written in the corresponding column of the answer sheet. [procedure 2] In this program the function first_insert () function is inserted into a specified value of the yuan in the first yuan known list before; (reverse_copy) function is the function of a new copy list according to the known list, but the list of the new yuan link sequence with known list table element link in reverse order; the function print_link () is used to output the list table in each element value; the function free_link () to release all list table element space. [program 2] #include stdip.h #include malloc.h Typedef, struct, node{, int, val; Struct node *next;} NODE; Void first_insert (NODE, **p, int, V) {NODE, *q = (NODE *) malloc (sizeof (NODE)); Q -