Cracking the Coding Interview - Fooo

Recommendations

Info

Chapter 17 | Networking 17 1 Explain what happens, step by step, after you type a URL into a browser Use as much detail as possible ________________________________________________________________pg 249 17 2 Explain any common routing protocol in detail For example: BGP, OSPF, RIP ________________________________________________________________pg 250 17 3 Compare and contrast the IPv4 and IPv6 protocols ________________________________________________________________pg 252 17 4 What is a network / subnet mask? Explain how host A sends a message / packet to host B when: (a) both are on same network and (b) both are on different networks Explain which layer makes the routing decision and how ________________________________________________________________pg 254 17 5 What are the differences between TCP and UDP? Explain how TCP handles reliable delivery (explain ACK mechanism), flow control (explain TCP sender’s / receiver’s window) and congestion control ________________________________________________________________pg 255 CareerCup com 8 4
Chapter 18 | Threads and Locks How to Approach: In a Microsoft, Google or Amazon interview, it’s not terribly common to be asked to implement an algorithm with threads (unless you’re working in a team for which this is a particularly important skill) It is, however, relatively common for interviewers at any company to assess your general understanding of threads, particularly your understanding of deadlocks Deadlock Conditions In order for a deadlock to occur, you must have the following four conditions met: 1 Mutual Exclusion: Only one process can use a resource at a given time 2 Hold and Wait: Processes already holding a resource can request new ones 3 No Preemption: One process cannot forcibly remove another process’ resource 4 Circular Wait: Two or more processes form a circular chain where each process is waiting on another resource in the chain Deadlock Prevention Deadlock prevention essentially entails removing one of the above conditions, but many of these conditions are difficult to satisfy For instance, removing #1 is difficult because many resources can only be used by one process at a time (printers, etc) Most deadlock prevention algorithms focus on avoiding condition #4: circular wait If you aren’t familiar with these concepts, please read http://en wikipedia org/wiki/Deadlock A Simple Java Thread 1 class Foo implements Runnable { 2 public void run() { 3 while (true) beep(); 4 } 5 } 6 Foo foo = new Foo (); 7 Thread myThread = new Thread(foo); 8 myThread.start(); 8 5 Cracking the Coding Interview | Knowledge Based
Page 1 and 2:
CRACKING THE C O D I N G I N T E R
Page 4 and 5:
CRACKING THE C O D I N G I N T E R
Page 7 and 8:
Table of Contents Foreword 4 Introd
Page 10 and 11:
Dear Readers, CareerCup com Forewor
Page 12 and 13:
My Approach Introduction The focus
Page 14 and 15:
Behind the Scenes | The Microsoft I
Page 16 and 17:
Behind the Scenes | The Google Inte
Page 18 and 19:
Behind the Scenes | The Yahoo Inter
Page 20 and 21:
Interview War Stories the next few
Page 22 and 23:
Interview War Stories | Failure to
Page 24 and 25:
Interview War Stories | You Can (Ma
Page 26 and 27:
Before the Interview
Page 28 and 29:
Before the Interview | Resume Advic
Page 30 and 31:
Before the Interview | Behavioral P
Page 32:
What You Need To Know Before the In
Page 35 and 36:
At the Interview | Handling Behavio
Page 37 and 38:
At the Interview | Handling Technic
Page 39 and 40: At the Interview | Handling Technic
Page 41 and 42: At the Interview | Five Algorithm A
Page 43 and 44: At the Interview | The Offer and Be
Page 45 and 46: At the Interview | Top Ten Mistakes
Page 47 and 48: At the Interview | Frequently Asked
Page 49 and 50: Interview Questions How This Book i
Page 52 and 53: Part 1 Data Structures
Page 54 and 55: Chapter 1 | Arrays and Strings 1 1
Page 56 and 57: 2 1 Write code to remove duplicates
Page 58 and 59: Chapter 3 | Stacks and Queues 3 1 D
Page 60: Chapter 4 | Trees and Graphs 4 1 Im
Page 63 and 64: Chapter 5 | Bit Manipulation How to
Page 65 and 66: Chapter 6 | Brain Teasers Do compan
Page 67 and 68: Chapter 7 | Object Oriented Design
Page 69 and 70: Chapter 8 | Recursion How to Recogn
Page 71 and 72: Chapter 9 | Sorting and Searching H
Page 73 and 74: Chapter 10 | Mathematical How to Ap
Page 75 and 76: Chapter 11 | Testing Testing Proble
Page 77 and 78: Chapter 12 | System Design and Memo
Page 80 and 81: Part 3 Knowledge Based
Page 82 and 83: Chapter 13 | C++ 13 1 Write a metho
Page 84 and 85: Chapter 14 | Java 14 1 In terms of
Page 86 and 87: Chapter 15 | Databases 15 1 Write a
Page 88 and 89: Chapter 16 | Low Level 16 1 Explain
Page 92: Chapter 18 | Threads and Locks 18 1
Page 95 and 96: Chapter 19 | Moderate 19 1 Write a
Page 97 and 98: Chapter 20 | Hard 20 1 Write a func
Page 99 and 100: Each problem may have many 'optimal
Page 101 and 102: Solutions to Chapter 1 | Arrays and
Page 109: Solutions to Chapter 1 | Arrays and
Page 112 and 113: Solutions to Chapter 2 | Linked Lis
Page 118 and 119: Approach 2: Solutions to Chapter 3
Page 120 and 121: Solutions to Chapter 3 | Stacks and
Page 129 and 130: Solutions to Chapter 4 | Trees and
Page 139 and 140: Solutions to Chapter 5 | Bit Manipu
Page 141 and 142:
Solutions to Chapter 5 | Bit Manipu
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Solutions to Chapter 6 | Brain Teas
Page 151 and 152:
Page 153 and 154:
Page 155:
Page 158 and 159:
Solutions to Chapter 7 | Object Ori
Page 160 and 161:
Page 162 and 163:
Page 164 and 165:
Page 166 and 167:
41 } 42 } Overview: Solutions to Ch
Page 168 and 169:
Page 170 and 171:
Page 172 and 173:
Page 174 and 175:
Page 176 and 177:
Solutions to Chapter 8 | Recursion
Page 178 and 179:
Page 180 and 181:
Page 182 and 183:
Page 185 and 186:
Solutions to Chapter 9 | Sorting an
Page 187 and 188:
Page 189 and 190:
Page 191 and 192:
Page 193 and 194:
Solutions to Chapter 10 | Mathemati
Page 195 and 196:
Page 197 and 198:
Page 199 and 200:
Page 201 and 202:
Page 203 and 204:
Solutions to Chapter 11 | System De
Page 205 and 206:
Page 207 and 208:
Page 209 and 210:
Page 211 and 212:
Page 213 and 214:
Page 215 and 216:
Solutions to Chapter 12 | Testing 1
Page 217 and 218:
Page 219 and 220:
Page 221 and 222:
Solutions to Chapter 13 | C++ 13 1
Page 223 and 224:
Page 225 and 226:
Page 227 and 228:
Page 229 and 230:
Page 231 and 232:
Solutions to Chapter 14 | Java 14 1
Page 233 and 234:
Page 235 and 236:
Page 237 and 238:
Solutions to Chapter 15 | Databases
Page 239 and 240:
Page 241 and 242:
Page 243 and 244:
Solutions to Chapter 16 | Low Level
Page 245 and 246:
Page 247 and 248:
Page 249 and 250:
Page 251 and 252:
Page 253 and 254:
Page 255 and 256:
Solutions to Chapter 17 | Networkin
Page 257 and 258:
Page 259 and 260:
Page 261 and 262:
Page 263 and 264:
Solutions to Chapter 18 | Threads a
Page 265 and 266:
Page 267 and 268:
Page 269 and 270:
Page 271 and 272:
Solutions to Chapter 19 | Moderate
Page 273 and 274:
Page 275 and 276:
Page 277 and 278:
Page 279 and 280:
Page 281 and 282:
Page 283 and 284:
Page 285 and 286:
Solutions to Chapter 20 | Hard 20 1
Page 287 and 288:
Page 289 and 290:
Page 291 and 292:
Page 293 and 294:
Page 295 and 296:
Solutions to Chapter 20 | Hard 20 p
Page 297 and 298:
Page 299 and 300:
Page 301 and 302:
Page 303 and 304:
Solutions to Chapter 20 | Hard 32 m
Page 305:
Solutions to Chapter 20 | Hard 17 }
Page 308 and 309:
M matrixes 101, 102, 163, 169, 184,
Page 310:
About the Author Gayle Laakmann’s
show all

Cracking the Coding Interview - Fooo

Create successful ePaper yourself

Delete template?

Save as template?