1, C Programming (3rd Edition), Tan Haoqiang, Tsinghua University Press, July 2005.
2. Data Structure (C language version), edited by Yan Weimin Wu Weimin, Tsinghua University Publishing House,
The structure of the test paper is like this (it used to be like this):
1, test questions and proportion distribution
(1) Multiple choice questions (about 30%)
(2) Read the program questions, write the program running results or modify the errors in the program (about 20%)
(3) Fill in the blanks according to the procedure (about 20%)
(4) Programming questions (about 30%)
2. Examination content and proportion distribution
Programming in (1)C language (80%)
(2) Basic data structure and common algorithms (about 20%)
3. Pay attention to cultivating students' ability to solve problems by using programming languages and methods.
Examination outline:
The examination syllabus of 20 12 is as follows (but it doesn't change much every year, so you can refer to it. The specific exam outline of 13 will come out in the enrollment column later, so just have a look):
I. Data definition
Examination content
1. Basic types: integer, real number and character.
2. Structure type: array and structure.
3. pointer.
4. Storage category, range and life span of variables.
Examination requirements
1, familiar with the constant representation of basic data types, including decimal, octal and hexadecimal integers; Decimal form and exponential form of real numbers; Character constants and string constants.
2. Master the naming rules of variables.
3. Proficient in the definition, assignment and use of integer, real number and character variables.
4. Master the definition and initialization of one-dimensional array and the reference of one-dimensional array elements.
5. Master the definition, initialization and reference of two-dimensional array elements.
6. Master the definition and initialization method of character array.
7. Master the storage and processing of strings.
8, can apply one-dimensional array to solve simple application problems, such as traversal, retrieval, sorting, etc.
9. Two-dimensional arrays can be used to process matrix operations.
10, master the definition of structure types, the definition and initialization of structure variables, correctly reference the members of structure variables, and master the simple application programming of structure.
1 1, correctly understand the concept of pointer.
12, familiar with the definition and initialization of various types of pointer variables and the general usage of pointer variables.
13. Understand the relationship between pointers and one-dimensional arrays.
14, master the application of pointer in string processing.
15, understand pointer to pointer (secondary pointer).
16. Understand the storage categories of variables, including auto automatic type, static static type and extern external reference type.
17, global variables and local variables can be used correctly.
Second, operators and expressions
Examination content
1, the type, operation priority and combination of C language operators.
2. Conversion and operation between different types of data.
4, C language expression types (assignment expression, arithmetic expression, relational expression, logical expression, conditional expression, comma expression) and evaluation rules.
Examination requirements
1, master the function, number, priority and combination of operators. Including arithmetic operators, self-increasing (++) and self-decreasing (-) operators, relational operators, logical operators, assignment operators, compound assignment operators, comma operators, conditional operators and bitwise operators.
2. Proficient in implicit type conversion and forced type conversion.
3. Be familiar with the calculation rules and applications of various expressions.
Third, the pretreatment command
Examination content
1, macro definition.
2. "File inclusion" processing.
3. Conditional compilation.
Examination requirements
1, learn about compilation preprocessing.
2. Define and use macros correctly, including macros without parameters and macros with parameters.
3. Use the commands contained in the file correctly.
4. Understand conditional compilation.
Fourth, process control.
Examination content
1, expression statement, empty statement, compound statement.
2. Input and output of data and call of input and output functions.
3. Compound statements.
4. Choose structured programming.
5. Programming of circular structure.
Examination requirements
1, proficient in expression statements, empty statements and compound statements.
2. Master data input and output methods and call methods of input and output functions.
2. Master the selection control statements and applications (if…else…, switch…).
3. Main loop control statement and application (while, do while, for).
4. Understand the meaning of the break and continue statement correctly and use it skillfully.
Verb (abbreviation of verb) program structure and function
Examination content
1, general form of function definition
2. Function parameters and function values
3. Function call
4. Nested calls of functions
5. Recursive call of function
6. Arrays as function parameters
7. Internal and external functions
Examination requirements
1, program structure
Familiar with the relationship between main function and other functions, including standard library functions and custom functions.
2. Custom function
(1) Define the function correctly.
(2) Correctly understand the relationship between function forms and independent variables, and skillfully use function parameter transfer, including arrays and pointers as function parameters.
(3) Master the function calling method.
(4) Use the return value of the function correctly, including the pointer as the return value.
3. Universal standard library function
(1) Familiar with the application of input/output functions (such as printf, putchar, puts, scanf, getchar, gets, etc. ).
(2) Correct use of mathematical functions (such as sqrt, fabs, pow, etc.). )
(3) Master string functions (such as strlen, strcpy, strcmp, strcat, etc.). ).
Proof document of intransitive verbs
Examination content
1, file type pointer
2. Opening and closing files
3. Reading and writing files
4. The location of the file
Examination requirements
1. Understand the basic concepts of files and the input/output process of text files.
2. Be familiar with the basic concepts and definitions of files and understand the difference between text files and binary files.
3. Familiar with the common functions and usage of text file operations (such as fopen, fclose, feof, fprintf, fscanf, etc.). ).
Seven, the basic data structure and common algorithms
Examination content
1, linear table (sequential table, linked list)
2. Stacks and queues
3. Simple sorting algorithm
4. Simple search algorithm
5. Traversal algorithm
Examination requirements
1, master the definition, characteristics, storage and main operation algorithms of linear tables (including sequential tables and linked lists) (such as creation, destruction, insertion, deletion, merging and splitting). ), and can apply linear table structure to solve problems;
2. Master the definition, characteristics, storage, main arithmetic and application of stack and queue structure, and be able to use stack and queue to solve problems;
3. Master simple sorting algorithms (including bubble sorting, direct selection sorting and direct insertion sorting). ) algorithm idea, and can skillfully use.
4, master simple search algorithm (including sequential search, method of bisection, etc. ) algorithm idea, and can skillfully use.
5. Master traversal algorithms (including traversal of one-dimensional arrays and two-dimensional arrays, traversal of linked lists, traversal of files, etc.). ).