1. Basic Requirements:
Candidates should correctly understand the structure, syntax, and environment of the C language according to the requirements of this syllabus; the basic concepts of C language, functions and their calls; the syntax, semantics, and usage characteristics of various types of statements and data types; problem analysis, design, and C language implementation and debugging methods, and receive sufficient programming training.
The requirements of this syllabus are organized from low to high, dividing concepts and theories into two levels: “Understanding” and “Comprehension”; operations and programs are divided into two levels: “Mastery” and “Application”.
2. Examination Method and Duration:
The examination method is closed-book, and the examination duration is 120 minutes.
3. Examination Question Type Proportions:
This examination has no multiple-choice questions or true/false questions; other types of questions are unlimited. Fill-in-the-blank questions:48 points, program reading:35 points, program fill-in-the-blank:36 points, program design:31 points, total score: 150 points.
4. Examination Content and Requirements:
Chapter 1: Program Design and C Language
Examination Content:
(1) What is a computer program;
(2) What is a computer language;
(3) The development and characteristics of the C language;
(4) The structure of C language programs;
(5) Steps and methods for running C programs;
(6) The tasks of program design.
Examination Requirements:
(1) Understand: The history and characteristics of the C language;
(2) Master: The steps and methods for running C programs;
(3) Apply: Write simple screen output programs using C language.
Chapter 2: Algorithms – The Soul of Programs
Examination Content:
(1) The concept of algorithms;
(2) The characteristics of algorithms;
(3) Various representation methods of algorithms;
(4) Structured programming methods;
Examination Requirements:
(1) Understand: The most basic algorithms;
(2) Comprehend: Structured programming methods.
Chapter 3: The Simplest C Program Design – Sequential Program Design
Examination Content:
(1) The representation and operations of data;
(2) Operators and expressions;
(3) C statements;
(4) Input and output of data;
Examination Requirements:
(1) Master: The representation of several basic data types, and various operations defined on basic data types (arithmetic, assignment, relational, logical, conditional, comma, etc.);
(2) Master: The significance of constants and the representation of constants of several basic data types, the definition and use of constants, the definition of variables, and the specification of user-defined identifiers;
(3) Master: The precedence and associativity of various operators in mixed expressions;
(4) Master: The usage specifications of input and output functions.
Chapter 4: Selection Structure Program Design
Examination Content:
(1) Selection structures and conditional judgments;
(2) Relational operators and relational expressions, logical operators and logical expressions, conditional operators and conditional expressions;
(3) if selection control statements;
(4) switch selection control statements.
Examination Requirements:
(1) Master the usage of relational and logical operators;
(2) Master: if selection control statements, including the form of if statements, and the nesting of if statements;
(3) Master: switch selection control statements, including the form of switch statements, and the nesting of switch statements;
(4) Apply: Have the ability to design programs with branching structures.
Chapter 5: Loop Structure Program Design
Examination Content:
(1) Implement loops using while statements;
(2) Implement loops using do…while statements;
(3) Implement loops using for statements;
(4) Nesting of loops and comparisons of various loops;
(5) The usage of break and continue statements and the differences between them.
Examination Requirements:
(1) Master: The form and usage of “while” loops;
(2) Master: The form and usage of “do-while” loops;
(3) Master: The form and usage of “for” loops;
(4) Master: The differences and conversions between for loops, while loops, and do-while loops;
(5) Master: The usage of break and continue statements and the differences between them;
(6) Apply: Have the ability to design programs with loop structures.
Chapter 6: Using Arrays to Process Bulk Data
Examination Content:
(1) One-dimensional arrays;
(2) Two-dimensional arrays;
(3) Character arrays.
Examination Requirements:
(1) Master: The definition, initialization, and referencing of one-dimensional arrays;
(2) Master: The definition, initialization, and referencing of two-dimensional arrays, and the relationship between two-dimensional arrays and one-dimensional arrays;
(3) Master: The concept and operations of strings, and commonly used algorithms related to arrays (searching, sorting, etc.);
(4) Apply: Have the ability to design programs using arrays.
Chapter 7: Using Functions to Achieve Modular Program Design
Examination Content:
(1) Why use functions, the definition of functions;
(2) Calling functions (the forms of function calls, nested calls, recursive calls, arrays as function parameters);
(3) Local variables and global variables;
(4) The storage methods and lifetimes of variables, the declaration and definition of variables.
Examination Requirements:
(1) Comprehend: The role and significance of functions;
(2) Master: The format of function definitions;
(3) Master: Nested function calls and recursive calls;
(4) Master: The storage categories of variables, and the distinction and roles of global and local variables;
(5) Apply: Have the ability to write programs using functions.
Chapter 8: Proficient Use of Pointers
Examination Content:
(1) The definition of pointers, the relationship between pointers and addresses, the definition and referencing of pointer variables;
(2) Referencing arrays through pointers;
(3) Referencing strings through pointers;
(4) Pointers to functions.
Examination Requirements:
(1) Master: The basic concepts of pointers, the definition and usage of pointer variables;
(2) Master: The relationship between pointers and arrays, and the mixed use of pointers, arrays, and functions;
(3) Apply: Write basic programs using pointers.
Chapter 9: User-Defined Data Types
Examination Content:
(1) Define and use structure variables, use structure arrays, structure pointers, and handle linked lists with pointers;
(2) Define union types;
(3) Use enumeration types;
(4) Declare new type names using typedef.
Examination Requirements:
(1) Master: The concept and definition of structure types, the definition, referencing, and initialization of structure type variables.
(2) Apply: Master the basic applications of structures.
Chapter 10: Input and Output of Files
Examination Content:
(1) Basic knowledge about C files;
(2) Opening and closing files;
(3) Sequentially reading and writing data files;
(4) Randomly reading and writing data files;
(5) Error detection in file reading and writing.
Examination Requirements:
(1) Master: The concept of files, the difference between text files and binary files;
(2) Master: Basic read/write operations on files (common functions such as fscanf/fprintf/fgetc/fputc, etc.);
(3) Master: File status detection (common functions such as feof, etc.), and understand data positioning in files.
References:
“C Language Programming (5th Edition)” by Tan Haokang, Tsinghua University Press