CSC 143/Chapter 10: Difference between revisions
From charlesreid1
| Line 21: | Line 21: | ||
===Materials=== | ===Materials=== | ||
Introduce ArrayList object the way you would introduce the Python list | |||
* List: basic data type, very important | |||
* Difference between list and array - memory allocation and element insertion | |||
* Dynamic arrays | |||
Array notation | |||
* Wrapper class, everything is an object, treat primitive types as objects | |||
ArrayList | What kind of things would you want to do with an ArrayList? | ||
Basic basic operations: | |||
* Get size | |||
Other basic operations: | |||
* Get item at index i | |||
* Set item at index i | |||
* Add item, add item at index i | |||
* Remove item | |||
* Modify item at index i | |||
Now that we have defined these basic operations, we can move on to examples/algorithms/implementations. | |||
==Section 10.2: Comparable interface== | ==Section 10.2: Comparable interface== | ||
Revision as of 21:17, 9 September 2016
Chapter 10: ArrayLists
Sections:
10.1 ArrayLists
10.2 Comparable interface
10.3 Case study: Vocabulary comparison
Section 10.1: ArrayLists
Definitions
Definitions:
- Generic class
- Wrapper class
- Boxing
- Unboxing
Materials
Introduce ArrayList object the way you would introduce the Python list
- List: basic data type, very important
- Difference between list and array - memory allocation and element insertion
- Dynamic arrays
Array notation
- Wrapper class, everything is an object, treat primitive types as objects
What kind of things would you want to do with an ArrayList?
Basic basic operations:
- Get size
Other basic operations:
- Get item at index i
- Set item at index i
- Add item, add item at index i
- Remove item
- Modify item at index i
Now that we have defined these basic operations, we can move on to examples/algorithms/implementations.
Section 10.2: Comparable interface
Definitions
Definitions:
- Comparison function
- Natural ordering
Materials
Controversy over boxing and unboxing: ArrayList<Integer> vs ArrayList<int>
Sorting ArrayList
Natural ordering and compareTo
Comparing strings
Implementing the comparable interface
Utilizing comparable with sort
Section 10.3: Vocabulary comparison
Material
Some efficiency considerations
Version 1: compute vocabulary
- Add unique words to ArrayList, and sort
Version 2: compute overlap
- Number of matches between two sentences
Version 3: complete program
- so far, build vocab list for 2 files, compute overlap between them
- now, to deal with large files, print statistics (Nwords, Noverlapwords, Percent overlap)
Chapter 10 Summary
Deliverables
ArrayList
- Notation, how to use it
- Conceptualizing problems that can be easily resolved with ArrayList
- Adding/removing and looping over ArrayLists
- Wrapper classes
Comparable
- Natural ordering and compareTo() function
- Implementing the Comparable interface
Case study: Vocab comparison
- Count number of unique words
- Count overlap between two lists
- Compute statistics
Chapter 10 Goodies
Profiles
(?)
Puzzle 2
Flags
 |
CSC 143 - Intro to Programming II Computer Science 143 - Intro to Programming II, South Seattle College.
Chapter 8: Object Oriented Reivew CSC 143/Chapter 8 Chapter 9: Inheritance and Interfaces CSC 143/Chapter 9 Chapter 10: ArrayList CSC 143/Chapter 10 Chapter 11: Java Collections Framework CSC 143/Chapter 11 Chapter 12: Recursion CSC 143/Chapter 12 Chapter 13: Searching and Sorting CSC 143/Chapter 13 Chapter 14: Stacks and Queues CSC 143/Chapter 14 Chapter 16: Linked Lists CSC 143/Chapter 16
Category:Teaching · Category:CSC 143 · Category:CSC Related: CSC 142 Flags · Template:CSC143Flag · e |