Data Structures
and
Algorithms
Made Easy
Narasimha Karumanchi, M.Tech, IIT Bombay
Founder, CareerMonk.comData Structures and Algorithms Made Easy
Narasimha Karumanchi is the founder of CareerMonk and author of few books
on data structures, algorithms, and design patterns. He was a software developer
who has been both interviewer and interviewee over his long career. Most recently
he worked for Amazon Corporation, IBM labs, Mentor Graphics, and Microsoft.
He filed patents which are under processing. He authored the following books
which got translated to international languages: Chinese, Japanese, Korea and
Taiwan. Also, around 58 international universities were using these books as
reference for academic courses.
 IT Interview Questions
 Data Structures and Algorithms Made Easy in Java
 DataStructures and Algorithms for GATE
 Peeling Design Patterns
 Coding Interview Questions
 Elements of Computer Networking
 Data Structure and Algorithmic Thinking with Python
Narasimha held M.Tech. in computer science from IIT, Bombay, after finishing his B.Tech. from
JNT university. He has also taught data structures and algorithms at various training institutes
and colleges.
NarasimhaKarumanchi
CareerMonk Publications
CareerMonk Publications
Salient Features Of Book
All code written in C
Enumeration of possible solutions for each problem
Covers interview questions on data structures and algorithms
Useful for Big Job Hunters: Microsoft, Google, Amazon, Yahoo,
Oracle, Facebook & many more
All the concepts are discussed in a lucid, easy to understand
manner
A reader without any basic knowledge in computers can comfortably follow this book.
Helps to build logic in the students which becomes stepping stone for understanding
computer networking protocols
Interview questions collected from the actual interviews of various Software companies (and
past compititive examinations like GATE) will help the students to be successful in their
campus interviews
Hundreds of solved problems help the students of various universities do well in their
examinations like B.C.A, B.Sc, M.Sc, M.C.A, B.E, B.Tech, M.Tech, etc.
Works like a handy reference to the Software professionals
Smart
Solutions
Data Structure and Algorithmic Puzzles

Data structures and algorithms made easy cover

  • 1.
    Data Structures and Algorithms Made Easy NarasimhaKarumanchi, M.Tech, IIT Bombay Founder, CareerMonk.comData Structures and Algorithms Made Easy Narasimha Karumanchi is the founder of CareerMonk and author of few books on data structures, algorithms, and design patterns. He was a software developer who has been both interviewer and interviewee over his long career. Most recently he worked for Amazon Corporation, IBM labs, Mentor Graphics, and Microsoft. He filed patents which are under processing. He authored the following books which got translated to international languages: Chinese, Japanese, Korea and Taiwan. Also, around 58 international universities were using these books as reference for academic courses.  IT Interview Questions  Data Structures and Algorithms Made Easy in Java  DataStructures and Algorithms for GATE  Peeling Design Patterns  Coding Interview Questions  Elements of Computer Networking  Data Structure and Algorithmic Thinking with Python Narasimha held M.Tech. in computer science from IIT, Bombay, after finishing his B.Tech. from JNT university. He has also taught data structures and algorithms at various training institutes and colleges. NarasimhaKarumanchi CareerMonk Publications CareerMonk Publications Salient Features Of Book All code written in C Enumeration of possible solutions for each problem Covers interview questions on data structures and algorithms Useful for Big Job Hunters: Microsoft, Google, Amazon, Yahoo, Oracle, Facebook & many more All the concepts are discussed in a lucid, easy to understand manner A reader without any basic knowledge in computers can comfortably follow this book. Helps to build logic in the students which becomes stepping stone for understanding computer networking protocols Interview questions collected from the actual interviews of various Software companies (and past compititive examinations like GATE) will help the students to be successful in their campus interviews Hundreds of solved problems help the students of various universities do well in their examinations like B.C.A, B.Sc, M.Sc, M.C.A, B.E, B.Tech, M.Tech, etc. Works like a handy reference to the Software professionals Smart Solutions Data Structure and Algorithmic Puzzles