A conveyor belt buffer holds part numbers in a 1D list, where the front of the buffer is at index 0. two functions. The function add_part is passed the list and a part number and adds it to the back. The function take_part is passed the list, removes the part at the front and returns it, or returns None if the buffer is empty.
A school canteen returns trays to a rack implemented as a fixed array of 12 positions with two indices, front and back. Trays are added at back and taken from front, and neither index is ever decreased. After 12 trays have been added and 12 taken, the rack is empty but no further tray can be added.
A theatre box office uses a stack supporting push, pop, peek and isEmpty, where push inserts on the top, pop removes the top element, peek returns the top element without removing it, and isEmpty reports whether the stack holds no elements.
A polling station records, for each ballot box, the number of votes counted in each hour, in the 2D list counted. Rows are ballot boxes and columns are hours, and all rows have the same length.
Practice IB Computer Science (First Exam 2027) Topic B2.2 Data Structures with authentic exam-style questions for both SL and HL students. This question bank focuses on the exact syllabus content for B2.2 Data Structures and mirrors Paper 1, 2 style where relevant.
Get instant solutions, detailed explanations, and build confidence with questions aligned to IB examiner expectations.
one new difficulty that wrapping introduces.
how the function would need to change if the boxes had been counted for different numbers of hours, so rows had different lengths.
