GitHub link:
Interview questions summary github.com
LeetCode high frequency title and subject classification github.com
The ZooKeeper
1. the CAP Theorem
2. ZAB protocol
3. Leader election algorithms and processes
the Redis
1. the Redis application scenario
2. Redis supported data type (compulsory)
3. zset jump table data structure (compulsory)
4. is the Redis expiration policy data (compulsory)
embodied in Redis 5. the LRU policy expiration
6. how to solve the avalanche Redis cache, cache PENERTRATION
7. the Redis persistence mechanism (compulsory)
8. the pipe Redis pipeline
Mysql
1. transaction the basic elements of
2. the transaction isolation level (compulsory)
3. how to solve the problem of concurrent transactions (dirty reads, phantom reads) (compulsory)
4. MVCC multi-version concurrency control (compulsory)
5. binlog, redolog, all undolog What is, what role
6. innoDB lock table row lock /
difference and 7. myisam innodb, and when selecting MyISAM
8. the Why B + tree as an index structure (compulsory)
9. the leaf nodes of the B + tree index can be What things (compulsory) deposit
10. the query does not take the index (anticipated) (compulsory) at what time
how 11. sql optimization
12. explain how to resolve the sql
13. order by the principle of
JVM
A data area (memory model) (compulsory) running 1.
2. garbage collection (compulsory)
3. The garbage collection algorithm (compulsory)
4. Minor Full GC trigger conditions and the GC
5. GC in Stop the world (STW )
6. characteristics and differences of each of the garbage collector
7. parent delegation model
8. JDBC and parent delegation model relationships
9. JVM optimized lock and the lock inflation procedure
Java base
1. HashMap and ConcurrentHashMap difference (compulsory)
2. data ConcurrentHashMap structure (compulsory)
3. how high concurrent HashMap rings are produced
4. volatile action (compulsory)
5. the atomic how to guarantee the atomicity of class (CAS operation) (compulsory)
distinction 6. synchronized and Lock (the compulsory )
7. Why using a thread pool (compulsory)
8. ThreadPoolExecutor core thread pool parameters (compulsory)
9. the workflow ThreadPoolExecutor (compulsory)
10. how to control the priority of thread pool threads
how between the threads 11 communication
12. Boolean occupy a few bytes
13. jdk1.8 / jdk1.7 respectively added which features
14. Exception and Error
the Spring
IOC / 1. Spring AOP implementation of a (compulsory)
2. The dynamic proxy implementations (compulsory)
How to solve the circular dependency 3. Spring (three cache) (compulsory)
4. the Spring postprocessor
5. how @Transactional Spring's implementation (compulsory)
6. Spring spread levels Affairs
7. Contact and the difference between BeanFactory and ApplicationContext the
other
how to limit 1. high concurrent flow system to achieve
2. high concurrent spike system design
3. load balancing how to design
complement
addition, it will test a number of computer networks, operating systems like ah. Like the message queue, RPC framework of this test is relatively small. The computer network is layered ah, tcp / udp ah, three-way handshake and the like. Operating system is the data structure of processes and threads, ah, how the communication process and the like. Sorting algorithm data structure is also more often test, test, then definitely give you a quick handwritten row. The remaining issues to rely on the algorithm of the accumulated LeetCode. In fact, non-algorithmic problem Kong algorithm test Duman simple, a lot of questions entirely examine your intelligence is normal, a little difficulty involves some idea of the algorithm according to the type of classification LeetCode topic, each doing twelve basic questions can be completely cope interview.
