Politeknik Siber dan Sandi Negara

Knowledge Center of Cybersecurity and Cryptography

  • Home
  • Information
  • News
  • Help
  • Librarian
  • Member Area
  • Select Language :
    Arabic Bengali Brazilian Portuguese English Espanol German Indonesian Japanese Malay Persian Russian Thai Turkish Urdu

Search by :

ALL Author Subject ISBN/ISSN Advanced Search

Last search:

{{tmpObj[k].text}}
Image of Big Java early object
Bookmark Share

Text

Big Java early object

Horstmann, Cay S. - Personal Name;

Contents

Chapter 1. Introduction
1.1. Computer Programs
1.2. The Anatomy of a Computer
1.3. The Java Programming Language
1.4. Becoming Familiar with Your Programming Environment
1.5. Analyzing Your First Program
1.6. Errors
1.7. Problem Solving: Algorithm Design

Chapter 2. Introduction to Objects and Classes
2.1. Objects and Classes
2.2. Variables
2.3. Working with Objects
2.4. The API Documentation
2.5. Instance Variables and Encapsulation
2.6. Specifying the Public Interfaces of a Class
2.7. Providing the Class Implementation
2.8. Unit Testing
2.9. Object References
2.10. Graphical Applications

Chapter 3. Fundamental Data Types
3.1. Numbers
3.2. Arithmetics
3.3. I/O
3.4. Problem Solving: First Do it By Hand
3.5. Strings

Chapter 4. Decisions
4.1. The if Statement
4.2. Comparing Values
4.3. Multiple Alternatives
4.4. Nested Branches
4.5. Problem Solving: Flowcharts
4.6. Problem Solving: Selecting Test Cases
4.7. Boolean Variables and Operators
4.8. Application: Input Validation

Chapter 5.. Loops
5.1. The while Loop
5.2. Problem Solving: Hand-Tracing
5.3. The for Loop
5.4. The do Loop
5.5. Application: Processing Sentinel Values
5.6. Problem Solving: Storyboards
5.7. Common Loop Algorithms
5.8. Nested Loops
5.9. Application: Random Numbers and Simulations
5.10. Using a Debugger

Chapter 6. Arrays and Array Lists
6.1. Arrays
6.2. Array Lists
6.3. The Enhanced for Loop
6.4. Array Algorithms
6.5. Problem Solving: Adapting Algorithms
6.6. Problem Solving: Discovering Algorithms by Manipulating Physical Objects
6.7. Two-Dimensional Arrays
6.8. Regression Testing

Chapter 7. Designing Classes
7.1. Discovering Classes
7.2. Designing Good Methods
7.3. Preconditions and Postconditions
7.4. Problem Solving: Patterns for Objects Data
7.5. Static Variables and Methods
7.6. Packages
7.7. Unit Test Frameworks

Chapter 8. Interfaces and Polymorphism
8.1. Using Interfaces for Algorithm Reuse
8.2. Converting Between Class and Interface Types
8.3. Polymorphism
8.4. The Comparable Interface
8.5. Using Interfaces for Callbacks
8.6. Inner Classes
8.7. Mock Objects
8.8. Event Handling
8.9. Building Application with Buttons
8.10. Processing Timer Events
8.11. Mouse Events

Chapter 9. Inheritance
9.1. Inheritance Hierarchies
9.2. Implementing Subclasses
9.3. Overriding Methods
9.4. Object: the Cosmis Superclass

Chapter 10. I/O and Exception Handling
10.1. Reading and Writing Text Files
10.2. Text I/O
10.3. Command Line Arguments
10.4. Exception Handling
10.5. Application: Handling Input Errors

Chapter 11. Object-Oriented Design
11.1. Classes and Their Responsibilities
11.2. Relationship Between Classes
11.3. Application: Printing an Invoice

Chapter 12. Recursion
12.1. Triangle Numbers
12.2. Recursive Helper Methods
12.3. The Efficiency of Recursion
12.4. Permuttations
12.5. Mutual Recursion
12.6. Backtracking

Chapter 13. Sorting and Searching
13.1. Selection Sort
13.2. Profiling the Selection Sort Algorithm
13.3. Analyzing the Performance of the Selection Sort Algorithm
13.4. Merge Sort
13.5. Analyzing the Merge Sort Algorithm
13.6. Searching
13.7. Problem Solving: Estimating the Running Time of an Algorithm
13.8. Sorting and Searching in the Java Library

Chapter 14. The Java Collections Framework
14.1. An Overview of the Collections Framework
14.2. Linked Lists
14.3. Sets
14.4. Maps
14.5. Stacks, Queues, and Priority Queues
14.6. Stacks and Queue Applications

Chapter 15. Basic Data Structures
15.1. Implementing Linked Lists
15.2. Implementing Array Lists
15.3. Implementing Stacks and Queues
15.4. Implementing a Hash Table

Chapter 16. Tree Structures
16.1. Basic Tree Concepts
16.2. Binary Trees
16.3. Binary Search Trees
16.4. Tree Traversal
16.5. Red-Black Trees
16.6. Heaps
16.7. The Heapsort Algorithm

Chapter 17. Generic Classes
17.1. Generic Classes and Type Parameters
17.2. Implementing Generic Types
17.3. Generic Methods
17.4. Constraining Type Parameters
17.5. Type Erasure

Chapter 18. Graphical User Interfaces
18.1. Layout Management
18.2. Processing Text Input
18.3. Choices
18.4. Menus
18.5. Exploring the Swing Documentation

Chapter 19. Streams and Binary I/O
19.1. Readers, Writers, and Streams
19.2. Binary I/O
19.3. Random Access
19.4. Object Streams


Availability

No copy data

Detail Information
Series Title
-
Call Number
005 HOR b
Publisher
Singapore : John Wiley & Sons., 2014
Collation
xvi. 1020 hlm.; ilus.; 25 cm
Language
English
ISBN/ISSN
9781118318775
Classification
005
Content Type
-
Media Type
-
Carrier Type
-
Edition
Fifth Edition
Subject(s)
Komputer Sistem pengoperasian
Specific Detail Info
-
Statement of Responsibility
Cay S. Horstmann
Other version/related

No other version available

File Attachment
No Data
Comments

You must be logged in to post a comment

Politeknik Siber dan Sandi Negara
  • Information
  • Services
  • Librarian
  • Member Area

About Us

Perpustakaan Politeknik Siber dan Sandi Negara menyediakan berbagai macam koleksi seperti Buku, Jurnal, Majalah, Koran, Referensi dan Konten Lokal.

Search

start it by typing one or more keywords for title, author or subject

Keep SLiMS Alive Want to Contribute?

© 2025 — Senayan Developer Community

Powered by SLiMS
Select the topic you are interested in
  • Computer Science, Information & General Works
  • Philosophy & Psychology
  • Religion
  • Social Sciences
  • Language
  • Pure Science
  • Applied Sciences
  • Art & Recreation
  • Literature
  • History & Geography
Icons made by Freepik from www.flaticon.com
Advanced Search
Where do you want to share?