Author: called orange
link: https://www.nowcoder.com/discuss/197798
Source: Cattle-off network
US corporations face the rear end of practice questions, we hope to help point the way to save the character.
Interview Time: June 10,
java basis:
1: int, double, float length
2:32 whether bit 64-bit machine and the same machine length int
3: Common collections, hashMap whether the key is empty, put two empty consecutive how, the use of hashMap need attention.
4: How to determine whether two objects are the same
Concurrency:
5: Introduction of ConcurrentHashMap get, put, size process
6: volatile usage scenarios
7: know what lock
8: AQS synchronization queue spin lock acquisition, but why not synchronize to spin
9: synchronize lock escalation process
JVM:
10: What garbage collector, CMS garbage collection process
11: How to locate the problem occurs frequently fullGC
12: How to deal with memory leaks
13: JVM tuning command
14: How old's the size of the new generation of division
database:
15: InnoDB concurrency issues arise, how to solve, how transactions are implemented
16: connect the left and right connector, the connector, which is the default
Design Patterns:
17: Spring in what used design patterns
Algorithm problem:
String representation of the number of super sum
Author: grade issues say
link: https://www.nowcoder.com/discuss/196250
Source: Cattle-off network
link: https://www.nowcoder.com/discuss/196250
Source: Cattle-off network
I choose internships machine learning, because of his thesis to do is to optimize the logistics, so research resume is to optimize the logistics, so the main contents of the interview that is optimized with relevant content.
I have a paper CCF B two EI, currently a CCF A paper in the cast
Side 4.26
The interviewer is my internship supervisor
1. Self-introduction
2.PSO difference with distinction, PSO with the DE SA's (I have a paper related with the PSO CCF B)
3. Code
[4,5,6, 1,2,3] find an ordered sequence of two division points, said sequential first lookup O (N) then a binary search of said O (logN) and implemented
Chat: Why not pursue a Ph.D. degree, at home there, practice time
Dihedral 4.30
1. self-introduction, thesis, project
2. java Map What achieve, hashmap worst-case complexity.
3. How to prevent the optimization process into local optimization?
I take tabu search and ACO with Tabu as an example to explain the idea of preventing into local optimum, the balance of the two E, exploration and exploitation
4, for the take-away delivery system modeling, talk about the characteristics of this model of VRP
Multi-target, multi-constraint (capacity, time window ..)
The code that implements the Math.sqrt ()
dichotomy
Newton iterative method
In fact, you can do as an optimization problem, Taylor expansion of the first-order or second-order approximation of the true value
6.5 on three sides
I waited quite a long time that it is cold
9:00 interviewer shortly after they received a phone call that the problem is not complicated, I was in the hallway phone face up
1. No self-introduction, directly asked arithmetic point of the paper, explained the techniques proposed by one side of your paper
2. practice time
3. recently doing things
This problem is usually reflects the importance of the brush paper, follow the recent publication of some of the top papers tell us, his own understanding and bold idea say it is very important.
The day of the lunch break, HR little sister called me to confirm the time and the reward. In addition, students have the same direction add friends with the exchange Kazakhstan
Author: I do not mind coming to work it this
link: https://www.nowcoder.com/discuss/194726
Source: Cattle-off network
link: https://www.nowcoder.com/discuss/194726
Source: Cattle-off network
Video face 16:00, the interviewer is very straightforward, with no gossip, also asked a basis for comparison, ask questions I can know the result of a 7788, so I knocked back two algorithms questions, cool, I did not write out a following It is the result.
Did not let introduce himself, he took up the items on my resume began to ask:
1. I think you used the redis distributed lock, you talk about how to achieve;
2. you about redis how to ensure atomicity;
Common data structures 3.redis of what you used?
4. 100 concurrent requests, while reducing inventory, will not appear concurrency problems?
The main project is asked Redis, and then began to ask basic the Java:
5.lock and synchronized difference;
5.lock and synchronized difference;
6.synchronized do those optimization;
Later, Wen mysql:
7. What are the transaction isolation level, the difference between them?
8. how to achieve specific isolation level
9. The index data structure
Using a video feature interview cattle off the net, he let out after two algorithms, let me knock
1. Non-recursive preorder traversal of a binary tree
2. merge two ordered lists
I do not live up to expectations, an algorithm can not write, I realized that my data structure is really as bad shi, to learn from start to finish again, the way you recommend how to learn? ? Very confused, I want to follow Mu class online face of the data structure of the video to start watching