In this post, we present common software bugs for the list data structure. The post is aligned with the Black Box Software Testing Foundations course (BBST) designed by Rebecca Fiedler, Cem Kaner, and James Bach.
The list could be a collection of elements of the same type (same size) like arrays, or different types (size). In the latter case, we do not access the list element using element number because elements are connected with memory pointers. So in lists, we could search for an element using its value. To insert an element at the end of the list, we need first to go through all element lists, and that is not efficient. A better option is to add an element at the beginning of a list.
- Search forward when a relevant element is behind the current place.
- Read/write the past end of the list
- incorrect pointer update to the next/previous element.
Note that standard errors are possible only if you implement common list methods by yourself.