Programming Interviews Exposed : Secrets to Landing Your Next Job

Paperback

Mongan, John/ Suojanen, Noah/ Giguere, Eric 저자(글)

Wrox Press · 2007년 01월 01일

책 소개

작가정보

저자(글) Mongan, John/ Suojanen, Noah/ Giguere, Eric

목차

• 
  Acknowledgments ix
  Contents xi
  Acknowledgments ix
  Preface for the Second Edition xvii
  Preface to the First Edition xix
  Before the Search 1(6)
  Know Yourself 1(2)
  Know the Market 3(1)
  Basic Market Information 3(1)
  What About Outsourcing? 3(1)
  Develop Marketable Skills 4(1)
  Sanitize Your Online Profile 5(1)
  Summary 6(1)
  The Job Application Process 7(8)
  Finding and Contacting Companies 7(2)
  Networking 7(1)
  Working with Headhunters 8(1)
  Contacting the Company Directly 8(1)
  Job Fairs and Classified Ads 9(1)
  The Interview Process 9(2)
  Screening Interviews 9(1)
  On-Site Interviews 10(1)
  Dress 10(1)
  A Recruiter's Role 11(1)
  Offers and Negotiation 12(2)
  Dealing with Recruiter Pressures 12(1)
  Negotiating Your Salary 12(1)
  Accepting and Rejecting Offers 13(1)
  Summary 14(1)
  Approaches to Programming Problems 15(10)
  The Process 15(2)
  The Scenario 15(1)
  The Problems 16(1)
  Which Languages to Use 16(1)
  Interactivity Is Key 17(1)
  Solving the Questions 17(3)
  The Basic Steps 18(1)
  When You Get Stuck 19(1)
  Analyzing Your Solution 20(3)
  Analyzing Two Examples 20(1)
  How Big-O Analysis Works 21(1)
  Best, Average, and Worst Cases 22(1)
  How to Do Big-O Analysis 22(1)
  Optimizations and Big-O Analysis 23(1)
  Summary 23(2)
  Linked Lists 25(28)
  Kinds of Linked List 25(2)
  Doubly-Linked Lists 27(1)
  Circularly-Linked Lists 27(1)
  Basic Linked List Operations 27(3)
  Tracking the Head Element 27(1)
  Traversing 28(1)
  Inserting and Deleting Elements 29(1)
  Linked List Problems 30(22)
  Stack Implementation 30(5)
  Maintain Linked List Tail Pointer 35(5)
  Bugs in removeHead 40(1)
  Mth-to-Last Element of a Linked List 41(3)
  List Flattening 44(4)
  List Unflattening 48(1)
  Null or Cycle 49(3)
  Summary 52(1)
  Trees and Graphs 53(14)
  Trees 53(7)
  Binary Trees 55(1)
  Binary Search Trees 56(1)
  Lookup 57(1)
  Heaps 58(1)
  Common Searches 59(1)
  Breadth-First Search 59(1)
  Depth-First Search 59(1)
  Traversals 59(1)
  Graphs 60(1)
  Binary Tree Problems 61(5)
  Preorder Traversal 61(1)
  Preorder Traversal, No Recursion 62(2)
  Lowest Common Ancestor 64(2)
  Summary 66(1)
  Arrays and Strings 67(22)
  Arrays 67(4)
  C/C++ 68(1)
  Java 69(1)
  C# 70(1)
  JavaScript 70(1)
  Strings 71(2)
  C 71(1)
  C++ 72(1)
  Java 72(1)
  C# 73(1)
  JavaScript 73(1)
  Array and String Problems 73(15)
  Find the First Nonrepeated Character 73(3)
  Remove Specified Characters 76(3)
  Reverse Words 79(4)
  Integer/String Conversions 83(1)
  From String to Integer 83(2)
  From Integer to String 85(3)
  Summary 88(1)
  Recursion 89(18)
  Understanding Recursion 89(3)
  Recursion Problems 92(13)
  Binary Search 92(3)
  Permutations of a String 95(2)
  Combinations of a String 97(3)
  Telephone Words 100(5)
  Summary 105(2)
  Concurrency 107(14)
  Basic Thread Concepts 107(5)
  Threads 107(1)
  System Threads versus User Threads 108(1)
  Monitors and Semaphores 108(1)
  Deadlocks 109(1)
  A Threading Example 109(3)
  Concurrency Problems 112(5)
  Busy Waiting 112(2)
  Producer/Consumer 114(3)
  The Dining Philosophers 117(3)
  Summary 120(1)
  Object-Oriented Programming 121(10)
  Fundamentals 121(3)
  Classes and Objects 121(1)
  Inheritance and Polymorphism 122(2)
  Construction and Destruction 124(1)
  Object-Oriented Programming Problems 125(4)
  Interfaces and Abstract Classes 125(2)
  Virtual Methods 127(1)
  Multiple Inheritance 128(1)
  Summary 129(2)
  Databases 131(12)
  Database Fundamentals 131(5)
  Relational Databases 131(1)
  Structured Query Language (SQL) 132(3)
  Database Transactions 135(1)
  Database Problems 136(6)
  Simple SQL 136(1)
  Company and Employee Database 137(2)
  Max, No Aggregates 139(1)
  Three-Valued Logic 140(2)
  Summary 142(1)
  Other Programming Topics 143(16)
  Graphics 143(1)
  Bit Manipulation 144(2)
  Binary Two's Complement Notation 144(1)
  Bitwise Operators 145(1)
  Optimizing with Shifts 146(1)
  Graphics and Bit Operations Problems 146(11)
  Eighth of a Circle 146(3)
  Rectangle Overlap 149(4)
  Big-endian or Little-endian 153(2)
  Number of Ones 155(2)
  Summary 157(2)
  Counting, Measuring, and Ordering Puzzles 159(14)
  Tackling Brainteasers 159(3)
  Solve the Right Problem 160(1)
  Don't Be Intimidated 161(1)
  Beware of Simple Problems 161(1)
  Estimation Problems 162(1)
  Brainteaser Problems 162(10)
  Count Open Lockers 163(1)
  Three Switches 164(1)
  Bridge Crossing 165(4)
  Heavy Marble 169(3)
  Summary 172(1)
  Graphical and Spatial Puzzles 173(12)
  Draw It First 173(1)
  Graphical and Spatial Problems 174(10)
  Boat and Dock 174(2)
  Counting Cubes 176(3)
  The Fox and the Duck 179(1)
  Burning Fuses 180(3)
  Escaping the Train 183(1)
  Summary 184(1)
  Knowledge-Based Questions 185(8)
  Preparation 185(1)
  Problems 186(5)
  C++ versus Java 186(1)
  Friend Classes 187(1)
  Inheritance 187(1)
  Garbage Collection 188(1)
  Network Performance 189(1)
  Cryptography 189(1)
  New Cryptography Algorithms 190(1)
  Hash Tables versus Binary Search Trees 190(1)
  Summary 191(2)
  Nontechnical Questions 193(8)
  Why Nontechnical Questions? 193(1)
  Questions 194(5)
  ``What Do You Want to Do?'' 194(1)
  ``What Is Your Favorite Programming Language?'' 195(1)
  ``What Is Your Work Style?'' 195(1)
  ``Tell Me About Your Experience.'' 195(1)
  ``What Are Your Career Goals?'' 196(1)
  ``Why Are You Looking to Change Jobs?'' 196(1)
  ``How Much Money Do You Want to Make?'' 196(3)
  ``What Is Your Salary History?'' 199(1)
  ``Why Should We Hire You?'' 199(1)
  ``Do You Have Any Questions for Me?'' 199(1)
  Summary 199(2)
  Conclusion 201(2)
  Appendix A: Resumes 203(20)
  Index 223

기본정보

ISBN	9780470121672 ( 047012167X )
발행(출시)일자	2007년 01월 01일
쪽수	준비중
크기	187 * 233 mm
언어	영어