Data Structures, Algorithms, and Applications in C

Sartaj Sahni

WCB/McGraw-Hill

Fundamentals Of Natural Computing: Basic Concepts, Algorithms, And Applications

NUNES DE CASTRO

T&F/INDIA

<p>Data structures, algorithms and applications in java (2nd edition) is the new version of the very popular first edition. It provides a comprehensive coverage of fundamental data structures, making it ideal for use in computer science courses. The author has made the book very user friendly by starting with a gentle introduction, providing intuitive discussions and including real-world applications. Real-world applications are a unique feature of this text. Dr sahni provides several applications for each data structure and algorithm design method discussed, taking examples from topics such as sorting, compression and coding and image processing. These applications motivate and interest students by connecting concepts with their use. Dr sahni does an excellent job of balancing theoretical and practical information, resulting in learned concepts and interested students. The market-developed pedagogy in this book reinforces concepts and gives students plenty of practice. There are almost 1</p>

Data Structures, Algorithms, and Applications in JAVA

Orient Blackswan

This new edition provides a comprehensive and technically rigorous introduction to data structures such as arrays, stacks, queues, linked lists, trees and graphs and techniques such as sorting hashing that form the basis of all software. In addition, this text presents advanced or specialized data structures such as priority queues, efficient binary search trees, multiway search trees and digital search structures. The book has been updated to include the latest features of the c++ language. Features such as exceptions and templates are now incorporated throughout the text along with limited exposure to stl. Treatment of queues, iterators and dynamic hashing has been improved. The book now discusses topics such as secure hashing algorithms, weightbiased leftist trees, pairing heaps, symmetric min-max heaps, interval heaps, top-down splay trees, b+ trees and suffix trees. Red-black trees have been made more accessible. The section on multiway tries has been significantly expanded and discusses several trie variations and their application to internet packet forwarding.

Fundamentals of Data Structures in C 2nd Edition

Susan Anderson-Freed

SARTAJ SAHNI & DINESH MEHTA ELLIS HOROWITZ

UNIVERSITIES PRESS

Computer Algorithms/C++ (Second Edition)

Ellis Horowitz

Sanguthevar Rajasekaran

Universities Press,India

<p>Brand NEW, Paperback International Edition. ISBN and Cover same with similar contents as US edition. Printed in Black &amp; White. End Chapter Exercises may differ. No CD/Access code. Legal to use despite any disclaimer. We also ship to PO Box addresses .Choose Expedited Shipping for FASTER DELIVERY Printed in English. We may ship the books from multiple warehouses across the globe, including India depending upon the availability of inventory storage. In case of orders from Europe, custom charges may comply by the relevant government authority and we are not liable for it.100% Customer satisfaction guaranteed! Please feel free to contact us for any queries. Customer Satisfaction Guaranteed.</p>

Fundamentals of Computer Algorithms

Sanguthever Rajasekaran

Universities Press (India) Private Limited

基礎資料結構

Dinesh P. Mehta

賀洛維

安德森佛里德

戴顯權

沙尼

蔡錫鈞 (資訊工程)

See the best price to sell, buy, or rent books by Sartaj Sahni. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Sartaj Sahni