Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more ➡
Download
Standard view
Full view
of .
Add note
Save to My Library
Sync to mobile
Look up keyword or section
Like this
7Activity
×

Table Of Contents

1.1 What is a programming language?
1.2 What is a program?
1.3 What is debugging?
1.4 Formal and natural languages
1.5 The first program
1.6 Glossary
2.1 More printing
2.2 Variables
2.3 Assignment
2.4 Printing variables
2.5 Keywords
2.6 Operators
2.7 Order of operations
2.8 Operators for Strings
2.9 Composition
2.10 Glossary
3.1 Floating-point
3.2 Converting from double to int
3.3 Math methods
3.4 Composition
3.5 Adding new methods
3.6 Classes and methods
3.7 Programs with multiple methods
3.8 Parameters and arguments
3.9 Stack diagrams
3.10 Methods with multiple parameters
3.11 Methods with results
3.12 Glossary
4.1 The modulus operator
4.2 Conditional execution
4.3 Alternative execution
4.4 Chained conditionals
4.5 Nested conditionals
4.6 The return statement
4.7 Type conversion
4.8 Slates and Graphics objects
4.9 Invoking methods on a Graphics object
4.10 Coordinates
4.11 A lame Mickey Mouse
4.12 Other drawing commands
4.13 Recursion
4.14 Stack diagrams for recursive methods
4.15 Convention and divine law
4.16 Glossary
Fruitful methods
5.1 Return values
5.2 Program development
5.3 Composition
5.4 Overloading
5.5 Boolean expressions
5.6 Logical operators
5.7 Boolean methods
5.8 More recursion
5.9 Leap of faith
5.10 One more example
5.11 Glossary
Iteration
6.1 Multiple assignment
6.2 Iteration
6.3 The while statement
6.4 Tables
6.5 Two-dimensional tables
6.6 Encapsulation and generalization
6.7 Methods
6.8 More encapsulation
6.9 Local variables
6.10 More generalization
6.11 Glossary
Strings and things
7.1 Invoking methods on objects
7.2 Length
7.3 Traversal
7.4 Run-time errors
7.5 Reading documentation
7.6 The indexOf method
7.7 Looping and counting
7.8 Increment and decrement operators
7.9 Character arithmetic
7.10 Strings are immutable
7.11 Strings are incomparable
7.12 Glossary
Interesting objects
8.1 What’s interesting?
8.2 Packages
8.3 Point objects
8.4 Instance variables
8.5 Objects as parameters
8.6 Rectangles
8.7 Objects as return types
8.8 Objects are mutable
8.9 Aliasing
8.10 null
8.11 Garbage collection
8.12 Objects and primitives
8.13 Glossary
Create your own objects
9.1 Class definitions and object types
9.2 Time
9.3 Constructors
9.4 More constructors
9.5 Creating a new object
9.6 Printing an object
9.7 Operations on objects
9.8 Pure functions
9.15 Glossary
10.1 Accessing elements
10.2 Copying arrays
10.3 for loops
10.10 Many buckets
10.11 A single-pass solution
10.12 Glossary
Arrays of Objects
11.1 Composition
11.2 Card objects
11.3 The printCard method
11.4 The sameCard method
11.5 The compareCard method
11.6 Arrays of cards
11.7 The printDeck method
11.8 Searching
11.9 Decks and subdecks
11.10 Glossary
Objects of Arrays
12.1 Shuffling
12.2 Sorting
12.3 Subdecks
12.4 Shuffling and dealing
12.5 Mergesort
12.6 Glossary
13.1 Programming languages and styles
13.2 Object and class methods
13.3 The current object
13.4 Complex numbers
13.5 A function on Complex numbers
13.6 Another function on Complex numbers
13.7 A modifier
13.8 The toString method
13.9 The equals method
13.10 Invoking one object method from another
13.11 Oddities and errors
13.12 Inheritance
13.13 Drawable rectangles
13.14 The class hierarchy
13.15 Object-oriented design
13.16 Glossary
Linked lists
14.1 References in objects
14.2 The Node class
14.3 Lists as collections
14.4 Lists and recursion
14.5 Infinite lists
14.6 The fundamental ambiguity theorem
14.7 Object methods for nodes
14.8 Modifying lists
14.9 Wrappers and helpers
14.10 The LinkedList class
15.4 Wrapper classes
15.5 Creating wrapper objects
15.6 Creating more wrapper objects
15.7 Getting the values out
15.8 Useful methods in the wrapper classes
15.9 Postfix expressions
15.10 Parsing
15.11 Implementing ADTs
15.12 Array implementation of the Stack ADT
15.13 Resizing arrays
15.14 Glossary
Queues and Priority Queues
16.1 The queue ADT
16.2 Veneer
16.3 Linked Queue
16.4 Circular buffer
16.5 Priority queue
16.6 Abstract class
16.7 Array implementation of Priority Queue
16.8 A Priority Queue client
16.9 The Golfer class
16.10 Glossary
17.1 A tree node
17.2 Building trees
17.3 Traversing trees
17.4 Expression trees
17.5 Traversal
17.6 Encapsulation
17.7 Defining an abstract class
17.8 Implementing an abstract class
17.9 Array implementation of trees
17.10 The Vector class
17.11 The Iterator class
17.12 Glossary
18.1 The Heap
18.2 Performance analysis
18.3 Analysis of mergesort
18.4 Overhead
18.5 Priority Queue implementations
18.6 Definition of a Heap
18.7 Heap remove
18.8 Heap insert
18.9 Performance of heaps
18.10 Heapsort
18.11 Glossary
19.1 Arrays, Vectors and Tables
19.2 The Table ADT
19.3 The built-in Hashtable
19.4 A Vector implementation
19.5 The List abstract class
in the List abstract class
19.6 Hash table implementation
19.7 Hash Functions
19.8 Resizing a hash table
19.9 Performance of resizing
19.10 Glossary
Program development plan
Debugging
B.1 Compile-time errors
B.2 Run-time errors
B.3 Semantic errors
Input and Output in Java
The Slate Class
0 of .
Results for:
No results containing your search query
P. 1
java

java

Ratings: (0)|Views: 1,038|Likes:
Published by Gyu Bot
java
java

More info:

Published by: Gyu Bot on Jan 05, 2013
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See More
See less

04/06/2014

pdf

text

original

You're Reading a Free Preview
Pages 6 to 106 are not shown in this preview.
You're Reading a Free Preview
Pages 113 to 115 are not shown in this preview.
You're Reading a Free Preview
Pages 121 to 160 are not shown in this preview.
You're Reading a Free Preview
Pages 166 to 252 are not shown in this preview.

Activity (7)

You've already reviewed this. Edit your review.
1 thousand reads
1 hundred reads
Marcos Tomiyama liked this
Kumarecit liked this
Mariano T liked this
irukulapati liked this

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->