Data Structures Using, First Edition (20 results)

Condition: Good. First Edition. Used book that is in clean, average condition without any missing pages.

Condition: Fine. First Edition. Used book that is in almost brand-new condition.

paperback. Condition: Good. 1st Edition. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing and/or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).

Hard Cover, Glossy Bds. Condition: FINE, First Edition.

Hardcover. Condition: Very Good. No Jacket. 1st Edition. Clean unmarked. NO WRITING NOR HIGHLIGHTING. NOT a former library book.

Condition: Very Good. 1st Edition. Ships from the UK. Used book that is in excellent condition. May show signs of wear or have minor defects.

Hardcover. Condition: As New. No Jacket. First Edition. The covers look great. The binding is tight. The interior pages are clean and unmarked. Electronic delivery tracking will be issued free of charge.

Hardcover. Condition: Very Good. No Jacket. First Edition. The former owner's name is printed on the front edge of the text block, otherwise, Like New condition. The covers look great. The binding is tight. The interior pages are clean and unmarked. Small scuff on the front flyleaf. Electronic delivery tracking will be issued free of charge.

paperback. Condition: Good. 1st Edition. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).

Hardcover. Condition: Good. First Edition. It's a preowned item in good condition and includes all the pages. It may have some general signs of wear and tear, such as markings, highlighting, slight damage to the cover, minimal wear to the binding, etc., but they will not affect the overall reading experience.

Condition: New. 2023. 1st ed. paperback. . . . . .

Soft cover. Condition: As New. 1st Edition. As new copy. A tight, bright, and clean copy with no inscriptions and no annotations/notes. No creasing to spine/cover or foxing to pages. Fantastic condition book. 588pp. (19x23.5cm). Please contact us for any more information.

Condition: New. Data Structures & Theory of Computation Num Pages: 580 pages, black & white illustrations. BIC Classification: UMW. Category: (P) Professional & Vocational. Dimension: 229 x 185 x 30. Weight in Grams: 971. . 2008. 1st Edition. Paperback. . . . .

Condition: New. 2005. 1st Edition. Paperback. This book combines a strong emphasis on problem solving and software design with the study of data structures. After providing the specification and implementation of an abstract data type, the authors cover case studies that use the data structure to solve a significant problem. Num Pages: 832 pages, Illustrations. BIC Classification: UMX. Category: (P) Professional & Vocational. Dimension: 232 x 193 x 28. Weight in Grams: 1176. . . . . .

Paperback. Condition: new. Paperback. 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. 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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Paperback. Condition: new. Paperback. 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. 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Paperback. Condition: new. Paperback. 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. 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. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Hardcover. Condition: new. Hardcover. 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. The first comprehensive tutorial and reference for C# implementation of data structures and algorithms found in the .NET Framework library, in addition to those developed by the programmer. Coverage includes arrays and array lists, linked lists, hash tables, dictionaries, trees, graphs, sorting and searching algorithms, probabilistic algorithms and dynamic programming. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Hardcover. Condition: new. Hardcover. 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. The first comprehensive tutorial and reference for C# implementation of data structures and algorithms found in the .NET Framework library, in addition to those developed by the programmer. Coverage includes arrays and array lists, linked lists, hash tables, dictionaries, trees, graphs, sorting and searching algorithms, probabilistic algorithms and dynamic programming. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Hardcover. Condition: new. Hardcover. 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. The first comprehensive tutorial and reference for C# implementation of data structures and algorithms found in the .NET Framework library, in addition to those developed by the programmer. Coverage includes arrays and array lists, linked lists, hash tables, dictionaries, trees, graphs, sorting and searching algorithms, probabilistic algorithms and dynamic programming. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.