VMware (CORE) back-end Development Pen Questions summary

1. Linux to view the system's release version of the command?

Cat/etc/issue and Lsb_release

2. Linux mounts a shared folder:

Mount-t cifc "Windows shared folder" "Linux/mnt path"

3. Paging mechanism of memory: what determines the size of the page?

4. What data structures can be used to express the appropriate expression in an analytic expression? Stack?

5. Master boot recording (MBR, main boot record)

6. What kind of linked list structure is suitable for buffer

7. Which sorting algorithms are not stable

8. Maximum depth of two-fork tree

9.5 liters of water bottles, 3 liters of water bottles, 9.5 liters of water, pour out 4 liters of water problems

10.25 horse races, each running 5, the fastest several times to find the fastest 3 horses. 7 Plays (Ofo interview questions)

11. The number of squares of natural numbers is arranged from small to large into a series of ordered series 149625364964. So the number in the 11th position is 9, and the number in the 88th position is? 8

Mr. A went to the party with his wife, and there were also 3 couples who shook hands with each other, no one shook hands with them, no handshake between the couple, and No 2 shook hands more than once, and when the others told Mr. A that he or she had held a few hand, Mr. A found the answer different.       A how many hands did Mr. A and his wife hold separately? It's all 3 times.

13. Make a large cube of 1000 cubes, color the large cube surface, and ask how many small cubes are not painted in color?

There are 8 painted on 3 sides, 2 are painted with 12* (10-2) = 96, 1 are painted (10-2) * (10-2) * 6 = 384, and no color is 1000-8-96-384 = 512.

Efficiency issues in i++ and ++i

i++ returns the original value, ++i returns the value after 1

i++ cannot be an lvalue, and ++i can

(An lvalue is a value that corresponds to an expression in memory that has an object that determines where the address is stored, and the right value is the value of all expressions that are not lvalue values)

Like what:

int 0 int *p1 = & (++i);   // correct int *p2 = & (i++);   // Error 1;  // correct 5;   // Error

i++ returns a temporary variable, while the temporary variable is the right value. ++i is operated directly in situ

Comparison of the efficiency of the two:

If the built-in numeric type is the same

If some custom classes, such as Iterater, ++i efficiency >= i++ Efficiency

15. First programming question

Power of 2
Time limit: c/C + + language 1000MS; other languages 3000MS
Memory limitations: 65536KB for the C + + language; Other Languages 589824KB topic Description:
Given a number a (1≤a≤9) and a number B (0≤b≤9), you need to determine whether there is a non-negative integer n so that the maximum number of 2^n in decimal notation is a, the lowest digit is B. If present, the output satisfies the minimum n of the condition.
Input
The first line contains two integers, a, B. 1≤a≤9,0≤b≤9
Output
Output corresponding to the answer, if there is no condition to meet the N, output-1.

Sample input
2 2
Sample output
1

Hint
Input Example 2
5 5
Output Example 2
-1

VMware (CORE) back-end Development Pen Questions summary