The following is the official website exam outline:
Of course not. : 90 1 course name: data structure and programming
First, the overall requirements of the examination
This exam consists of data structure and program design, each accounting for 50% of the total score.
Data structure is a basic course of computer science and technology, which requires students to master the basic data structure and related storage methods, basic operations, algorithms and applications, and be able to use one of boxplot, structured language, C class and high-level language (C or C++) to write algorithms.
Programming refers to object-oriented programming with C++ language and data structure knowledge. Students are required to master the object-oriented programming method and the basic concepts, grammar and programming methods of c++ language.
Second, the content and proportion of the examination
The contents of the data structure exam include: (50% of the total score)
1, the definition, characteristics, storage structure and related basic algorithms of linear table, sequential table and linked list.
2. Definition, characteristics, sequence and chain storage representation of stack and basic algorithm; Application of stack; Definition and characteristics of queues; The definition, characteristics and basic algorithm of the correlation between chain queue and circular queue; Recursive stack and implementation
3. Definition and storage structure of generalized table.
4. Definition, nature and storage structure of binary tree; The definition, process and algorithm of traversing binary tree; Application of binary tree; Conversion between trees, forests and binary numbers; Huffman tree and its application: recursive algorithm related to binary tree application
5. Definition and storage structure of graph; Traversal process and algorithm of graph; The construction process and algorithm of minimum spanning tree: topological sorting process and algorithm; Critical path related content; Shortest path related content; Recursive algorithm related to the application of graph
6, static table lookup process and algorithm, dynamic table lookup process and algorithm; The construction of hash table and its conflict handling method
7. The characteristics, processes and algorithms of internal sorting such as insert sorting, quick sorting, selective sorting, combined sorting and radix sorting.
The contents of the programming test include: (50% of the total score)
1, basic grammar and common sentences, basic concepts of object-oriented.
2. Function call, function parameter, function overload and function scope.
3. The concept, definition and description of a class, its member functions and scopes.
4. The concept of the object, the initialization of the object, the special generation method of the object and the lifetime of the object.
5. Object pointer and object reference, object array
6. Inheritance of classes and derived classes
7. Virtual base classes and virtual functions
8, overload and its application
9. Template and its application
10, basic data structure and algorithm programming
Third, the types and proportions of test papers.
Examination questions:
Data structure part:
Including practical problems and algorithm design problems: practical problems include brief description problems, explanatory problems, graphic problems, chart problems, process description problems, essay problems and so on. Algorithm design should adopt appropriate methods to write algorithms according to requirements.
Proportion: actually doing the problem (60%)
Algorithm design problem (40%)
Programming part:
Including program filling, writing program results and program design.
Fill-in-the-blank question: This question gives a functional description of the program and some hints. Candidates fill in the missing parts of the program to make the program complete and realize the described functions.
This question is 20 points, 2-4 questions.
Writing program result question: This question gives the C++ program, which has passed the debugging. Candidates need to give the output results after normal operation according to the grammar and semantics of C++. It is necessary to give correct results according to the sequence of program running, and it is not necessary to judge the correctness of the program.
This question is 30 points, 4-6 questions.
Program design: according to the requirements in the topic, write a complete C++ program and conform to the program design specifications.
This question type is 25 points and 2 questions.
Four. Examination form and time
The examination forms are all written, and the examination time is three hours (full mark 150).