VCE Software Development U3O1 Word Scramble: Object-oriented programming and Searching and sorting algorithms (Modules 142–155)
Name:
Date:
Class:
🔤
Word scramble
Unscramble the letters and write each key term on the line.
1
SLSCA APTRE(IDHNCL):
Inheritance: the child (sub) class reuses the parent (super) class's attributes and methods and can add or change its own, showing an is-a relationship.
2
EISTN().__PURI__()
Runs the parent class's __init__ first so it sets up inherited attributes, then the child's __init__ adds its own extra attributes.
3
RLANIE RCEAHS
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.
4
HIEWL OWL <= IHGH:
The binary search loop: while low <= high, check the middle item of a sorted list, then move low or high to halve the search range each time.
5
ENLETOCSI TROS
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.
6
ORIENCRUS
A function that calls itself with a smaller problem each time, and stops at a base case that returns without calling itself. With no base case, Python raises a RecursionError.
7
KCIUQ ORST
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.
8
CISAROURT(RAKQY)
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.
9
ORETDS() DNA .RSOT()
sorted(x) returns a new sorted 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.
Answer Key
VCE Software Development U3O1 · Modules 142–155
1SLSCA APTRE(IDHNCL): → class Child(Parent): — Inheritance: the child (sub) class reuses the parent (super) class's attributes and methods and can add or change its own, showing an is-a relationship.
2EISTN().__PURI__() → super().__init__() — Runs the parent class's __init__ first so it sets up inherited attributes, then the child's __init__ adds its own extra attributes.
3RLANIE RCEAHS → linear search — 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.
4HIEWL OWL <= IHGH: → while low <= high: — The binary search loop: while low <= high, check the middle item of a sorted list, then move low or high to halve the search range each time.
5ENLETOCSI TROS → selection sort — 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.
6ORIENCRUS → recursion — A function that calls itself with a smaller problem each time, and stops at a base case that returns without calling itself. With no base case, Python raises a RecursionError.
7KCIUQ ORST → quick sort — 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.
8CISAROURT(RAKQY) → quickSort(array) — 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.
9ORETDS() DNA .RSOT() → sorted() and .sort() — sorted(x) returns a new sorted 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.