Write in front

  this part is not only the highlight of my pre promotion, but also the end.

  in fact, there is a hidden rule in the pre exemption: for example, the document released by a school says that 170 students are enrolled, but the summer camp accounts for 100, and then many students are promoted by the school. Even though there will be a lot of pigeons in the summer camp, there are really few opportunities for foreign schools to be exempted in advance. We are more candidates for pigeons.

    therefore, the probability of getting an excellent camp after the pre promotion of no entry is lower than that of the summer camp, but it is very difficult to enter the summer camp... Computer professional research is so cruel!!

1, Beihang Computer College (9.24-9.25)

  in July, I didn't sign up for the summer camp of Beihang computer college because I was afraid that the computer test would be brushed.

   on September 22, I received the notice of entering the camp from Beihang Computer College: on September 24, I took the computer test, and on September 25, I chose the best interview according to the computer test results.

1. Double stand test (9.23)

  it mainly tests the network environment, examination room environment, candidates' integrity retest commitment and identity authentication.

2. Computer test (9.24)

   starting from 10 a.m., two questions, two hours, the first question is 60 points and the second question is 40 points. Generally, you can enter the interview by making the first question.

   the first question is to use the stack to simulate the process of stable sorting. I can't remember the specific topic clearly. Comparison basis:

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<queue>
#include<stack>
#include<vector>
#include<sstream>
#include<unordered_map>
#include<unordered_set>
using namespace std;

struct node {
	int val;
	int ind;
	node(int val, int ind):val(val), ind(ind){}
};

vector<node*> A, B;  //Stack 
int n;
int cnt = 0;

int find(vector<node*>& v) {  //Find the number of the lowest value in the stack 
	if(v.size() == 0) {
		return -1;
	}
	int ind = 0;
	int n = v.size();
	int _min = v[0]->val;
	int idc = v[0]->ind;
	for(int i = 1; i < n; i++) {
		if(v[i]->val < _min) {
			_min = v[i]->val;
			idc = v[i]->ind;
			ind = i;
		}else if(v[i]->val == _min && v[i]->ind < idc) {  //If the sequence number is the same, select the one with small sequence number 
			_min = v[i]->val;
			idc = v[i]->ind;
			ind = i;
		}
	}
	return ind;
}

int main() {
	int x;
	cin >> n;
	for(int i = 0; i < n; i++) {
		cin >> x;
		node* t = new node(x, i);
		A.push_back(t);
	}
	int id = find(A);
	//First output the minimum value in A 
	for(int i = A.size() - 1; i > id; i--) {
		B.push_back(A[i]);
		A.pop_back();
		cnt++;
	} 
	cout << A[id]->val << " ";  //Output minimum
	A.pop_back();
	cnt++;
	while(A.size() != 0 || B.size() != 0) {
		//Find the minimum value from AB
		int x1 = find(A), x2 = find(B);
		if(x2 == -1) {
			//Output only A
			for(int i = A.size() - 1; i > x1; i--) {
				B.push_back(A[i]);
				A.pop_back();
				cnt++;
			}
			cout << A[x1]->val << " ";
			A.pop_back();
			cnt++;
		}else if(x1 == -1) {
			for(int i = B.size() - 1; i > x2; i--) {
				A.push_back(B[i]);
				B.pop_back();
				cnt++;
			}
			cout << B[x2]->val << " ";
			B.pop_back();
			cnt++;
		}else if(A[x1]->val < B[x2]->val || (A[x1]->val == B[x2]->val && A[x1]->ind < B[x2]->ind)) {
			//Pop up x1 in A
			for(int i = A.size() - 1; i > x1; i--) {
				B.push_back(A[i]);
				A.pop_back();
				cnt++;
			}
			cout << A[x1]->val << " ";
			A.pop_back();
			cnt++;
		}else if(A[x1]->val > B[x2]->val || (A[x1]->val == B[x2]->val &&A[x1]->ind > B[x2]->ind)){
			//Pop up x2 front in B
			for(int i = B.size() - 1; i > x2; i--) {
				A.push_back(B[i]);
				B.pop_back();
				cnt++;
			}
			cout << B[x2]->val << " ";
			B.pop_back();
			cnt++;
		}
	}
	cout << endl;
	cout << cnt;
	return 0;
}
/*
8
86 25 -200 500 301 25 43 78
*/

  the second question is very difficult and I can't remember it clearly.

  in the evening, the list of candidates for the interview was published on the official website, and I was assigned a very high position. The interview starts at 8:30 a.m. on the 25th. Everyone has 20 minutes. I'm in third place, that is, the interview starts at 9:10.

   crazy review of professional courses on the evening of the 24th, but I didn't feel much.

2. Interview (9.25)

  after entering the interview, the first is an English self introduction. Just recite this.

  then I asked a political question. As long as there is no reaction, there will be no problem. I will be flexible.

  next is the math question and answer:

  first question: I think you have written about SVM in your blog. Can you explain what convex sets and convex functions are? After listening, I felt that I was finished. This first question baffled me. The teacher must have a bad impression of me... After thinking about it, I said the definition of convex function in higher mathematics. Convex set directly said no.

  second question: what is the rank of a matrix? This is a good answer: if at least one r-order substituent of a matrix is not 0, and all r+1-order substituents are 0, then R is the rank of the matrix.

  the third question: what is the trace of a matrix? The sum of the main diagonal elements of the matrix.

  after the math interview, I didn't feel very good.

  then the abnormal professional course interview:

  first question: can you explain the difference and relationship between recursion and loop? I feel that I may not have said all. Then the teacher asked the difference between heap and stack according to recursive calls. This is relatively simple.

  second question: what are the compilation processes? I really didn't see much about the compilation principle, but I still talked about the processes. Then the teacher asked me how a c language program changed from a. c file to an executable file step by step, which was reluctantly answered.

  the third question: what is the process from the beginning of power on to the end of loading the operating system? This really touches my blind spot of knowledge... Crying...

  last question: explain the main functions of each layer of the computer network and the process of sending wechat to a person? This has been said for a long time. It can be said.

Conclusion: the questions asked are too comprehensive!!!! I feel that the interview of professional courses of Beihang is really different. It is very challenging and difficult.

  finally, resume interview:

  asked some questions about the paper, and the answers were pretty good. But I feel it doesn't matter. I can't save my garbage professional class!

3. Interview results (9.25 evening)

  no accident! After knowing the result, it's still very uncomfortable!!

2, School of mathematics and statistics, Wuhan University (9.25)

   on September 23, I received an interview invitation for the direction of mathematical machine learning theory of Wuhan University!

1. Interview

   after the interview with Beihang at more than 9 a.m. on the 25th, it was followed by the interview with Wuhan University at more than 11 a.m.

  after entering the interview, the teacher asked me if I was prepared to introduce myself in English? I said I was ready. The teacher smiled and said there was no need to introduce myself. I:??????

  then there was a frenzy of mathematics. I thought the teacher would ask as few math questions as possible because I was a computer major, but the teacher obviously didn't know. After asking about three math questions, I found that my answers were not on the point. Only then did I find that I was a computer major. I didn't learn anything she asked...

  so the teacher asked me what math lessons I learned? I say high number line generation probability theory. Then I was asked several questions about Advanced Mathematics and line generation, and the answer was not very good, but at least I knew what the interview teacher was talking about....

  then he was rejected by a teacher. The teacher said that even if you majored in computer, you should at least review mathematics since you applied for our college? I whispered beep: I thought the teacher would ask me some data structures for the sake of my computer major....

  then there was a silence.

  then a teacher said that even if you come in, you can't keep up. What are you going to do. I said that if I entered Wuhan University, I would certainly learn mathematics well after my postgraduate study.

  the interview is over.

2. Interview results (9.26)

   the interview results will be released the next day. The score includes two parts: background score + interview score. You can pass as long as you reach 60 points after weighting. Unexpectedly, my interview score reached 82.... Because most of them have almost this score. But my background score is only a poor 49.... Then the total score is 59.6... Most people's background scores are about 90. Only me and another computer related major have low scores. I feel that I should have a total score of 59.6, and then calculate my background score according to the interview score...

  I can't rely on others. After all, I'm really not a math related major.

   however, the day before the filling system, that is, on the 27th, Wuhan University still called me and told me that I had been added. This is what happened later.

3, Huake computer (9.25)

  being able to enter Huake's interview was really beyond my expectation, because it was still very difficult for Huake to enter the camp.

   then I checked the enrollment quota and asked the next senior students and sisters in the past. I found that there were not many places for us to be exempted in advance. My hope was really small. I should be cannon fodder, but I decided to participate.

1. Interview

                       .

  the assessment contents include: candidates' personal statement for 1-2 minutes, introducing their academic background, Fundamentals of computer related majors, scientific research experience or engineering practice experience, achievement awards, etc; The examiner asked questions about the examinee's knowledge structure, comprehensive ability and scientific literacy.

  a total of 26 people in my group participated in the interview, and I was the 25th. When it was my turn, the teacher had been interviewing for nearly three hours and felt that they were almost asleep....

  after entering the interview, first open the PPT to introduce yourself. The teacher was also attracted by my CSDN blog. He asked me to open the blog and browse it for about five minutes. He also asked many questions and answered them.

  then a teacher asked me to introduce the paper. I didn't ask me anything after I finished speaking. The interview was over!!

  feelings: the whole interview process felt perfunctory, and the teacher was not very patient. So I know I'm gone again...

2. Interview results (9.26)

  the results came out the next night, and it was brushed as expected. But then a teacher called me and told me that I had a great hope of being added. He told me to wait for the day when I filled in the system and not to give up.