VCE Software Development U3O1 Crossword: Object-oriented programming and Searching and sorting algorithms (Modules 142–155)
Name:
Date:
Class:
✎
Crossword
Read each clue and write the matching term in the grid. Numbers in brackets show the letters in each word.
1
2
3
4
5
6
7
8
9
Across
- 2. Picks a pivot, splits the list into items smaller and larger than the pivot, then sorts each part the same way (recursion) until the parts are sorted. Word 1 of: _____ ____ (5)
- 3. A sorting algorithm that uses nested loops to find the smallest remaining item, then swaps it into place with a, b = b, a. It repeats for each position until the list is sorted. Word 2 of: _________ ____ (4)
- 4. Recursive step of quick sort: sorts the ______ and larger lists by calling itself, then joins them around the equal items. Base case len(items) <= 1 stops it. Word 4 of: return __________(_______) + equal + __________(larger) (7)
- 6. Word 1 of the term in 5 Down: _____ Child(______): (5)
- 8. An algorithm that uses a loop to check each item in a list in turn. It stops when it finds the target or reaches the end of the list, often returning the index or -1. Word 1 of: ______ search (6)
- 9. Runs the parent class's __________ first so it sets up inherited attributes, then the child's __________ adds its own extra attributes. Word 2 of: super().________() (4)
Down
- 1. A recursive function that picks a pivot, partitions the array into smaller and larger parts around it, then calls itself on each part until the array is sorted. Word 1 of: _________(array) (9)
- 4. Word 1 of the term in 3 Across: _________ ____ (9)
- 5. Inheritance: the child (sub) ______ reuses the ______ (super) ______'s attributes and methods and can add or change its own, showing an is-a relationship. Word 3 of: _____ Child(______): (6)
- 7. ______(x) returns a new ______ list and leaves x unchanged. x.sort() sorts the list x itself (in place) and returns None. Both accept reverse=True and key= to change the order. Word 1 of: ______() and .____() (6)
Answer Key
VCE Software Development U3O1 · Modules 142–155
1Q
2Q
U
I
C
K
I
C
K
3S
O
R
T
O
4S
M
A
L
L
E
R
E
T
L
E
5P
6C
L
A
S
7S
T
R
O
8L
I
N
E
A
R
O
N
T
9I
N
I
T
E
D
Across
2QUICK — Picks a pivot, splits the list into items smaller and larger than the pivot, then sorts each part the same way (recursion) until the parts are sorted. Word 1 of: _____ ____
3SORT — A sorting algorithm that uses nested loops to find the smallest remaining item, then swaps it into place with a, b = b, a. It repeats for each position until the list is sorted. Word 2 of: _________ ____
4SMALLER — Recursive step of quick sort: sorts the ______ and larger lists by calling itself, then joins them around the equal items. Base case len(items) <= 1 stops it. Word 4 of: return __________(_______) + equal + __________(larger)
6CLASS — Word 1 of the term in 5 Down: _____ Child(______):
8LINEAR — An algorithm that uses a loop to check each item in a list in turn. It stops when it finds the target or reaches the end of the list, often returning the index or -1. Word 1 of: ______ search
9INIT — Runs the parent class's __________ first so it sets up inherited attributes, then the child's __________ adds its own extra attributes. Word 2 of: super().________()
Down
1QUICKSORT — A recursive function that picks a pivot, partitions the array into smaller and larger parts around it, then calls itself on each part until the array is sorted. Word 1 of: _________(array)
4SELECTION — Word 1 of the term in 3 Across: _________ ____
5PARENT — Inheritance: the child (sub) ______ reuses the ______ (super) ______'s attributes and methods and can add or change its own, showing an is-a relationship. Word 3 of: _____ Child(______):
7SORTED — ______(x) returns a new ______ list and leaves x unchanged. x.sort() sorts the list x itself (in place) and returns None. Both accept reverse=True and key= to change the order. Word 1 of: ______() and .____()