- Cover Page
- Title Page
- Copyright Page
- Dedication
- Contents
- Preface
- 1 Getting Organized
- 2 The Stack ADT
- 3 Recursion
- 4 The Queue ADT
- 4.1 The Queue
- 4.2 The Queue Interface
- 4.3 Array-Based Queue Implementations
- 4.4 An Interactive Test Driver
- 4.5 Link-Based Queue Implementations
- 4.6 Application: Palindromes
- 4.7 Queue Variations
- 4.8 Application: Average Waiting Time
- 4.9 Concurrency, Interference, and Synchronization
- Summary
- Exercises
- 5 The Collection ADT
- 6 The List ADT
- 7 The Binary Search Tree ADT
- 7.1 Trees
- 7.2 Binary Search Trees
- 7.3 The Binary Search Tree Interface
- 7.4 The Implementation Level: Basics
- 7.5 Iterative Versus Recursive Method Implementations
- 7.6 The Implementation Level: Remaining Observers
- 7.7 The Implementation Level: Transformers
- 7.8 Binary Search Tree Performance
- 7.9 Application: Word Frequency Counter
- 7.10 Tree Variations
- Summary
- Exercises
- 8 The Map ADT
- 9 The Priority Queue ADT
- 10 The Graph ADT
- 11 Sorting and Searching Algorithms
- Appendix A: Java Reserved Words
- Appendix B: Operator Precedence
- Appendix C: Primitive Data Types
- Appendix D: ASCII Subset of Unicode
- Glossary
- Index
Appendix C: Primitive Data Types
| Type | Value Stored | Default Value | Size | Range of Values |
|---|---|---|---|---|
char |
Unicode character | Character code 0 |
16 bits | 0 to 65535 |
byte |
Integer value | 0 |
8 bits | –128 to 127 |
short |
Integer value | 0 |
16 bits | –32768 to 32767 |
int |
Integer value | 0 |
32 bits | –2147483648 to –147483647 |
long |
Integer value | 0 |
64 bits | –9223372036854775808 to 9223372036854775807 |
float |
Real value | 0.0 |
32 bits | ±1.4E-45 to ±3.4028235E+38 |
double |
Real value | 0.0 |
64 bits | ±4.9E-324 to ±1.7976931348623157E+308 |
boolean |
true or false |
false |
1 bit | NA |
-
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.