Found a programmer Interview Guide

Source: Internet
Author: User
My roommate borrowed this book from the library. It's amazing to everyone. From Job Search to interview, from data structure Algorithm From smart questions to non-technical questions. Search for the Internet. List the information and for your reference. We also congratulate you on finding a job and entering the exam-taking age ......

《ProgramProgramming interview exposed: secrets to landing your next job), mongan, J. Translated by Yang Xiaoyun, Beijing, Mechanical Industry Press, 2003.3
: Ftp://down.ftpun.com: 2121/books/computer books/other books/programmers
Directory:
Chapter 1 job search process 1

1.1 engage with the Company 1
1.2 screening interview 3
1.3 formal interview 3
1.4 clothing 4
1.5 career intermediary 4
1.6 work invitation and consultation 5
1.7 accept or reject work invitations 7

Chapter 1 answers to the program design questions 9

2.1 interview process 9
2.2 interview question 11
2.3 Answer Method 11
2.4 When a problem occurs 13
2.5 analyze the solution 15

Chapter 19 linked list 19

3.1 One-way linked list 19
3.1.1 modify the header pointer 20
3.1.2 traverse 21
3.1.3 insert and delete 22
3.2 two-way linked list 24
3.3 circular linked list 24
3.4 interview example: stack implementation 25
3.5 interview example: tail pointer 31 of the linked list
3.6 interview example: correcting removehead functions 37
3.7 interview example: M-last element 39 in the linked list
3.8 interview example: flattening the linked list 42
3.9 interview example: Empty linked list and circular linked list 48

Chapter 3 tree and Figure 53

4.1 Tree 53
4.1.1 Binary Tree 54
4.1.2 binary search tree 55
4.1.3 heap 57
4.1.4 common search methods 58
4.1.5 traverse 58
4.2 fig 59
4.3 interview example: traverse 59 on the left
4.4 interview example: Traverse left without recursion 60
4.5 interview example: the lowest public ancestor 63

Chapter 5 array and string 65

5.1 array 65
5.1.1 C/C ++ 66
5.1.2 Java 67
5.1.3 perl67
5.2 string 68
5.2.1 C 68
5.2.2 C ++ 68
5.2.3 Java 69
5.2.4 Perl 69
5.3 interview example: the first non-repeating character 69
5.4 interview example: delete a specific character 72
5.5 interview example: reverse Word Order 76
5.6 interview example: integer/String Conversion 81

Chapter 2 Recursive Algorithms 87

6.1 interview example: Binary Search 91
6.2 interview example: 93 strings in full
6.3 interview example: a string of 98
6.4 interview example: telephone key word 101

Chapter 2 other programming problems 7th

7.1 computer graphics 109
7.2-bit operator 110
7.3 Structured Query Language 112
7.4 concurrent programming technology 115
7.5 interview example: Draw 1/8 circular 117
7.6 interview example: whether the rectangle overlaps 120
7.7 interview example: byte storage in ascending order and in descending order 124
7.8 interview example: 126 of "1"
7.9 interview example: simple SQL query 129
7.10 interview example: Company and employee database 129
7.11 interview example: maximum value. The statistical function 131 is not allowed.
7.12 interview example: Producer/consumer question 132

Chapter 2 intelligence related to counting, measurement, and sorting 8th

8.1 interview example: Unlock 143
8.2 interview example: three switches 145
8.3 interview example: bridge over the bridge 146
8.4 interview example: Find rock 149

Chapter 2 intelligence related to graphics and space 9th

9.1 interview example: Ship and dock 154
9.2 interview example: 156 square meters
9.3 interview example: Fox and duck 159
9.4 interview example: huosuo 161
9.5 interview example: Dodge train 163

Chapter 2 basic computer knowledge 10th

10.1 resume 165
10.2 answer points 165
10.3 interview examples: C ++ and Java 166
10.4 interview example: header file 167
10.5 interview example: Storage Class 167
10.6 interview example: Friend 168
10.7 interview example: class and structure 168
10.8 interview example: parent class and subclass 169
10.9 interview example: parameter transfer 170
10.10 interview example: Macro and embedded functions 171
10.11 interview example: Inherit 173
10.12 interview example: Object-oriented programming 173
10.13 interview example: thread-related programming questions 174
10.14 interview example: Automatic Recovery of discarded memory 175
10.15 interview example: 32-bit operating system 177
10.16 interview example: 177 network performance
10.17 interview example: high-speed disk cache 177
10.18 interview example: Database advantages 178
10.19 interview example: encryption technology 178
10.20 interview example: new encryption algorithm 179
10.21 interview example: hash table and binary search tree 1 7 9

Chapter 2 non-technical issues 11th

11.1 answer points 181
11.2 question: What kind of work are you going to do? 182
11.3 question: What is your favorite programming language? 183
11.4 question: What is your work habit? 184
11.5 question: can you talk about your personal experience? 184
11.6 question: What is your career goal? 184
11.7 question: Why do you want to change jobs? 184
11.8 question: How much do you want to pay? 185
11.9 question: What is your previous reward level? 187
11.10 question: why should we hire you? 188
11.11 question: Do you have any questions? 188
Appendix Method for writing resumes 189
VII

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.