Practice IB Computer Science (First Exam 2027) Topic B4.1 Fundamentals of Adts with authentic exam-style questions for both SL and HL students. This question bank focuses on the exact syllabus content for B4.1 Fundamentals of Adts and mirrors Paper 1, 2 style where relevant.
Get instant solutions, detailed explanations, and build confidence with questions aligned to IB examiner expectations.
A geocaching trail is held in a linked list using a Node class with attributes data and next. a function passed the head of the list and a new cache name, which creates a node holding that name, inserts it at the front, and returns the new head.
A cheese cave stores its shelf codes in a binary search tree.
…
A rare book's provenance chain stores the owners 1841, 1903 and 1967 in a singly linked list, in that order. this linked list, clearly indicating the head and the end of the list.
A luggage tag lookup sends two different tag codes to the same position in its hash table. what has occurred and one way of resolving it.
A funicular railway operator must choose a structure for 400 000 passenger records retrieved by ticket number, with records added and removed throughout the day.
(a) why a sorted array is unsuitable.
(b) why a hash table is preferable to a binary search tree here.
(c) one situation in which the binary search tree would be the better choice.
