Data Structures and Algorithms is an important subject in any university curriculum for computer science stream. It provides a great tool in the hands of software engineers and plays significant role in software design and development. It is also becoming a must have skill for many competitions and job interviews in software industry.
This book covers the topics useful for students and also for software developers working in industry. The concepts are explained in step-wise manner and illustrated with numerous figures, text, examples and immediate code samples which helps in better understanding of data structures and algorithms with their implementation. There are exercises at the end of the chapters which helps students to explore more and build better foundation of subject. The book has more than 500 illustrations, code samples and problems. Solutions for exercises are also available with programs. Students can use it for self-learning and developers can use this for providing efficient solutions for their day-to-day development problems.
After completion of this book, students will have good understanding of Data Structures and Algorithms concepts and implementation. Software engineers will be able to provide better solutions with appropriate data structures and efficient algorithms.
What you will learn
● Fundaments of data structures and algorithms.
● Algorithms analysis.
● Variety of data structures and algorithms useful for software design and development.
● How to efficiently use different data structures and algorithms.
● When and where to use appropriate data structures and algorithms.
● Data structures and algorithms concepts with implementation.
● Approach to solve problems using right data structures and algorithms.
Who this book is for
Students who want to self-study data structures and algorithms for their university curriculum subject and to enter software industry. It is also useful for software engineers who want to learn it to solve day to day problems with better software design and writing efficient code.
Table of Contents
1. Introduction
2. Arrays
3. Linked Lists
4. Stacks and Queues
5. Recursion
6. Trees
7. Graphs
8. Sorting
9. Searching and Hashing
10. Storage Management
Solutions
