國立高雄大學圖資館 |

Language: English

Back

Data structures in Java

Record Type:	Electronic resources : Monograph/item
Title/Author:	Data structures in JavaOswald Campesato.
Author:	Campesato, Oswald.
Published:	Dulles, VA :Mercury Learning and Information,c2023.
Description:	1 online resource (232 p.)
Subject:	Data structures (Computer science)
Online resource:	https://www.degruyterbrill.com/isbn/9781683929543
ISBN:	9781683929543$q(electronic bk.)

Data structures in Java
Campesato, Oswald.

Data structures in Java[electronic resource] /Oswald Campesato. - 1st ed. - Dulles, VA :Mercury Learning and Information,c2023. - 1 online resource (232 p.)

Includes bibliographical references and index.

Chapter 1: Introduction to Java -- Chapter 2: Recursion and Combinatorics -- Chapter 3: Strings and Arrays -- Chapter 4: Search and Sort Algorithms -- Chapter 5: Linked Lists (1) -- Chapter 6: Linked Lists (2) -- Chapter 7: Queues and Stacks.

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 uses code 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)

Mode of access: Internet via World Wide Web.

In English.

ISBN: 9781683929543$q(electronic bk.)

Standard No.: 10.1515/9781683929543doiSubjects--Topical Terms:

183917
Data structures (Computer science)

LC Class. No.: QA76.9.D35 / .C367 2023

Dewey Class. No.: 005.73

Data structures in Java
LDR:02774cmm a2200337 a 4500 001 682365
003 DE-B1597
005 20251017072503.0
006 m o d
007 cr cnu---unuuu
008 251202s2023 vau ob 001 0 eng d
020 $a 9781683929543$q(electronic bk.)
020 $a 9781683929536$q(electronic bk. ;$qEPUB)
020 $z 9781683929550
024 7 $a 10.1515/9781683929543 $2 doi
035 $a 9781683929543
040 $a DE-B1597 $b eng $c DE-B1597
041 0 $a eng
050 4 $a QA76.9.D35 $b .C367 2023
082 0 4 $a 005.73 $2 23
100 1 $a Campesato, Oswald. $3 986328
245 1 0 $a Data structures in Java $h [electronic resource] / $c Oswald Campesato.
250 $a 1st ed.
260 $a Dulles, VA : $b Mercury Learning and Information, $c c2023.
300 $a 1 online resource (232 p.)
504 $a Includes bibliographical references and index.
505 0 $a Chapter 1: Introduction to Java -- Chapter 2: Recursion and Combinatorics -- Chapter 3: Strings and Arrays -- Chapter 4: Search and Sort Algorithms -- Chapter 5: Linked Lists (1) -- Chapter 6: Linked Lists (2) -- Chapter 7: Queues and Stacks.
520 $a 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 uses code 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)
530 $a Issued also in print.
538 $a Mode of access: Internet via World Wide Web.
546 $a In English.
588 $a Description based on online resource; title from PDF title page (publisher's Web site, viewed September 18 2025)
650 0 $a Data structures (Computer science) $3 183917
650 0 $a Java (Computer program language) $3 189341
856 4 0 $u https://www.degruyterbrill.com/isbn/9781683929543