In addition to Weibo, there is also WeChat
Please pay attention
WeChat public account
Shulou
2025-01-18 Update From: SLTechnology News&Howtos shulou NAV: SLTechnology News&Howtos > Development >
Share
Shulou(Shulou.com)06/02 Report--
This article is to share with you what are the contents of the net interview questions. The editor thinks it is very practical, so share it with you as a reference and follow the editor to have a look.
1. Field coding.
It is required to write: cache class + SqlHelper class (within 30 minutes, then lead from the code to the face object or design pattern).
2. Database.
Two points are asked: the disadvantages of the index, the level of the transaction, and the principle of distributed transactions.
3. Divergent thinking question one.
Topic: e-commerce, instant rush to buy the solution, how will you design.
4. Divergent thinking question 2.
Topic: 4G memory computer, how to read 8G log files for analysis, summarize the data into a report.
5. Return to the basic questions.
Topic: talk about the shortcomings of array, linked list and Hash table.
6 、 IIS .
Topic: the difference between the integration mode of application pool and the classical mode.
7. Divergent problem: security
Topic: what do you think is involved in security?
8. Divergence problem: performance
Topic: where do you think the performance is reflected?
9. Divergent problem: distributed
Topic: what are the differences in clustering, failover, load balancing and distribution?
10. Http protocol
The problem of monkeys choosing a king is a very classic algorithm problem. This problem goes like this: a bunch of monkeys are numbered, and the number is 1Magi 2 Magi 3. M, this group of monkeys (m) sit in a circle in the order of 1m, counting from the first to the nth, the monkey has to leave the circle, so in turn, until there is only the last monkey in the circle, the monkey is the king. It is not difficult to solve this problem, but there are many ways to solve it, and there are many different forms of the problem, which we collectively call the Joseph problem. The basic description of this kind of problem is as follows: n individuals form a circle, counting from the first, the M will be killed, the last one will be left, and the rest will be killed. For example, the order of being killed is: 5, 4, 6, 6, 2, 3, and 1. Let's first analyze several steps to solve this kind of problem.
(1) since there are only two states for each person: dead and alive, each person's status can be marked with a Brown array. True can be used to represent death and false for life.
(2) everyone is alive at the beginning, so the initial values of the array are all assigned false.
(3) simulate the process until everyone is killed.
In the title, N individuals are surrounded in a circle, which inspires us to use a circular chain to represent it, and an array structure can be used to form a circular linked list. There are two members in the structure, one is a pointer to the next person to form a circular chain, and the other is a sign of whether the person has been killed, a value of 1 indicating that he is still alive. Count the people who are still alive from the first person, and every time you count to M, change the mark in the structure to 0, indicating that the person has been killed. This cycle counts until 15 people are killed.
However, whether it is implemented in linked lists or arrays, they all have one thing in common: to simulate the whole game process, not only the program is annoying to write, but also the time complexity is as high as O (nm). When NMagne m is very large (for example, millions, tens of millions), it is almost impossible to produce results in a short time. We note that the original question only requires the serial number of the final winner, rather than asking the reader to simulate the whole process. Therefore, if we want to pursue efficiency, we should break the rules and implement a little mathematical strategy.
Thank you for reading! This is the end of this article on "what are the net interview questions?". I hope the above content can be of some help to you, so that you can learn more knowledge. if you think the article is good, you can share it for more people to see!
Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.
Views: 0
*The comments in the above article only represent the author's personal views and do not represent the views and positions of this website. If you have more insights, please feel free to contribute and share.
Continue with the installation of the previous hadoop.First, install zookooper1. Decompress zookoope
"Every 5-10 years, there's a rare product, a really special, very unusual product that's the most un
© 2024 shulou.com SLNews company. All rights reserved.