Computer Science 2210A/B Lecture Notes - Lecture 3: Linked List, Information Hiding
3 Apr 2017
School
Department
Course
Professor
Document Summary
Abstract data types (adts) are user defined data types. A name or type, specifying a set of data (e. g. dictionary): 2. Descriptions of all the operations (or methods) that do things with that type (e. g. find, insert, remove) The descriptions indicate what the operations do, not how they do it. A data structure is a systematic way of organizing and accessing data from a computer (e. g. array, linked list). Error if there is no record with the given key. If data structure is useful for one application, it is probably useful for another. Therefore, we should design it to be as re-usable as possible. Preferred way of designing and implementing data structures. Uses 2 general principles: information hiding and re-usability. User data structure should not need to know details of its implementation. We should be able to change implementation without a ect-ing applications that use it.
