Data Structures, Algorithms and Applications in java, 2/e, Sartaj Sahni, University Press Free Download
Data Structures, Algorithms and Applications in java, 2/e, Sartaj Sahni, University Press Free Download
INFO:-
![AdF.ly - shorten links and earn money!](https://cdn.adf.ly/images/banners/adfly.300x250.1.gif)
Publisher | :: | Universities Press | |
By | :: | Sartaj Sahni | |
ISBN | :: | 978-81-7371-523-5 | |
Page | :: | 1321 | |
Language | :: | English | |
Year | :: | 2005 | |
File Format | :: |
INFO:-
![AdF.ly - shorten links and earn money!](https://cdn.adf.ly/images/banners/adfly.300x250.1.gif)
Summary Of The Book
Data Structures, Algorithms And Applications in C++ contains a
comprehensive overview of the subject of data structures and algorithms
using the C++ programming language. In the beginning of this book, the
author tells the readers that they must have a sound understanding of
C++ before they attempt to learn data structures and methods for
designing algorithms. The first four chapters of this book are intended
to provide the readers with a revision of important skills needed for
digging deeper into this subject. Some of these concepts include
recursion, exception handling, function overloading, testing, debugging,
asymptotic notation, time complexity, and practical complexities.
This book is divided into three parts, Preliminaries, Data Structures,
and Algorithm-Design Methods. There are 24 chapters in total, and some
of them include Balanced Search Trees, Graphs, Dynamic Programming, The
Greedy Method, Branch and Bound (On The Web), Skip Lists and Hashing,
Linear Lists-Array Representation, Binary and Other Trees, Performance
Analysis, Performance Measurement, Arrays and Matrices, and Stacks.
The author provides the readers with numerous examples, which help them
understand concepts better. Additionally, exercises have also been
provided at the end of the chapter to test the understanding of the
reader effectively. Some of the crucial concepts covered include
Kruskal’s algorithm, polynomial evaluation, Fibonacci numbers, and
binary search.
About Sartaj Sahni
Sartaj Sahni is an author and educator.
Apart from this book, Sahni has written Software Development In Pascal,
Data Structures, Algorithms, And Applications In Java, and Concepts In
Discrete Mathematics.
Sahni completed his B.Tech in Electrical Engineering from the Indian
Institute of Technology, Kanpur. After that, he finished his Master’s
and doctoral degrees in Computer Science from Cornell University. His
main areas of research interest lie in optimization, image processing,
network algorithms, medical applications, scheduling, and VLSI CAD. He
currently serves as the Distinguished Professor, CISE Department at the
University of Florida. Till date, Sahni has mentored 45 doctoral degree
students. He is also the Chairman of the Computer Science Curriculum at
National Technological University, Colorado. Sahni has also been
presented the Distinguished Alumnus Award by IIT-Kanpur, and Outstanding
Professor Award from the Institute of Technology Student Board of the
University of Minnesota, to name a few. Sahni has also written numerous
articles for research journals.
Don't forget to say thank's if you like the post.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment