This year's results have finally been calculated, and I have come ashore without any danger, write a blog and record it.
Preface
This year's postgraduate entrance exams have exploded across the board, and almost every computer college that deserves a name is hard to pass. The number of special masters is even full. Give some simple examples that I know
1. Jinan University (a liberal arts college): A total of 65 applicants will be admitted to 1049
2. Xiamen University: less than 50 applications will be accepted for 1200
3. Fudan University: A little more than 100 will be collected for registration 2000+ score line 360 (320 last year)
......... There are many more, I will not give examples one by one.
In the context of this situation, the original plan of 80 places for Wuhan University of Computer Science and Technology's soft college + engineering college was later expanded to 130+ (three consecutive years of expansion), of which the expansion of soft college was nearly doubled (30 to 68), and the final score Soft school 320, design school 350, soft school 300, school school 345, compared with the next door Huazhong Normal University re-examination line meter special 359, soft school 354 personally feel very conscientious
On the question of whether the retest is black or not
Almost everywhere on the Internet, the problem of martial arts retesting is black. It may have been a bit black in the past few years. I have never experienced this and I am not sure. But in terms of my own retest experience, I personally feel that it is completely fair and open. There is no black problem. I personally Wuhan Shuangfei University, the final retest score is the top five, and the interview is 90+. A classmate I know in the class next door to our school got the first place in the re-examination of software major. In addition, Wuhan University of Technology’s initial test scores accounted for 70% and retest scores accounted for 30%. On this question, the benevolent sees the benevolent and the wise sees the wisdom.
About the initial test
There are many experience posts on the public courses of mathematics, English and politics, so I won’t repeat them here. Just talk about professional courses
Recommended book
1. Kingway or Tianqin (Tianqin is recommended for cross-examination)
2. Data structure 1800 (you can choose to fill in the blanks if you have time, even if you don’t have time)
3. Comprehensive practice of data structure and algorithm (Hu Yan, Yuan Jingling version), Wuhan Polytechnic's own textbook (the original question was published for two consecutive years)
4. Make good use of real questions (very important, often original questions)
Initial test questions
Reminiscence version
Multiple-choice question 20:
How many substrings are there in a 1.8-character string
2. How to resolve conflicts
3. How many fixed points are the maximum number of simple loops given to a graph
4. Construct a Huffman tree to find wpl
I don't remember the others
Short answer questions 20 points
1. I gave a piece of code to ask about the time complexity and where is the best place to insert the node. I don't remember. (The original question in previous years, one word has not been changed )
2. What are the characteristics of the data storage structure 5 points
3. The content of the deque 5 points
4. Why use a linear structure to represent the matrix, and define a matrix structure 5 Points (the original question of the previous year )
50 points
for application questions 1. Give a generalized table and draw the storage structure ( original question of previous years )
2. Best ternary merge tree ( original question of previous years )
2. Give adjacency list and write topological sorting ( original question of previous years )
3. Construct a balanced binary tree (given a lot of nodes, a little complicated, no problem if you are careful)
4. Cardinality sorting (send points)
Algorithm for 60 minutes question
1. Two non-decreasing as a merge linked list ( Tianqin or king has very simple )
2 to a generalized sequence table, the binary tree structure (corresponding to 13-year retest written original title )
3. The scenic Find all paths and lengths in time (P93, Comprehensive Practice of Data Structures and Algorithms)
4. Delete a node of the binary sort tree, and it is still a binary sort tree after deletion.
The overall test paper is difficult, but the Wuhan University of Technology professional course reform paper and a pile of loose 120.130, do the real questions and the recommended books above, personally feel that 120 is completely fine.
The difficult words are mainly short-answer questions and algorithmic questions , just focus on the practice.
About retest
This year, the computer-based test was cancelled. Only interviews and written tests are available, but the difficulty of the computer-based test is also reflected in the written test.
written examination
1Find coins. I'll give you 63 yuan. There are always coins with denominations of 25, 10, 5, and 1. Ask how many coins you need at most. (Greedy) 15 points
2 bracket matching problem, if it does not match, delete some brackets to match. (Application of the stack) 20 points and
3 maximum sub-segment sum. (Divide and conquer method) 15 points
4 job scheduling (greedy/backtracking) 20 points
5 proof of reasoning 10 points
6 proof of partial order relationship 10 points
7 proof tree correlation 10 points
There is a big gap between the scores of everyone in the written test, which is a better 80+ and a bad 30+, so the written test almost determines your retest score.
Interview
Prepare a ppt introduction for 3-5 minutes. After the introduction, the teacher will give an English question. What I asked is my future learning direction. I answered machine learning, so it is best to find a relevant direction after the initial test. Just know a little bit of related concepts.
After that, I asked professional questions. Because I brought my resume, I almost always asked them based on the questions on the resume. . Pay attention here. If you think your resume is okay, it is recommended to bring your own resume, which will add points. However, all the questions on the resume must be specially understood. The teacher will ask deeply. If I only understand it briefly, I suggest not to write it on the resume. I saw someone write big data on the resume. The result was dumb when asked by the teacher. . . However, interviews generally cannot score points, and the points are generally not lower than 80-90.