National Computer Level 2 C Examination Syllabus

Basic public knowledge

Basic Requirements

1.MasterAlgorithm.

2.Master the basic data structure and operations.

3.Master basic sorting and search algorithms.

4.Master the structure of progressive refinementProgramDesign method.

5.Master the basic methods of software engineering, and have the ability to initially apply related technologies for software development.

6.Master the basic knowledge of databases and understand the design of relational databases.

Exam content

I. Basic data structures and algorithms

1.Basic concepts of algorithms; concepts and meanings of algorithm complexity (time complexity and space complexity ).

2.Definition of data structures; logical and storage structures of data; graphical representation of data structures; concepts of linear and non-linear structures.

3.The definition of a linear table; the sequential storage structure of a linear table and its insertion and deletion operations.

4.Definitions of stacks and queues; sequential storage structure of stacks and queues and their basic operations.

5.The structure and basic operations of a linear single-chain table, a two-way linked list, and a circular linked list.

6.Basic concepts of the tree; the definition and storage structure of the binary tree; the pre-order, middle-order, and post-order traversal of the binary tree.

7.Sequential search and binary search algorithms; Basic sorting algorithms (exchange-type sorting, selection-type sorting, and Insertion-type sorting ).

Ii. Program Design Basics

1.Programming Method and Style

2.Structured program design.

3.Object-Oriented programming methods, objects, methods, attributes, inheritance and polymorphism.

Iii. Software Engineering Basics

1.Basic concepts of software engineering, software life cycle, software tools and software development environment.

2.Structured analysis methods, data flow charts, data dictionaries, and software requirement specification.

3.Structured Design Method, overall design and detailed design.

4.Software testing methods, white box testing and black box testing, test case design, software testing implementation, unit testing, integration testing and system testing.

5.Program debugging, static debugging, and dynamic debugging.

Iv. Database Design Basics

1.Basic concepts of databases: databases, database management systems, and database systems.

2.Data Model, entity contact model andE―RFigure, fromE―RFigure export the relational data model.

3.Relational algebra operations, including set operations and selection, projection, connection operations, and database standardization Theory.

4.Database design methods and steps: requirements analysis, conceptual design, logical design, and physical design strategies.

Exam Method

1.The Public Basic Knowledge Examination Method is the test, andCLanguage Programming (C ++Language Programming,JavaLanguage Programming,Visual BasicLanguage Programming,Visual FoxProDatabase program design orAccessDatabase Programming) the written test part is combined into a test, the public basic knowledge part of the full volume30Points.

2.Basic public knowledgeL0Multiple choice questions and5Fill in blank questions.

CLanguage Programming

Basic Requirements

1.FamiliarTurbo CIntegration Environment.

2.Master the structured programming methods and have a good programming style.

3.Master simple data structures and algorithms in programming.

4. Turbo CIn the integrated environment, you can write simpleCProgram, and has basic error correction and debugging capabilities.

Exam content

I,CLanguage Structure

1.Program Composition,MainFunctions and other functions.

2.Header file, data description, and the start and end signs of the function.

3.The writing format of the source program.

4. cLanguage Style.

Ii. Data Types and operations

1. c(Basic type, construction type, pointer type, null type) and its definition method.

2. cThe type, priority, and combination of operators.

3.Conversion and operation between different types of data.

4. cExpression type (Value assignment expression, arithmetic expression, relational expression, logical expression, conditional expression, comma expression) and evaluation rule.

III. Basic statements

1.Expression statement, empty statement, and compound statement.

2.Data input and output: Call of the input and output functions.

3.Compound statement.

4. GotoStatement and statement label.

4. Select structure Program Design

1.UseIfStatement implementation selection structure.

2.UseSwitchStatement to implement the multi-branch selection structure.

3.Select structure nesting.

V. Loop Structure Program Design

1.Loop Structure.

2. WhileAndDo whileLoop Structure.

3. ContinueStatement andBreakStatement.

4.Nested loop.

Vi. Definition and reference of Arrays

1.Definition, initialization, and reference of one-dimensional and multi-dimensional arrays

2.String and character array.

VII. Functions

1.The library function is called correctly.

2.Function definition method.

3.The type and return value of the function.

4.Transmission of formal parameters and real parameters and parameter values.

5.Correct function call, nested call, and recursive call.

6.Local and global variables.

7.Storage Class of variables (automatic, static, register, external), scope and lifetime of variables.

8.Internal and external functions.

8. Compile preprocessing

1.Macro definition: macro definition without parameters; macro definition with parameters.

2."File Inclusion.

9. pointer

1.Pointer and pointer variable concepts, pointer and address operators.

2.Variables, arrays, strings, functions, struct pointers, and pointer variables pointing to variables, arrays, strings, functions, and struct. Reference the preceding data types by pointer.

3.Use pointers as function parameters.

4.Returns the pointer function of the pointer value.

5.Pointer array, pointer to pointer,MainThe command line parameters of the function.

10. structure (I .e. "structure") and shared body (I .e. "union ")

1.Struct and Common Object Data Definition and reference methods.

2.A linked list is composed of pointers and struct. One-way linked lists are created, output, deleted, and inserted.

11. bitwise operations

1.The meaning and usage of bitwise operators.

2.A simple bitwise operation.

12. File Operations

Only buffer file systems (Advanced disks) are required.I/OSystem), for non-standard buffer file systems (that is, low-level DisksI/OSystem) is not required.

1.File Type pointer (FileType pointer ).

2.File opening and closing (Fopen,Fclose).

3.File read/write (Fputc,Fgetc,Fputs,Fgets,Fread,Fwrite,Fprintf,FscanfFunction), file location (Rewind,FseekFunction ).

Exam Method

1.Written test:120Minute, full score100Which includes the basic public knowledge30Points.

2.COMPUTER:60Minute, full score100Points.

Machine operations include:

(1.

(2.

(3) Programming.

This document is sourced from the network and is not necessarily accurate and is for reference only.
From: http://ncre.csai.cn/ncredg/200605160849041980.htm