Morning test
1, language handler (compilation principle).
2, computer English.
3, C skills. For the experience of C. Have you mentioned.
4, CASL algorithm. Includes data structures. Algorithm: Implementation, shift (block), sort, retrieve. Recurns, etc.
5, test Mart. Parity, cross-check Ma, Hemingma, CRC). Circular calendar is more important. Hayming code can correct one wrong. About the computation of the error correction bits of Haiming Code. That is, it is wrong to judge the first generation. Generation of cyclic check code. Judging between cross-calibration. This is also a difficult point and focus.
6, the principle of the three original color, binary representation. The calculation of audio sampling frequency. / * Don't forget the multimedia, this is also 5 points. This is very small in this regard, and it can compare the research on the test of the previous year.
7, grammar, grammar. Limited self-motivation (five yuan) drawing. Figure foreground. The derivation of grammar. / Everyone should figure out him, have been taken in 8 years.
8, labyrinth problem. This question is difficult!
9, English is committed to completing the fill in the blanks, also testing the time. Analysis of the word meaning. In fact, in the afternoon, it is a pointer (linked list, tree, graph) algorithm (mainly based on backtracking, recursive).
C language algorithm 1, recursive distribution push and return to two steps. Generally returned with a RETURN statement to returns a value of a layer.
2, back toner. Usually the program sets a judgment. Satisfy to continue, vice versa back to the previous one. (Allegro is more difficult)
3, greedy method. Different from the back, it is always. Also a judgment statement. / * Note the call relationship between the procedure * / program, backpack problem, eight queen, the horse walks a step.
C data structure 1, the operation of the list. The calculation of the tree.
2, stack, queue operation.
3, the algorithm of the figure. The shortest path of the adjacent distance, minimum tree, topology, critical path. / * More pay more attention to the pointer, don't get rope * /
program
Polynomial multiplies. Insert, delete. The front bunch of symbols transformation.
CASL assembly: 1. Syntax, compilation, including assembly instructions. (Note the difference between And.or, ERDE, LEA and LD.) 2, assembly basic algorithm. Displacement instruction --- Complete the operation of multiplying and taking. 2, the transformation of the progress. Different conversion. 3, except for the operation. 4, sort, retrieve.
