This unit focuses on data structures, which are used to represent collections of related data using a single variable rather than multiple variables. Using a data structure along with iterative statements with appropriate bounds will allow for similar treatment to be applied more easily to all values in the collection. Just as there are useful standard algorithms when dealing with primitive data, there are standard algorithms to use with data structures. In this unit, we apply standard algorithms to arrays; however, these same algorithms are used with ArrayLists and 2D arrays as well. Additional standard algorithms, such as standard searching and sorting algorithms, will be covered in the next unit.
ESSENTIAL QUESTIONS
Variables [VAR-1]
How can programs leverage volcano data to make predictions about the date of the next eruption?
Control [CON-1]
How can knowing standard algorithms be useful when solving new problems?
BIG IDEAS
+ Representing multiple related items as Array objects
+ Traversing an Array by accessing the elements using iteration statements
+ Standard algorithms that utilize Array traversals to perform functions
UNIT TOPICS & ACTIVITIES
6.1: Array Creation and Access
6.2: Traversing Arrays
6.3: Enhanced for Loop for Arrays
6.4: Developing Algorithms Using Arrays
SKILLS ADDRESSED
Program Design and Algorithm Development
1.B: Determine code that would be used to complete code segments.
1.C: Determine code that would be used to interact with completed program code.
Code Logic
2.B: Determine the result or output based on statement execution order in a code segment without method calls (other than output).
Code Implementation
3.D: Write program code to create, traverse, and manipulate elements in 1D array or ArrayList objects.
Code Testing
4.B: Identify errors in program code.
4.C: Determine if two or more code segments yield equivalent results.
Documentation
5.D: Describe the initial conditions that must be met for a program segment to work as intended or described.