College code and name: 02 1 software college

Professional code and name: 0852 12 software engineering (professional degree)

The number of students to be enrolled in this major: 2 1 full-time students and 690 part-time students.

Name of research direction: regardless of research direction.

Professional remarks: academic system 2.5; Tuition 16000 yuan/student/school year.

The first exam subject 10 1 ideological and political theory

The second exam subject 204 English II

The third exam subject 302 Math II

Data structure and C language programming fourth exam question 99 1

99 1 Examination Outline of Data Structure and C Language Programming (Version 20 19)

20 19 examination of data structure and c language programming includes two courses, data structure and c language programming, each accounting for 50%. The full mark of the test paper is 150.

"data structure" section

I. Overview

1. Basic concepts of logical structure and storage structure of data;

2. Definition, basic properties and basic concepts of algorithm analysis, including expressing time complexity and space complexity in big O form.

Second, the linear table

1. Definition of linear relation and linear table, basic operation of linear table;

2. The construction principle of sequential storage structure and chain storage structure of linear table (including single (directional) linked list, circular linked list and bidirectional linked list);

3. Basic operations on linear tables based on the above two storage structures, including the insertion and deletion of sequential tables, the establishment, insertion and deletion of linked lists, and the corresponding algorithm design (including the design of recursive algorithms).

Third, the array

1. Storage of one-dimensional array and two-dimensional array;

2. The basic concept of matrix compressed storage;

3. Compressed storage of symmetric matrix, diagonal matrix and triangular matrix.

Four. Stack and queue

Basic concepts and operations of 1. stack and queue;

2. The construction principle of sequential storage structure and chain storage structure of stack and queue;

3. Algorithm design of basic operations such as insertion and deletion of stacks and queues based on different storage structures;

4. The application of stack and queue in solving practical problems.

Verb (abbreviation for verb) tree and binary tree

Basic concepts, characteristics and terms of 1. tree and binary tree;

2. The basic concepts of complete binary tree and complete binary tree, the basic properties of binary tree and its application;

3. The sequential storage structure of binary tree and the basic principle of binary linked list storage nodes;

4. Sequence traversal, middle traversal, post-sequence traversal and hierarchical traversal of binary tree, focusing on the design and application of various traversal algorithms (including non-recursive algorithms) based on binary linked list as storage structure;

5. Basic concepts of binary sort tree, establishment (insertion), search and calculation of average search length ASL.

Intransitive verb number

Basic concepts and terms of 1. graphics;

2. The construction principle and characteristics of adjacency matrix storage method of graph and adjacency table storage method (including inverse adjacency table);

3. Depth-first search and breadth-first search of graphs;

4. Basic concepts of minimum (cost) spanning tree, shortest path, AOV net and topological sorting.

Seven. Documents and search

1. Sequential search method and calculation of average search length;

2. Semi-search method and calculation of average search length (ASL), including the construction of "decision tree" corresponding to the search process;

3. The construction of hash table, the construction of hash function, the basic concept of hash conflict, the basic method of dealing with hash conflict, the search of hash table and the calculation of average search length.

Eight, internal sorting

The basic concept of 1. sorting, the basic principles and characteristics of various internal sorting methods, including the number of comparisons between elements in the sorting process, the total number of sorting passes, the stability of sorting, the calculation of time complexity and space complexity;

2. Insertion sorting method (including folding insertion sorting method);

3. Select the sorting method;

4. (bubble) sorting method;

5. Shell sorting method;

6. Quick sorting method;

7. heap sorting method, including the definition and structure of heap;

"C language programming" section

First, the basic knowledge of C language

1 C language and the composition of C language programs;

2. Data types, including constants and variables such as integer, real and character, and variable assignment; Define types with typedef;

3. Mixed operation between various types of data;

4. Arithmetic expression, relational expression and logical expression, and the meaning of expression sizeof.

Second, basic sentences

1. assignment statement (including conditional assignment statement), conditional statement (including if, if-else, switch), loop statement (including while, do-while, for statement, including loop nesting and break statement and continue statement);

2. Input/output statements, including format input function scanf and format output function printf for integer, real number and character (including character string) data.

Third, the array

1. Definition, reference and initialization of one-dimensional array and two-dimensional array;

2. Definition, reference and initialization of character array, input and output of character array, and application of string and string processing function.

Fourth, function

The definition of 1. function, function parameters (formal parameters and arguments) and the return value of the function;

2. Function calls, including nested calls and recursive calls;

3. The basic concept of command line parameters, the concept and application of main function with parameters.

Verb (abbreviation for verb) pointer

The basic concept of 1. pointer, including definition, purpose, pointer variable as function parameter, function return value and function pointer;

2. Arrays and pointers, including the definition and assignment of pointer variables pointing to arrays, refer to array elements and array names as function parameters through pointers;

3. A string and a pointer, and the pointer variable points to the string.

VI. Pretreatment Description

1. Basic concepts of preprocessing instruction, file inclusion and conditional inclusion;

2. Macro replacement, macro with parameters.

Seven, structure and * * * the same body.

Basic concepts and characteristics of 1. structure, initialization and reference of structural variables, and use of structural pointers;

2. Structure array, including its definition, initialization and application;

3.* * * Basic concepts of usage, * * * references of usage variables.

Eight, bit operation

1. bitwise operation and bitwise operator;

2. The application of bit operation.

Nine. document

The basic concept of 1. file, including file type pointer file and how to use the file;

2. Open the function fopen and close the function fclose file;

3. The status of the file, including feof function and ferror function;

4. Reading/writing files, including applying fread and fwrite functions, fputc and fgetc functions, fgets and fputs functions;

5. Application of input function fscanf and output function fprintf of the file;

6. File location, including the application of rewind function, fseek function and ftell function.

Reference book:

1. Data Structure Course 3rd Edition, edited by Tang, Beijing University of Aeronautics and Astronautics Press 20 17?

2. "C Programming" edited by Tan Haoqiang Tsinghua University Publishing House (unlimited edition)

Official enrollment brochure, Qiqi teacher wishes you success in the postgraduate entrance examination.