1024 Programmers Day Technology Competition Algorithm and Security Answer Standard Answers

Please note that the order of answers is different each time, please identify carefully.

 

Quickly check the answers to calculation questions and professional questions:

4 sticks

11,24

Symmetric encryption algorithm

42

6787

All options in the question are possible

Remote control software

6 times

25002550

593

June 1, 2017

x increases proportionally to the root n

15 bottles of medicine

Specific topics:

Regarding phishing emails, which of the following is incorrect: (B)

A: Even if the mailbox provides security protection, all emails delivered to the mailbox may not be safe.

B: Any URL link in the email can be clicked at will, and there is no security risk.

C: Hackers can write malicious programs into attachments, such as pictures, excel tables, and exe files.

D: The "sender address" of the email can be forged

When you see "A well-known website is suspected of being dragged into the database and a large amount of user data is leaked", what actions can you take to ensure the security of your account? (C)

A: This website is not commonly used on a daily basis, so I don’t care about it.

B: I didn’t register for this website, it has nothing to do with me

C: Check whether the website you have registered has simple passwords or weak passwords, and change them in time

D: It scares the baby to death. I will never use this website again.

Banxianjun and his fans made a bet. Each of them shouts a number from 1 to 3. Whoever shouts 30 first wins. What is the probability of winning by shouting first? (This question is provided by UP master @半仙君_) (D)

A:1

B:Can't win at all

C:3

D:2

There are currently 5 elements, each of which is different and comparable to each other. We can find the median of 5 elements by repeatedly comparing the sizes of two elements. What is the minimum number of comparisons that can be used to ensure that the median of 5 elements can always be found? (This question is provided by UP master @Algorism) (A)

A:6 times

B:7 times

C:8 times

D:9 times

Calculate the sum of all even numbers from 100 to 10000 (inclusive). (This question is provided by UP master @python learner) (D)

A:25002050

B:20002550

C:20502550

D:25002550

The final exam was over, and the teacher decided to take the students to a burrito shop to eat roast duck pancakes. When the teacher saw the pie and the duck, he organized an activity: each person could take away one piece of pie, and whoever rolled up the most delicious food would win the title: King of Rollers! Vita really wants to get the title of "King of Roll King". His flatbread can hold food with a total size of no more than 500. Now there are 7 pieces of duck meat and 6 cucumbers. Each food has its own size and deliciousness. The size of each piece of duck meat: 85, 86, 73, 66, 114, 51, 99 The deliciousness of each piece of duck meat: 71, 103, 44, 87, 112, 78, 36 The size of each cucumber: 35, 44 , 27, 41, 65, 38 The deliciousness of each piece of cucumber: 41, 46, 13, 74, 71, 27 The teacher requires that there be at least one piece of duck meat and one cucumber in the flatbread. Please tell me, what is the maximum delicacy of the food rolled into the Vita? (This question is provided by UP master@primary student Vitajun) (C)

A:612

B:496

C:593

D:584

The TV series "Conquest" was released on 2003-03-18. In the ninth episode, Liu Huaqiang stabbed a melon seller. Assuming that the stabbing happened on 2003-03-26, ask the melon seller how far back it is 2021-10-24 , how many days have you been stabbed? (This question is provided by UP master @Jack-Cui) (A)

A:6787 days

B:6789 days

C:6769 days

D:6777 days

Social engineering attack methods are commonly used by hackers. They do not directly obtain data through the use of tools or programs, but indirectly obtain sensitive data through verbal deception. In the network environment, the methods of using social engineering to attack are complex and varied. The following methods of social engineering attacks are (A)

A: All options in the question are possible

B: Received an email from a bank domain name

C: The text message received shows the bank customer service number

D: Public WeChat ID with bank name searched by WeChat

Which of the following statements about computer viruses is incorrect? (C)

A:Word documents can also be infected with viruses

B: Installing anti-virus software can effectively reduce the risk of computer virus infection

C: As long as you do not access the Internet, you can avoid computer viruses.

D: Try to visit official websites to download applications to reduce the probability of being infected with computer viruses.

Which of the following passwords is the most secure? (D)

A: Repeated numeric password

B: Password the same as username

C: The 8-digit password after the ID card

D: A comprehensive password of more than 8 characters containing numbers, characters, and letters

A child practices climbing steps. There are 10 steps in total. The child can choose to climb 1-3 steps at a time. But the 3rd and 6th steps are enchanted so that once a child steps on them, they will stop and start dancing to "New Treasure Island". So, how many ways are there to prevent children from jumping on "New Treasure Island"? (This question is provided by UP master@Magic Squad Captain) (A)

A:42

B:46

C:40

D:44

Password security technology is also an important technology in the field of network security and is applied to the secure and encrypted transmission of network data. There is an existing encryption algorithm. The encryption method is very simple: add 5 to each letter, that is, a is encrypted into f. The key of this algorithm is 5. Then this encryption algorithm belongs to (D)

A: Block cipher algorithm

B: Public key encryption algorithm

C: One-way functional cryptographic algorithm

D: Symmetric encryption algorithm

When will the Cybersecurity Law of the People's Republic of China come into effect? (A)

A: June 1, 2017

B: December 31, 2016

C:November 7, 2016

D: January 1, 2017

Lizi found a fan to play a game. At the beginning, everyone had equal wealth. In each round of the game, everyone had to pay 1 yuan randomly (with equal probability) to one of the two people. The richest and poorest player after each round of the game was recorded. The gap is x (there is no upper or lower limit on each person's wealth), then after enough n rounds of games, which of the following descriptions is correct? (This question is provided by UP owner @利子LePtC) (B)

A:x increases proportionally to n raised to the power of 2

B: x increases proportionally to the root n

C: x increases proportionally to n

D:x fluctuates near 0

 The "National First Fake Base Station SMS Management Report" recommends that you should not trust text messages sent by unfamiliar numbers, let alone click on unfamiliar links at will. Excuse me, if the sender of the text message is a friend, how should we treat it? (B)

A: We should trust the number of an acquaintance

B: An acquaintance’s number. Even if you ask for help early in the morning or late at night, you still have to call back for consultation and verification.

C: The number of an acquaintance. After preliminary screening, you can trust its content.

D: Who still sends text messages nowadays? Even if it’s an acquaintance’s number, ignore it

A friend sent "Look at my photo http://***.cn/**.jpg...htm" through a communication tool. How should the user operate? (D)

A: Click directly to open the link

B: Do not access the link, forward it to other friends

C: Visit and forward to other friends

D: First check with the friend to see if he has sent a link to the photo.

A Trojan horse program generally refers to a malicious program hidden in a user's computer. It can be used to steal important data and information on the user's networked computer without the user's knowledge. (B)

A:A horse made of wood

B:Remote control software

C: damaged disk

D:Computer operating system

There are n bottles of medicine and 4 rats, of which there is only one bottle of poison. The rat died after eating it for one day. Now you only have one day to find the poison. What is the maximum value of n? (This question is provided by UP master @半仙君_) (B)

A:16 bottles of medicine

B:15 bottles of medicine

C:10 bottles of medicine

D:9 bottles of medicine

There is a thin wooden pole 27 cm long, and there is an ant at each of the five positions: 3 cm, 7 cm, 11 cm, 17 cm, and 23 cm. The wooden pole is very thin and cannot pass two ants at the same time. At the beginning, it was arbitrary whether the ants' heads were facing left or right. They would only walk forward or turn around, but not retreat. When any two ants meet, they will turn around and walk in opposite directions at the same time. Assuming that ants can walk one centimeter per second, find the shortest and longest time for all ants to leave the wooden pole. (This question is provided by UP Master@IT Private School) (D)

A:10;26

B:13;25

C:12;23

D:11;24

The Incense Clock (also known as the Match Rope Clock) is a method of timing burning incense. It uses elm bark powder, adds a small amount of straw and natural elements, mixes it with a certain proportion of water, and then pours it into a mold to make incense. According to the mold, the incense clock is made into different lengths. The thickness of incense can be measured by burning to produce timed incense in various units of time, such as Chen incense (2 hours), carved incense (15 minutes), etc. During the battle of Tubao, the general arranged for the left and right vanguard battalions to set off at Chou hour, and agreed to surprise the enemy camp from the west and north sides of the enemy's base camp at 5 quarters (1 hour and 15 minutes) after departure. All the carved incense in the camp were destroyed due to improper storage. Currently, there are only Chenxiang in the camp, and Chenxiang cannot be broken or divided evenly. As the marching staff of the left avant-garde battalion, you must come up with a specific timing plan. If you want to determine the duration of 5 quarters, how many chenxiang sticks are needed? (This question is provided by UP master @黑马programmer) (C)

A:6 pieces

B:3 pieces

C:4 roots

D:5 roots

There are currently 5 elements, each of which is different and comparable to each other. We can find the median of 5 elements by repeatedly comparing the sizes of two elements. What is the minimum number of comparisons that can be used to ensure that the median of 5 elements can always be found? (This question is provided by UP master @Algorism) (D)

A:8 times

B:7 times

C:9 times

D:6 times

 Author: Mr. Cat who doesn’t like to laugh https://www.bilibili.com/read/cv13685193 Source: bilibili

Guess you like

Origin blog.csdn.net/u012118993/article/details/120934629