CSCA48H3 Lecture Notes - Lecture 2: The Queue, Self-Service Laundry
15 Feb 2018
School
Department
Course
Professor
Document Summary
Csca48 - lecture 03 - final details on adt + queues (part 1) An abstract data type can be best classified as a form of data representation consisting of two primary elements. The actual data itself which is being contained. The operations that a user can perform on the data. The beauty about such a data type is that it follows the concept of abstraction. In other words, the user should be able to operate with the data type without needing to alter or understand the underlying implementation details. The first adt we will focus on will be the queue. A queue is an adt which essentially stores items by inserting each item to the end of the queue and keeps track of the order of their insertion. To extract an item, we will extract the oldest item (the item which was inserted first) and make our way until the newest item is reached.
