Experience and skills of written test in the last interview
Chapter 1 interviewer rumor 2
1.65438+ No way, stop at operation 2.
1.2 Perfect and imperfect 3
1.3 down-to-earth, cultivate a variety of skills 4
1.4 keep an empty cup mentality 6
1.5 The workplace is the stage for capable people 7.
1.6 learn to talk on paper 8
1.7 Summary 8
Chapter II Interview Experience Exchange 9
2. 1 Mentality decides everything 9
2.2 Don't tell all the lies and don't tell all the truth 10.
2.3 Go your own way and let others talk. 12
2.4 lay a solid foundation and find a way out 14
2.5 This book has its own programming method 15.
2.6 Good written test results will not be despised 17.
2.7 Don't be the company's spare tire.
2.8 Summary 19
Chapter 3 Written Introduction of Enterprise Interview 20
3. 1 Internet enterprises 20
3.2 Network Equipment Providers 25
3.3 Foreign enterprises 29
3.4 State-owned enterprises 32
3.5 Institute 35
3.6 Entrepreneurial enterprises 37
3.7 How to choose 4 1
Chapter 4 Interview Written Test Skills Page 42
4. 1 Don't fight an unprepared battle 42
How to get job information 42
4. 1.2 How to make a resume that employers like 43
4. 1.3 How to apply for resume online efficiently 47
4. 1.4 What will be tested in the interview 48
4. 1.5 is the overlord noodles suitable? 50
4. 1.6 how to answer the non-technical written test 50
4. 1.7 What is workplace code 5 1?
4. 1.8 How to overcome the nervousness in the interview 54
4. 1.9 What are the interview etiquette 55
What do you need to prepare for the interview?
4. 1. 1 1 Are girls suitable for being programmers?
4. 1. 12 Does a programmer eat a youth meal 58
4. Why was1.13 rejected by the enterprise 58
How to prepare for a group interview 59
How to prepare for a telephone interview
4.2 Calm response 62
How to introduce yourself 63
How much do you know about our company?
4.2.3 How to deal with unanswerable questions 65
4.2.4 How to deal with the interviewer's "challenging" language 65
4.2.5 How to deal with the problem of holding different views from the interviewer 66
4.2.6 What would you do if you were not hired in this interview?
4.2.7 What will you do if you are accepted by us?
4.2.8 How do you understand the position you are applying for?
What are your shortcomings?
What are your strengths
4. 2. 1 1 How can you be qualified for this position without working experience?
4.2. 12 How does your good friend evaluate you?
4.2. 13 What should you do when you disagree with your boss?
4.2. 14 Can you tell me something about your family? 7 1
What do you think is best for you to do?
What do you think of overtime work in the company?
What's your hobby? 73
4.2. 18 Did you have an argument with others? How do you solve 74
How do you face the pressure?
4.2.20 Why did you leave your old company?
Why do you like our company?
4.2.22 Why do you think we should hire you?
4.2.23 What is your career plan?
4.2.24 What are your salary requirements?
4.2.25 Do you have any questions for me?
4.3 Signing a contract, 78
4.3. 1 The wind is rustling and the water is cool. What if the quotation is too high?
4.3.2 What matters should be paid attention to when signing a contract or breaking a contract 78
4.4 Summary 8 1
The fifth chapter English interview raiders 82
5. 1 Notes 82
5.2 English self-introduction 83
5.3 Common English interview questions 85
5.4 Commonly used computer vocabulary 94
5.4. 1 computer related courses 94
5.4.2 Terms related to operating system
Algorithm related terms 96
Data structure related terms 97
5.4.5 Computer network related terms 100
Chapter VI Puzzle Introduction 102
6. 1 inference class 102
6.2 Games 107
6.3 Calculation Class 109
6.4 Drawing class 1 1 1
6.5 Water pouring class 1 12
6.6 Weighing Grade 1 13
6.7 optimization class 1 14
6.8 It thinks that class 1 15.
6.9 Bridge crossing grade 1 18
6. 10 probability class 1 19
The following interview and written test techniques conquer the article.
Chapter VII Programming Basis 122
7. 1 C/C++ keywords 122
7. What is the function of1.1static variable 122?
7. What is the function of1.2 const124?
7. Is it necessary to add a break statement at the end of case in1.3 switch statement? Why 127?
7. What is the role of1.4 volatile in programming 128?
7. 1.5 Asserting what ASSERT () is 129
7. 1.6 How to calculate the value of enumeration variable 130?
7. 1.7 char str 1[]= ABC; char str 2[]= ABC; Str 1 is not equal to str2, why is it 130?
7. 1.8 Why does the main () function sometimes take parameters? What do parameters argc and argv mean? 13 1
7. Are all actions in1.9c++caused by main () function 132?
7. 1. 10 *p++ is equivalent to (*p)++? Why 132?
7. 1. 1 1 before and after operation 132 What's the difference?
7. 1. 12 a is a variable. Is it legal to execute (a++) += a statement 133?
7. 1. 13 How to compare float, bool, int and pointer variables with "zero value" 134?
7. What's the difference between1.14 new/delete and malloc/free 135?
7. 1. 15 When do I need to quote as the return value 137?
7. 1. 16 is the software named 6 18 legal 137?
7. In1.17 c language, the integer variable x is less than 0. Is it known that x×2 is also less than 0. 138?
7. Is1.18 exit (status) equal to the status returned by the main () function 138?
7. 1. 19 Given the definition of String class, how to realize its function body 138?
7. 1.20 How to realize the external call of template function in C++ 140?
7. 1.2 1 What is the function of the keyword explicit in C++ 140?
How to handle the exception in 7. 1.22 C++, and which keywords 14 1 are used.
7. 1.23 How to define and implement a member function of a class as a callback function 14 1?
7.2 Memory allocation 142
7.2. What are the forms of1memory allocation 142?
7.2.2 What is a memory leak 143?
7.2.3 What is the maximum stack space? 144.
7.2.4 What is buffer overflow 144?
7.3 sizeof 146
7.3. 1 sizeof is a keyword? 146
7.3.2 strlen(\0)=? sizeof(\0)=? 146
7.3.3 For structures, why is the value returned by sizeof generally greater than the expected value 148?
7.3.4 What will happen if a pointer is added to an address after forced type conversion? 149.
7.4 pointer 150
What are the benefits of using pointers?
7.4.2 Reference or pointer 150
7.4.3 Do pointers and arrays represent the same concept 152?
7.4.4 Whether the pointer can be operated >; 、& lt、gt; =,<=, = = Operation 152
7.4.5 What is the result of adding the pointer to the number 152?
7.4.6 wild pointer? Null pointer 153
7.5 Pretreatment 154
7.5. What is the function of ifndef/define/endif in1c/c++header file 154?
7. 5. 2 # contains filename.h & gt # include "filename.h"155. What's the difference?
7. 5. 3 # What are the defects of the definition 155?
7.5.4 How to declare a constant with define to show how many seconds there are in 1 year (ignoring leap years) 155?
7.5.5 What is the difference between a macro with parameters and the function 156?
7.5.6 Macro Definition Square Operation # Is it correct to define SQR(X) X*X 156?
7.5.7 statements greater than, less than and if cannot be used. How to define a macro to compare the sizes of two numbers A and B 157?
7.5.8 How to judge whether a variable is signed or unsigned 158
What does 7.5.9 # define trace (s) (printf (%s \ n, # s), s) 159 mean?
7.5. 10 does not use sizeof, how to find the number of bytes occupied by int 160?
7. 5. 1 1 How to find the memory offset address of the structure 16 1
7.5. 12 How to judge how many elements are in the array of sizeof 162?
7.5. What is the difference between13 enumeration and definition of 162?
7.5. What's the difference between14 typedef and define 162?
7.5. What's the difference between macro definition and inline function in15 C++164?
7.5. 16 Who is better to define constants? # Define or construct 164
7.6 Structure and Grade 165
7.6. What's the difference between struct and union in1c language 165?
What's the difference between struct in 7. 6. 2 C and C++ 165?
What's the difference between struct and class in 7. 6. 3 c++ 166?
7.7-bit operation 166
7.7. 1 What do the colons and numbers in some structural statements mean 166?
7.7.2 What is the most effective way to calculate 2 times 8? 167.
7.7.3 How to realize bit operation and find the average of two numbers 167?
7.7.4 unsigned int I = 3;; What is the output of printf(%u\n, i*- 1) 168?
7.7.5 How to solve the number 1 in the binary representation of integer 169?
7.7.6 sizeof () function cannot be used. How to judge whether the operating system is 16 bit or 32 bit 170?
7.7.7 What is a big terminal in embedded programming? What is a small terminal 17 1?
7.7.8 Considering N-bit binary numbers, how many numbers are there without two adjacent 1 174?
7.7.9 How to divide two positive integers 175 without division operator?
7.8 Function 179
7.8. 1 How to write a function that accepts variable parameters 179?
7.8.2 What is the difference between function pointer and pointer function 179?
7.8.3 What are the ways for C++function to pass parameter 183?
7.8.4 What is the difference between overloading and overwriting 185?
7.8.5 Is it possible to assign parameters and call functions through the absolute memory address 188?
7.8.6 Can the default constructor call the single-parameter constructor 190?
What are the methods of calling functions in 7. 8. 7 c++ 19 1?
7.8.8 What is a reentrant function? How to write reentrant function in C language 192
7.9 Array 192
7.9.1int a [2] [2] = {{1}, {2,3}}, so what is the value of a[0][ 1] 192?
7.9.2 How to legally represent two-dimensional array 193
7.9.3 a is an array, (int *) (&; What does a+ 1) mean? 193
7.9.4 How to print out the integer 1 to 1000/94 without using the flow control statement?
7.9.5 String [1024]; Is scanf(%s, str) 197 safe?
7.9.6 Which storage efficiency is higher, row storage or column storage? 197.
7. 10 variable 197
7. 10. 1 Similarities and differences between global variables and static variables 197?
7. 10.2 Do local variables need to "avoid" global variables 199?
7. 10.3 How to build and understand a very complicated sentence 199
7. 10.4 What's the difference between variable definition and variable declaration?
7. 10.5 How to exchange the values of two variables 20 1 without using third-party variables?
7. What is the difference between10.6c and C++ variable initialization 202?
7. 1 1 String 202
7. 1 1. 1 How to write strcpy () function 203 without using C/C++ string library function?
7. 1 1.2 How to convert a number into a string 205
7. 1 1.3 How to customize the memory copy function memcpy() 206
7. 12 Compiling 207
What is the difference between compiling and linking 207?
7. 12.2 What's the difference between a compilation language and an interpretation language?
7. 12.3 How to judge whether a program is compiled by C compiler or C++ compiler 208?
7. 12.4 Why add Extern "c" 209 when calling the function compiled by C compiler in C++ program?
7. 12.5 two pieces of code * * * are stored in one file. How to achieve 2 10 by selectively compiling a part?
7. 13 Object-Oriented Relevance 2 10
7. 13. 1 the difference between object-oriented and process-oriented 2 10?
7. What are the basic characteristics of13.2 object-oriented 2 1 1?
7. 13.3 What is deep replication? What is shorthand 2 12?
7. 13.4 What is Youyuan 2 13?
7. 13.5 The difference between copy constructor and assignment operator 2 14?
7. Can the constructor/destructor of the13.6 base class be inherited by the derived class 2 16?
7. What is the difference between13.7 initialization list and constructor initialization 2 16?
7. Are the member variables of class13.8 initialized in the order of declaration? 2 17
7. 13.9 How to initialize a class when it is a member variable of another class 2 17
7. Can13.10 C++design and implement an inheritable class? 2 18
7. The13.11constructor has no return value, so how do you know whether the object was successfully constructed 2 19?
7. What member functions 2 19 are generated by default for empty classes in12c++?
7. 13. 13 How to set the visibility of the class constructor 2 19
7. 13. 14 What's the difference between public inheritance, protected inheritance and private inheritance?
7. 13. 15 C++ function providing default parameters? 22 1
In 7. 13. 16 C++, which situations can only use the initialization list but not the assignment 222?
7. 14 virtual function 223
7. 14. 1 What is virtual function 223?
7. How to realize polymorphism in14.2c++225
7. What do14.3c++inheritance, virtual function and pure virtual function mean respectively?
7. What are the polymorphic species in14.4c++?
7. 14.5 What function can't be declared as virtual function 227?
7. 14.6 Can each function be declared as a virtual function 229?
How to prevent classes from being instantiated in 7. 14.7 C++ 229?
7. 15 programming skills 229
7. 15. 1 What happens when the loop condition of while () is assignment statement 229?
7. 15.2 Don't use if/:? /switch and other judgment statements how to find the maximum and minimum values of two int variables 230
7. What is the function of obtaining file size in 23 1 5.3c language?
7. 15.4 expression a >;; What does b>C mean? 23 1
7. 15.5 How to print your own code232
How to implement the simplest virus 232
7. 15.7 How to judge whether X is a power of 2 233 with only one sentence?
7. 15.8 How to define a pair of mutually referenced structures 233
7. 15.9 What is comma expression 234?
7.15.10 \ nIs it equivalent to \n\r 235?
7. 15. 1 1 What is short circuit assessment 235?
7. 15. 12 Given the random number function rand7 (), how to construct the rand 10 () function 236?
7.15.13 printf (%p \ n, (void *) x) and printf (%p \ n,&; X) What's the difference?
7. Is the return value of15.14 printf () function 237?
7. 15. 15 cannot use any variables. How to realize the function Strlen() 237 for calculating the length of a string?
7. 15. 16 Are the operating principles of negative division and positive division the same?
7. 15. 17 main () After the main function is executed, is it possible to execute another piece of code 238?
Chapter 8 Database 240
8. 1 database concept 240
8. 1. 1 What's the difference between a relational database system and a file database system?
8. What are the functions of1.2 SQL language?
8. 1.3 What's the difference between internal connection and external connection?
8. 1.4 What is Transaction 243?
8. 1.5 What is a stored procedure? What is the difference and connection between it and function? 244
8. 1.6 What is a primary key? What is foreign key 244?
8. 1.7 What is deadlock 245
8. 1.8 What is a * * * lock? What is mutex 245?
8. What's the difference between1.91234 paradigm?
8. 1. 10 How to retrieve the records with the specified interval in the table 247
8. 1. 1 1 What is a check constraint 247?
8. 1. 12 What is view 247?
8.2 SQL advanced application 248
8.2. 1 What is a trigger 248?
8.2.2 What is Index 249?
8.2.3 What is Rollback 250?
8.2.4 What are the types of data backup? 25 1
8.2.5 What is cursor 25 1?
8.2.6 How to ensure the consistency of data in a concurrent environment 252
8.2.7 What happens if the database log is full 252
8.2.8 How to judge who inserted a row of data 252 in the database?
Chapter 9 Network and Communication 254
9. 1 network model 254
9. 1. 1 What is the OSI seven-layer model 254?
9. 1.2 What is the TCP/IP model 255
9. What is the difference between1.3 B/S and C/S 255?
9. 1.4 What is MVC model structure 256?
9.2 Network Equipment 258
What's the difference between a switch and a router?
9.2.2 What is the function of routing table 259?
9.3 Network Protocol 260
9.3.1What's the difference between TCP and UDP 260?
9.3.2 What is three-way handshake? What do you mean disconnect 260 four times?
9.3.3 What is ARP/RARP 262?
9.3.4 What is the principle of IP phone? What protocol is used?
9.3.5 What is the ping command 263
9.3.6 What is the basic HTTP flow 264
9.4 Network Programming 264
How to Program with Sockets 264
9.4.2 What is the difference between blocking mode and non-blocking mode? 265
9.5 Other network problems 266
9.5. 1 What are the common network security protection measures 266
9.5.2 What is SQL injection attack 267
9.5.3 What is the difference between circuit switching technology, message switching technology and packet switching technology?
9.5.4 What are the advantages of IPv6 compared with IPv4?
Chapter 10 Operating System 270
10. 1 process management 270
10. 1. 1 What's the difference between a process and a thread?
10. 1.2 What are the mechanisms for thread synchronization? 27 1
10. 1.3 Difference between kernel thread and user thread 27 1
10.2 memory management 272
10.2. 1 What are the ways to manage memory?
10.2.2 What's the difference between segmentation and paging?
10.2.3 what is virtual memory 272?
10.2.4 What is memory fragmentation? What is internal debris? What is foreign debris?
10.2.5 What's the difference between a virtual address, a logical address, a linear address and a physical address?
10.2.6 What is the cache replacement algorithm 274?
10.3 user programming interface 275
10.3. 1 What's the difference between a library function and a system call 275?
What's the difference between static link and dynamic link?
10.3.3 What's the difference between a static link library and a dynamic link library?
What is the difference between user mode and kernel mode?
10.3.5 What's the difference between the user stack and the kernel stack?
Chapter 1 1 Software Engineering 278
1 1. 1 software engineering process and method 278
11.1.1What are the software engineering processes?
1 1. 1.2 What are the common software development process models?
1 1. 1.3 what is agile development 283?
What are the general diagrams in 1 1. 1.4 UML?
1 1.2 software engineering thought 285
1 1.2. 1 What is software configuration management 285?
What is CMMI 286?
On how to improve the quality of software/kloc-0 /50666.000000000005
Chapter 12 divergent thinking 289
12. 1 design pattern 289
12. 1. 1 What is Monomer Mode 289?
12. 1.2 what is factory mode 290?
12. 1.3 What is adapter mode 290?
12. 1.4 What is the enjoyment mode 29 1?
12. 1.5 What is observer mode 29 1?
12.2 new technology 29 1
12.2. 1 What is cloud computing 29 1?
12.2.2 What is the Internet of Things 292?
12.2.3 What professional books do you usually read?
Chapter 13 data structure and algorithm 295
13. 1 array295
How to Recursively Sum Array 295
How to print out two-dimensional array 296 with for loop
13. 1.3 Inserts and deletes nodes in the sequence table. How many nodes does it move on average?
13. 1.4 How to judge whether an array is incremented by 297 by recursive algorithm?
13. 1.5 How to implement method of bisection algorithm 298 with recursion and non-recursion, respectively?
13. 1.6 How to find the number of times a given number appears in the sorted array 299?
13. 1.7 How to calculate the intersection 300 of two ordered integer arrays
13. 1.8 How to find the most repeated number in the array 30 1
13. 1.9 how to find more than half of the numbers in the array within the time complexity of O(n) 303?
13. 1. 10 How to find the unique repeating element 305 in the array?
13.1.11How to judge whether the values in the array are continuous 308
13. 1. 12 How to find the odd elements in the array 309?
13. 1. 13 How to find the number of qualified number pairs in a sequence 3 1 1?
13. 1. 14 How to find the missing number in the sequence 3 13?
13. 1. 15 How to judge whether there are duplicate elements in an array 3 14?
13. 1. 16 How to rearrange the array so that the left side of the array is odd and the right side is even 3 15?
13. 1. 17 How to get rid of the repeated numbers in the integer array 3 16
13. 1. 18 How to find the second largest number in an array 3 18?
13. 1. 19 How to find the minimum and maximum values in an array 3 19
13. 1.20 How do I move the number of m behind an array to the number of m in front of it?
13. 1.2 1 How to calculate the first n data of a series 32 1
13. 1.22 How to find the number that only appears once in the array 322
13. 1.23 How to judge whether an integer x can be expressed as the sum of n(n≥2) consecutive positive integers 324
13.2 linked list 325
13.2. 1 What's the difference between an array and a linked list?
13.2.2 When should I choose a sequential table and when should I choose a linked list as the storage structure of a linear table 325?
13.2.3 How to use the linked list header 326
13.2.4 how to insert and delete the single linked list 327
13.2.5 how to find the kth element 328 in the single linked list?
13.2.6 How to realize single linked list inversion 329
13.2.7 How to output the single linked list 33 1
13.2.8 How to find the intermediate node of the single linked list 33 1
13.2.9 How to sort the single linked list 332
13.2. 10 How to exchange any two elements in a linked list (excluding the header). 46636 . 6866686666 1
13.2. 1 1 How to detect whether a large single linked list has a ring 335?
13.2. 12 How to judge whether two simple linked lists (acyclic) intersect 337
13.2. 13 how to delete duplicate node 338 in a single linked list
13.2. 14 how to merge two ordered linked lists (non-crossing) 339
13.2. 15 What is a circular linked list 340?
13.2. 16 how to insert and delete a linked list? 34432.00000000000 1
13.2. 17 why is it better to set the tail pointer than the head pointer in the single-cycle linked list?
13.2. 18 how to delete the predecessor node of node 343
13.2. 19 How to delete and insert the bidirectional circular linked list? 30003.00 1000000006
13.2.20 I don't know how the head pointer deletes node 344.
13.3 string 345
How to calculate the number of words in a line of characters
13.3.2 How to reverse the string 346
13.3.3 How to find the first character 350 that only appears once in a string?
13.3.4 How to output all combinations of strings 35 1
13.3.5 How to check whether a character is an integer? If so, its integer value 353 is returned.
13.3.6 How to find the number of occurrences of each character in a string 353
13.4 STL container 354
13.4. 1 what is generic programming 354?
13.4.2 What's the difference between a stack and a queue?
13.4.3 What's the difference between a vector and a list?
13.4.4 How to Implement Circular Queue 355
13.4.5 How to use two stacks to simulate queue operation 357
13.5 sort 359
13. 5. 1 How to select and sort 359
13.5.2 How to sort inserts 360
13.5.3 How to sort bubbles 36 1
13.5.4 How to merge and sort 364
How to quickly sort 366
13.5.6 How to sort Hill 368?
13.5.7 How to sort the heap 369
13.5.8 Advantages and disadvantages of various sorting algorithms 37 1
13.6 binary tree 372
13.6. 1 basics 372
13.6.2 how to recursively traverse binary tree 373
13.6.3 Given the preorder traversal and the median traversal, how to find the postorder traversal 374?
13.6.4 how to realize the postorder traversal of binary tree 376 without recursion?
13.6.5 how to find the depth of binary tree with non-recursive algorithm 378
13.6.6 How to judge whether two binary trees are equal 38 1
13.6.7 How to judge whether a binary tree is a balanced binary tree 38 1
13.6.8 what is Huffman codec 382?
13.7 Figure 383
13. 7. 1 What is topological sort 384?
13.7.2 What is DFS? What is BFS 385?
How to find the critical path
How to find the shortest path
Chapter 14 massive data processing 390
14. 1 problem analysis 390
14.2 basic method 390
14.3 classic case analysis 403
14.3. 1 top k problem 403
Repeat question 405.
14.3.3 sorting problem 407
Confirm 409