Knowledge Point Outline

Operating System:
1. What kind of States are involved in the process, the status transition diagram, and the events that cause the conversion.
2. Differences between processes and threads.
3. process communication methods.
4. Several Methods of thread synchronization. (Be sure to write questions about producers and consumers to fully understand them)
5. Thread implementation method (that is, the difference between the user thread and the kernel thread)
6. Differences between the user State and the core state.
7. Differences between user stack and kernel stack.
8. Memory Pool, process pool, and thread pool. (C ++ programmers must master)
9. The concept of deadlock, the cause of the deadlock.
10. Four conditions that cause a deadlock.
11. Four ways to handle deadlocks.
12. methods to prevent deadlocks and methods to avoid deadlocks.
13. process scheduling algorithm. (Turnaround time = program end time -- start service time, weighted turnaround time = turnaround time/required service time)
14. Windows Memory Management (Block, page, segment, and segment page ).
15. Several Algorithms Used for memory continuous allocation and their respective advantages and disadvantages.
16. Dynamic and Static links.
17. Basic paging and request paging storage management methods.
18. Basic Segmentation and request segmentation storage management methods.
19. Compare the advantages and disadvantages of the multipart paging mode.
20. Several Page Replacement algorithms calculate the number of pages to change. (How is the LRU application implemented ?)
21. Virtual Memory definition and implementation method.
22. Four features of the operating system.
23. DMA.
24. spooling.
25. Storage allocation methods and advantages and disadvantages.

 

Computer Network
1. What is the difference between circuit switching and group switching? Comparison of advantages and disadvantages.
2. Which layers does OSI have? We will draw them out and know their respective functions.
3. What layer does TCP/IP have? The main Protocol names of each layer are listed.
4. Concepts and functions of hardware (MAC) addresses.
5. What layer of ARP is the purpose and algorithm of ARP?
6. CRC redundancy check algorithm, back code and check algorithm.
7. How to implement transparent transmission.
8. Know which data exchange device is used at each layer. (Vswitches, routers, and gateways)
9. Contents of the route table.
10. Grouping forwarding algorithm.
11. The meaning of fields in the format of IP packets must be understood.
12. What is MTU? MTU discovery mechanism, traceroute (understanding ).
13. Concepts and algorithms of the RIP Protocol.
14. Main Functions of ICMP protocol.
15. Concepts of multicast and broadcast, and the use of IGMP. (Loop back address, broadcast address)
16. The implementation principle of the ping protocol, in the ping command format.
17. The concept of subnet division, subnet mask.
18. IP address classification, how to divide it, and the number of hosts supported by various addresses.
19. The concept, purpose, and implementation algorithm of DNS query.
20. Differences Between TCP and UDP and their advantages and disadvantages.
21. UDP Message format and field meaning.
22. The format and meaning of fields of TCP packets.
23. What measures does TCP use to ensure reliable transmission?
24. Three handshakes and four disconnections.
25. concept and significance of time_wait status.
26. Differences between the Sliding Window Protocol and the Stop wait protocol.
27. TCP traffic control and congestion control implementation principles (a typical diagram of congestion control will be drawn ).
28. Fast retransmission and fast recovery algorithms of TCP.
29. Differences between TFTP and FTP.
30. Blocking and non-blocking methods: Blocking connect and non-blocking connect. (Difficult. If you are interested, you can understand it)
31. Basic HTTP format. (Java programmers must master)

 

Design Mode:
1. Usage of various common modes (class diagrams ).
2. Dual check implementation in singleton mode.
3. MVC Mode

 

Algorithm data structure:
I. Algorithms
6. Typical Dynamic Programming Problems (matrix concatenation problem, Longest Common subsequence problem, and 0-1 backpack problem ).
8. Typical greedy problems (activity arrangement problems, knapsack problems, loading problems, Harman coding, single-source shortest path, and minimal spanning tree problems ).
10. Classic backtracking algorithms (problems after N, problems with 0-1 backpacks, and problems with travel sellers ).

Ii. Data Structure
1. data structure definition.
2. Two applications of Stack: parentheses matching and expression calculation. How is it applied? Which expression is used for expression calculation? What are the benefits?
3. String Matching Algorithm: Simple Matching Algorithm and KMP algorithm.
4. Binary Tree pre-order, middle-order, and post-order recursive Traversal Algorithms. The non-recursive traversal algorithm before a binary tree.
5. heap, heap creation algorithm, heap insertion and deletion algorithm, and heap sorting.
6. Hash. What are the types of hash functions? How can I obtain the remainder? How to handle conflicts? What are the methods for closing the hash?
7. Search, insert, and delete binary search trees. Time complexity.
8. How does one rotate the inserted node of the binary balancing tree? Which of the following conditions is applicable. Analyze the time complexity of the binary balancing tree.
9. Definition of the Red-black tree, performance analysis of the Red-black tree and comparison with the binary balancing tree.
10. Storage representation of the graph.
11. insert and sort the linked list, and merge and sort the linked list.
12. Which sort algorithms are commonly used to compare their time complexity, stability, and usage.
13. Which of the following types of common assignment sorting are available? The definition, classification, and principle of base sorting.
14. External sorting process.
15. Concepts and purposes of Tree B, Tree B +, and trie, and principles of adding and deleting nodes.