Cracking the Coding Interview - Fooo

Recommendations

Info

Solutions to Chapter 18 | Threads and Locks 18 5 Suppose we have the following code: class Foo { public: A(.....); /* If A is called, a new thread will be created and * the corresponding function will be executed. */ B(.....); /* same as above */ C(.....); /* same as above */ } Foo f; f.A(.....); f.B(.....); f.C(.....); i) Can you design a mechanism to make sure that B is executed after A, and C is executed after B? iii) Suppose we have the following code to use class Foo We do not know how the threads will be scheduled in the OS Foo f; f.A(.....); f.B(.....); f.C(.....); f.A(.....); f.B(.....); f.C(.....); Can you design a mechanism to make sure that all the methods will be executed in sequence? SOLUTION CareerCup com pg 86 i) Can you design a mechanism to make sure that B is executed after A, and C is executed after B? 1 Semaphore s_a(0); 2 Semaphore s_b(0); 3 A { 4 /***/ 5 s_a.release(1); 6 } 7 B { 8 s_a.acquire(1); 9 /****/ 10 s_b.release(1); 11 } 12 C { 13 s_b.acquire(1); 14 /******/ 15 } ii) Can you design a mechanism to make sure that all the methods will be executed in sequence? 1 Semaphore s_a(0); 2 6 2
Solutions to Chapter 18 | Threads and Locks 2 Semaphore s_b(0); 3 Semaphore s_c(1); 4 A { 5 s_c.acquire(1); 6 /***/ 7 s_a.release(1); 8 } 9 B { 10 s_a.acquire(1); 11 /****/ 12 s_b.release(1); 13 } 14 C { 15 s_b.acquire(1); 16 /******/ 17 s_c.release(1); 18 } 2 6 3 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 90 and 91:
Chapter 17 | Networking 17 1 Explai
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 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109:
Page 112 and 113:
Solutions to Chapter 2 | Linked Lis
Page 114 and 115:
Page 116 and 117:
Page 118 and 119:
Approach 2: Solutions to Chapter 3
Page 120 and 121:
Solutions to Chapter 3 | Stacks and
Page 122 and 123:
Page 124 and 125:
Page 126 and 127:
Page 129 and 130:
Solutions to Chapter 4 | Trees and
Page 131 and 132:
Page 133 and 134:
Page 135 and 136:
Page 137 and 138:
Page 139 and 140:
Solutions to Chapter 5 | Bit Manipu
Page 141 and 142:
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: Solutions to Chapter 12 | Testing 1
Page 219 and 220: Solutions to Chapter 12 | Testing 1
Page 221 and 222: Solutions to Chapter 13 | C++ 13 1
Page 231 and 232: Solutions to Chapter 14 | Java 14 1
Page 237 and 238: Solutions to Chapter 15 | Databases
Page 243 and 244: Solutions to Chapter 16 | Low Level
Page 255 and 256: Solutions to Chapter 17 | Networkin
Page 263 and 264: Solutions to Chapter 18 | Threads a
Page 265 and 266: Solutions to Chapter 18 | Threads a
Page 267: Solutions to Chapter 18 | Threads a
Page 271 and 272: Solutions to Chapter 19 | Moderate
Page 285 and 286: Solutions to Chapter 20 | Hard 20 1
Page 295 and 296: Solutions to Chapter 20 | Hard 20 p
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?