Programming Interviews Exposed: Secrets to Landing Your Next Job

by John Mongan; Noah Suojanen

• ISBN13: 9780471383567
• ISBN10: 0471383562
• Format: Paperback
• Copyright: 2000-05-01
• Publisher: Wiley

Summary

"This classic book uncovers what interviews are really like at America's top software and computer companies and provides you with the tools to succeed in any situation. The authors take you step-by-step through new problems and complex brainteasers they were asked during recent technical Interviews." "50 interview scenarios are presented along with in-depth analysis of the possible solutions. The problem-solving process is clearly illustrated so you'll be able to easily apply what you've learned during crunch time. You'll also find expert tips on what questions to ask, how to approach a problem, and how to recover if you become stuck. All of this will help you ace the interview and get the job you want."--BOOK JACKET.

Table of Contents

Preface	xi
Acknowledgments	xv
The Job Application Process	1	(10)
Contacting Companies	1	(3)
Screening Interviews	4	(1)
On-site Interviews	4	(1)
Dress	5	(1)
Recruiters	5	(1)
Offers and Negotiation	6	(2)
Accepting and Rejecting Offers	8	(3)
Approaches to Programming Problems	11	(12)
The Process	11	(2)
About the Questions	13	(1)
Solving the Questions	14	(2)
When You Get Stuck	16	(1)
Analysis of the Solution	17	(6)
Linked Lists	23	(36)
Singly Linked Lists	24	(4)
Modifying the Head Pointer	24	(2)
Traversing	26	(1)
Insertion and Deletion	27	(1)
Doubly Linked lists	28	(1)
Circular Linked Lists	29	(1)
Stack Implementation	29	(7)
Maintain Linked List Tail Pointer	36	(5)
Bugs in RemoveHead	41	(2)
Mth-to-Last Element of a Linked List	43	(4)
List Flattening	47	(6)
Null Or Cycle	53	(6)
Trees and Graphs	59	(16)
Trees	59	(7)
Binary Trees	61	(1)
Binary Search Trees	62	(1)
Lookup	62	(3)
Heaps	65	(1)
Common Searches	65	(1)
Breadth-First Search	65	(1)
Depth-First Search	66	(1)
Traversals	66	(1)
Graphs	66	(1)
Preorder Traversal	67	(2)
Preorder Traversal, No Recursion	69	(2)
Lowest Common Ancestor	71	(4)
Arrays and Strings	75	(26)
Arrays	75	(3)
C/C++	77	(1)
Java	77	(1)
Perl	78	(1)
Strings	78	(2)
C	79	(1)
C++	79	(1)
Java	79	(1)
Perl	80	(1)
First Non-repeated Character	80	(3)
Remove Specified Characters	83	(4)
Reverse Words	87	(5)
Integer/String Conversions	92	(9)
Recursion	101	(24)
Binary Search	106	(2)
Permutations of a String	108	(5)
Combinations of a String	113	(4)
Telephone Words	117	(8)
Other Programming Topics	125	(34)
Graphics	125	(2)
Bit Operators	127	(2)
Structured Query Language (SQL)	129	(3)
Concurrency	132	(3)
Eighth of a Circle	135	(2)
Rectangle Overlap	137	(5)
Big-endian or Little-endian	142	(3)
Number of Ones	145	(3)
Simple SQL	148	(1)
Company and Employee Database	148	(2)
Max, No Aggregates	150	(2)
Producer/Consumer	152	(7)
Counting, Measuring, and Ordering Puzzles	159	(18)
Count Open Lockers	164	(2)
Three Switches	166	(1)
Bridge Crossing	167	(4)
Heavy Marble	171	(6)
Graphical and Spatial Puzzles	177	(16)
Boat and Dock	178	(3)
Counting Cubes	181	(4)
The Fox and Duck	185	(3)
Burning Fuses	188	(1)
Escaping the Train	189	(4)
Knowledge-Based Questions	193	(20)
Resumes	193	(1)
The Questions	194	(1)
C++ and Java	195	(1)
Including Files	196	(1)
Storage Classes	196	(1)
Friend Class	197	(1)
Class and Struct	197	(1)
Parent Class and Child Class	198	(1)
Argument Passing	199	(2)
Macros and Inline Functions	201	(1)
Inheritance	202	(1)
Object-Oriented Programming	203	(1)
Thread Programming Issues	204	(1)
Garbage Collection	205	(2)
32-Bit Operating System	207	(1)
Network Performance	207	(1)
Faster Disk Access	207	(1)
Database Advantages	208	(1)
Cryptography	209	(1)
New Cryptography Algorithms	210	(1)
Hashtables and Binary Search Trees	210	(3)
Non-Technical Questions	213	(10)
The Questions	214	(1)
What do you want to do?	215	(1)
What is your favorite programming language?	216	(1)
What is your work style?	216	(1)
Tell me about your experience.	217	(1)
What are your career goals?	217	(1)
Why are you looking to change jobs?	217	(1)
How much money do you want to make?	218	(3)
What is your salary history?	221	(1)
Why should we hire you?	221	(1)
Do you have any questions for me?	222	(1)
Appendix: Resumes	223	(22)
Index	245