CPSC 319 Lecture Notes - Lecture 5: Cengage Learning, Linked List, Geoffrey Chaucer

• School: University of Calgary
• Department: Computer Science
• Course: CPSC 319
• Professor: Leonard Manzara

Document Summary

Each element of a list might consist of: a single data item, or, a record or object (compound data) A list is an abstract data type (adt) that supports these operations: add(newentry) Adds an item to the end of the list: insert(newentry, position) Inserts an item into a list at the specified position: delete(position) Deletes the item at the specified position: clear() Deletes all items from the list: getentry(position) Return the item at the specified position: may be done by value or by reference, replaceentry(position, newentry) Overwrite the item at the specified position with a new item: getlength() Returns the number of items currently in the list: isempty() Returns true if no items in the list, false otherwise: isfull() Returns true if the list is full, false otherwise: display() Prints out all items in the list: contains(itemkey) Returns true if the list contains the item, false otherwise: search(itemkey) Returns the item that matches the key (or nil if no match)