๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Data Structures in Java

โœ Scribed by Oswald Campesato


Publisher
Mercury Learning and Information
Tongue
English
Leaves
232
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


This book is a fast-paced introduction to using data structures with Java. Numerous code samples and listings are included to support myriad topics. The first chapter contains a quick introduction to Java, along with Java code samples to check for leap years, find divisors of a number, and work with arrays of strings. The second chapter introduces recursion and usescode samples to check if a positive number is prime, to find the prime divisors of a positive integer, to calculate the GCD (greatest common divisor) and LCM (lowest common multiple) of a pair of positive integers. The third chapter contains Java code samples involving strings and arrays, such as finding binary substrings of a number, checking if strings contain unique characters, counting bits in a range of numbers, and how to compute XOR without using the XOR function. Chapters 4 through 6 include Java code samples involving search algorithms, concepts in linked lists, and tasks involving linked lists. Finally, Chapter 7 discusses data structures called queues and stacks, along with additional Java code samples.

FEATURES:

  • Extensive topics, code samples, and scripts related to data structures
  • Covers strings, arrays, queues, and stacks, linked lists, computing the XOR function, checking for unique characters, and more
  • Includes companion files with code samples from the book (available for downloading from the publisher)


๐Ÿ“œ SIMILAR VOLUMES


Data Structures in Java
โœ Thomas A. Standish ๐Ÿ“‚ Library ๐Ÿ“… 1998 ๐Ÿ› Addison-Wesley ๐ŸŒ English

<span>Using Java(TM) 1.1, Professor Thomas A. Standish teaches the fundamentals of data structures and algorithms. With this exciting new language, Standish takes a fresh look at the subject matter. New challenges arise any time a new language is used, and the author meets these challenges. For exam

Data Structures in Java
โœ Oswald Campesato ๐Ÿ“‚ Library ๐Ÿ“… 2023 ๐Ÿ› Mercury Learning and Information ๐ŸŒ English

This book is a fast-paced introduction to using data structures with Java. Numerous code samples and listings are included to support myriad topics. The first chapter contains a quick introduction to Java, along with Java code samples to check for leap years, find divisors of a number, and work with

Data Structures in Java
โœ Oswald Campesato ๐Ÿ“‚ Library ๐Ÿ“… 2023 ๐Ÿ› Mercury Learning and Information ๐ŸŒ English

This book is a fast-paced introduction to using data structures with Java. Numerous code samples and listings are included to support myriad topics. The first chapter contains a quick introduction to Java, along with Java code samples to check for leap years, find divisors of a number, and work with

Data Structures & Algorithms in Java
โœ Mitchell Waite, Robert Lafore ๐Ÿ“‚ Library ๐Ÿ“… 1998 ๐Ÿ› Waite Group Press ๐ŸŒ English

Not filled with with obtuse mathematics and difficult proofs, MWSS:Data Structures and Algorithms in Java removes the mystique from DS&A. It does this in two ways. First, the text is written in a straightforward style, making it accessible to anyone. Second, unique new Java demonstration programs,

Data structures & algorithms in Java
โœ Mitchell Waite, Robert Lafore ๐Ÿ“‚ Library ๐Ÿ“… 1998 ๐Ÿ› Waite Group Press ๐ŸŒ English

Not filled with with obtuse mathematics and difficult proofs, MWSS:Data Structures and Algorithms in Java removes the mystique from DS&A. It does this in two ways. First, the text is written in a straightforward style, making it accessible to anyone. Second, unique new Java demonstration programs,

Data Structures & Algorithms in Java
โœ Mitchell Waite, Robert Lafore ๐Ÿ“‚ Library ๐Ÿ“… 1998 ๐Ÿ› Waite Group Press ๐ŸŒ English

Book was in great condition..but unfortunately it did not come with the accompanying cd ! It's virtually impossible to simulate all these algorithms without the applets(on the cd!).