Starting repository for Data Structures COMP20280 2025-2026

Q6: A singly linked list is virtually identical to a circularly linked list, however a singly linked list has a tail (last value) that points to null while a circularly linked list's tail points to its head (first value). As such, a circularly linked list doesn't really have a first and last value, merely a pointer that grants entry into the circular path.

Q7: You would want to use a singly linked list rather than an array when the dimensions of the data structure may need to change. An array has a fixed size, which may add complexity in amending it.

Q8: Case 1: If there are limited options, for instance in the interface for Cher's closet in Clueless, and you want to cycle through them you could optimally use a circularly linked list. A finite list of skirts doesn't naturally have a stopping point, and you can therefore simply transverse the loop. Case 2: On a loading screen, a circularly linked list would be useful. Specifically, you could use one to display a repeating pattern of ., .., and ... while the website loads.