Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
8Activity
0 of .
Results for:
No results containing your search query
P. 1
Coding Interview Questions

Coding Interview Questions

Ratings: (0)|Views: 838|Likes:
"Coding Interview Questions" is a book that presents design patterns in simple and straightforward manner with a clear-cut explanation. This book will provide an introduction to the basics. It comes handy as an interview and exam guide for computer scientists.
Programming puzzles for interviews
Campus Preparation
Degree/Masters Course Preparation
Big job hunters: Microsoft, Google, Amazon, Yahoo, Flip Kart, Adobe, IBM Labs, Citrix, Mentor Graphics, NetApp, Oracle, Webaroo, De-Shaw, Success Factors, Face book, McAfee and many more
Reference Manual for working people
Topics Covered:
Programming Basics
Introduction
Recursion and Backtracking
Linked Lists
Stacks
Queues
Trees
Priority Queue and Heaps
Graph Algorithms
Sorting
Searching
Selection Algorithms [Medians]
Symbol Tables
Hashing
String Algorithms
Algorithms Design Techniques
Greedy Algorithms
Divide and Conquer Algorithms
Dynamic Programming
Complexity Classes
Design Interview Questions
Operating System Concepts
Computer Networking Basics
Database Concepts
Brain Teasers
NonTechnical Help
Miscellaneous Concepts
"Coding Interview Questions" is a book that presents design patterns in simple and straightforward manner with a clear-cut explanation. This book will provide an introduction to the basics. It comes handy as an interview and exam guide for computer scientists.
Programming puzzles for interviews
Campus Preparation
Degree/Masters Course Preparation
Big job hunters: Microsoft, Google, Amazon, Yahoo, Flip Kart, Adobe, IBM Labs, Citrix, Mentor Graphics, NetApp, Oracle, Webaroo, De-Shaw, Success Factors, Face book, McAfee and many more
Reference Manual for working people
Topics Covered:
Programming Basics
Introduction
Recursion and Backtracking
Linked Lists
Stacks
Queues
Trees
Priority Queue and Heaps
Graph Algorithms
Sorting
Searching
Selection Algorithms [Medians]
Symbol Tables
Hashing
String Algorithms
Algorithms Design Techniques
Greedy Algorithms
Divide and Conquer Algorithms
Dynamic Programming
Complexity Classes
Design Interview Questions
Operating System Concepts
Computer Networking Basics
Database Concepts
Brain Teasers
NonTechnical Help
Miscellaneous Concepts

More info:

Published by: CareerMonk Publications on Sep 11, 2012
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

07/16/2014

pdf

text

original

 
 
To All Hard Working Job Hunters
 
 
 
Copyright
©

by

 All rights reserved.Designed by
 
 
Copyright
©
2012 Career Monk Publications. All rights reserved.All rights reserved. No part of this book may be reproduced in any form or by any electronic or mechanicalmeans, including information storage and retrieval systems, without written permission from the publisher or author 
 
 
Acknowledgements
I would like to express my gratitude to many people who saw me through this book, to all those who providedsupport, talked things over, read, wrote, offered comments, allowed me to quote their remarks and assisted inthe editing, proofreading and design. In particular, I would like to thank the following individuals.
 
[
  
], for his encouragement during my stay at
 
.
  
[

],
 
 

 

[
 
,

] for spending their valuable time in reviewing the book, suggestions and encouragement.

&

[Founders of 

], for approaching me for teaching

 

 

 
 
at their training centers.

 
 
,

and

have contributed greatly to the quality of this book. I thank all of 

 for your help and suggestions.Last but not least, I would like to thank

of 

 

 

,

 

 

&

 

[
   
],

[

 

of 
 
],
 
 

 

[

 

,

],

 

 [

],

 

[

,

] &

 

 

for helping me andmy family during our studies.
-

 

 MM--TTeecchh,, 

 

 FFoouunnddeeoo 

 

Activity (8)

You've already reviewed this. Edit your review.
1 thousand reads
1 hundred reads
Arun Kumar liked this
maskply liked this
expertvn liked this
Nithin Kumar liked this

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->