Winter voted byte beating back-end development intern advertising department, informed me through the resume screening HR call me the next day 14:00 telephone interview.
1:30 I entered the interview room, when the interviewer 1:50 also came in, and then we started the interview.
The first part asked the network:
1.TCP and UDP What is the difference?
Just learning the computer network, this part of the answer will come up.
2.TCP connection process?
Three-way handshake fourth wave, this part of the answer also come up.
3. Network layered?
The interviewer asks the layer 7 (OSI), I learned five (Xie Xiren), I will answer the five.
The second part asked Operating Systems:
1. Understand the process and thread it? Talk.
I only know the process, do not understand the thread. To talk about the definition of talk about the process, three states, concurrency control.
2. concurrency control began to ask why?
I gave the example of transfers.
The third part asks programming languages:
1.Java and C ++ What are the characteristics in comparison?
My answer is no pointer Java, programmers do not need to spend too much effort to manage memory.
Why 2.C ++ run faster than Java?
I said, since the Java programmers do not need to spend energy management memory core Java programmers have for managing memory, so run slower. . .
The fourth part of the database to ask:
1.MySQL What are the characteristics compared with other major database?
Although used, but only used, I do not say not. But then I checked the search features in a few points and I imagine almost, that is easy to install less trouble.
2. Understand the index it? The principle know it?
I know there fast search index, the inserts and updates, we also need to spend resources to maintain the index. But I do not know the realization of the principle underlying (and later checked a B + tree).
Part V asked algorithm:
1. Principle talk about various sorting algorithms and time complexity.
I answer selection sort, bubble sort, insertion sort, two points insertion sort, quick sort, merge sort.
2. a binary tree algorithm problem: given a binary tree to determine the value of all the leaf nodes and left.
Simply look at this problem Road algorithm is not difficult, but dictated entirely by the interviewer, no problem and no description of the sample, there is no good binary tree structure as to LeetCode. Binary tree structure is a pain, but I used preorder and inorder Shredded a binary tree. Beginning a little bug, but the interviewer and I agreed that the bug is not in my algorithm on the binary tree structure, so I started looking bug with the interviewer and, finally, I found the first successful AC.
The interview also lasted 35 minutes, leaving time Shredded code also 10 minutes of it, so the algorithm out of the question should not be too difficult. Unexpectedly interview process I expected bytes are not the same interview process, I learned that seniors into the face pulled me into an exchange group had to make surface-byte seniors give me some face by / through cool there is a seniors say a few algorithms questions. Byte beating importance side algorithm is a name, but my interviewer who asked me finally algorithm, which makes me a little by surprise.
This is the first interview I code farming career, never before experience in this area. Interviewer attitude is better, the interview also more casual, interview experience better. I felt face bytes (internship / school recruit) or to see more networks, more than understand the principle, do not light will be used. Temporarily think of them, I think back to fix.
