|Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms 3rd Edition - bundle of paperback books
Название: Data Structures, Algorithms & Applications in Java - ISE
ISBN: 0071169008 ISBN-13(EAN): 9780071169004
Цена: 2604 р.
Наличие на складе: Нет в наличии.
Описание: Sahni's "Data Structures, Algorithms, and Applications in Java" is designed to be used in a second course in computer science (CS2). Using Java, this book
provides comprehensive coverage of the fundamental data structures, making it an excellent choice for a CS2 course. The author has made this book student-friendly through intuitive
discussion, real-world, applications and a gentle introduction.
Sahni is unique in providing several real-world applications for each data structure presented in the book. These
applications come from such areas as sorting, compression and coding, and image processing. These applications give students a flavor for the sorts of things they will be able to do
with the data structures that they are learning.
Almost 1,000 exercises in this text serve to reinforce concepts and get students applying what they are learning. Sahni's text is
also accompanied by a web site containing all the programs in the book, as well as sample data, generated output, solutions to selected exercises, and enhanced discussion of
selected material in the text.
в Мои желания
Автор: Mcmillan, Michael
Название: Data structures and algorithms using c#
ISBN: 0521670152 ISBN-13(EAN): 9780521670159
Издательство: Cambridge Academ
Цена: 3067 р.
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: C# programmers: no more translating data structures from C++ or Java to use in your programs! Mike McMillan provides a tutorial on how to use data structures and algorithms plus the first comprehensive reference for C# implementation of data structures and algorithms found in the .NET Framework library, as well as those developed by the programmer. The approach is very practical, using timing tests rather than Big O notation to analyze the efficiency of an approach. Coverage includes arrays and array lists, linked lists, hash tables, dictionaries, trees, graphs, and sorting and searching algorithms, as well as more advanced algorithms such as probabilistic algorithms and dynamic programming. This is the perfect resource for C# professionals and students alike.
в Мои желания