1, include "" and <> difference
include <file> compiler will be first to the standard library of files to find
include "file" the compiler will first from the current directory to find the file
include statements are intended to include the standard header files (e.g. stdio.h or stdlib.h), because these headers are rarely modified, and they are included in the standard are always stored under the file directory compiler. #include "file" statement is generally used to contain non-standard header files because these header files are typically stored in the current directory, you can change them frequently, and require the compiler always use the latest versions of these headers.
https://blog.csdn.net/weixin_36571185/article/details/78240931
2, static, static local variable? The life cycle? static keyword (global, local, member variables, member functions)
3, external externC
4、inline
5, heap and stack difference
6, new malloc difference
7, the difference between process threads
8, interprocess communication
9, a number of Shredded balance algorithm problem
Seems to be a digital front half portion and the latter half of the sum of the integer numbers together with the same, such that 1221
10. Why use virtual destructor modified?
11, said polymorphic static and dynamic polymorphism polymorphism, virtual function tables and virtual function pointers)
12, talk about smart pointers?
13, do not want to access other objects of this class, how should I do? Then how to access their own? (A: the constructor arranged private, then define a function to access the private static constructor)
14, the base class, the derived class calls the constructor, destructor order, and some access issues.
15, are familiar with the data structure it? Then write the order traversal of a binary tree, recursive, non-recursive.
16, to an array, the longest successive digital output string. (Has been optimized)
17, coroutine find out about it?
Coroutine is more lightweight threads. To solve a common problem among switching between threads and processes for switching (kernel overhead is too large for), coroutine each state (blocking, running) switch is programmable, rather than controlled by the kernel, reducing overhead.
Features: The application layer program, a recording context stack area, leaps performed during execution of the program. You can choose to perform non-blocking part to enhance operational efficiency.
18, write code, insert and delete the title of the list
https://www.nowcoder.com/discuss/256913?type=post&order=time&pos=&page=1
19, Cpp and the difference between C, their characteristics
20, C application can do it (chicken dish actually do not know the answer ... the answer is yes ...)
21, you know callback function
22, singleton had it is useful to
23, C why should we increase in STL, its features, advantages
24, often used string functions, standard
25, you know reentrant functions do, how to achieve reentrant, the static keyword you know it, and it may have to do re-entry
26, volotile keywords you know
27, calculated the size of the structure you know
28, project useful to do too many threads, multithreading is to write it, multi-thread-related call interface which
29, define an array A [10], does not allow the definition of other variables, pointer out the first element by way of (feeling pit, the difference between the array name and pointer should like to ask?)
30, two pointers have to find out about it, the content of the two pointers are stored
31, talk about common data structure
32, the queue is useful to you (for vector Jiaoshu ,,, then you talk about it)
33, the process you have to go to school to learn the data structure of this course do? Figure know it?
34, talk about the idea of a single chain reversal
35, the tree traversal are those
36, how to calculate the depth of a binary tree
37, the operating system has learned, do you know a producer-consumer model it?
38, TCB do you know?
39, talk about the deadlock, how to avoid deadlocks (I do not know ...)
40, you know you synchronize mutually exclusive
41, interprocess communication, understanding it
42, to give you a programming question, count factorial
43, driver code that you have to find out about it (no!)
44. Do you think computer-related books in what is more important, what to say about the book read
45, Python which more modules / bag used
46, talk about inside the python dictionary
47, expect the workplace
48, talk about synchronous asynchronous
49, multi-threaded how to ensure data security, but also know that in addition to locking
50, the project encountered difficulties how to solve
51, Linux user mode kernel mode have to find out about it
52, the understanding of millet
53, C ++ properties
54, there are several lock
55, the operating system heap and stack What is the difference
56, sorting algorithms know what to tell you about the time complexity
57, why lock
58, C ++, multithreading
https://www.nowcoder.com/discuss/244500?type=post&order=time&pos=&page=1
59, process communication, thread synchronization (sync said after the producers and consumers of communication say)
60, Huffman compression (cited an example)
61, describes a binary tree (say a binary tree, AVL tree)
62, Linux's GCC (four process and each step instruction)
63, QT signals groove (connect function)
64, why malloc but also new (to the difference between them answer)
65, singleton
66, broke four times and three-way handshake
67, the stack in reverse order recursion
68, circular queue Shredded
69, linux detection memory usage;
70, linux view the system of common commands
71, socket server build process
72, red-black tree insert, use of red-black tree (red-black trees did not see how, turning the one not answer it);
73, two programmed: binary image, the set of all subsets;
74, exhaust stack
75, statistics on the number of reverse
The original is divided into two sequences before and after use to prove safety on offer ideas merged, the two sequences are the statistics for the number of reverse, then the two sequences of statistics on the number of reverse, and then continue to merge ideas; I after thinking said the interviewer let me hand-written code, written after he facie that should be right.
76, STL space in the Configurator, ask why the free list is a multiple of 8byte?
- He asked the beginning of that question: how the current maximum queue record in a queue, the minimum value of the stack with a little acquaintance, but this harder, I said I thought that stack solution ideas down, then interview said you determine Me? I said I look down, and then he discovered the problem, put his problems found with the interviewer spoke next, and then talked about the minimum idea is that the solution to my stack of evolved; then the interviewer prompted me pop, push, getmax these three methods is O (n * lg (n)) time complexity, I said with a heap me? He said the complexity of the heap inserted a long time, I think the next to say do not come out.
- Finally, ask the reverse of that time complexity of the number, let me push equation, I did not launch it, then the interviewer in front of me pushed a hand
https://www.nowcoder.com/discuss/52218?type=post&order=time&pos=&page=2
https://www.nowcoder.com/discuss/52132?type=post&order=time&pos=&page=1