Take quiz & check grades
Introduction
What you should know:
 | Chapter 3 - Summations |
| Chapter 5 - Sets, graphs and trees |
| Chapter 11 - Data Structures: stacks, queues, linked lists, pointers, etc. |
Abstract Data Types
What is an ADT? (there are different interpretations)
Abstract Data Type as a Mathematical entity
Abstract Data Type implementation in a computer
Another example: files
| a structure of data inaccessible to the user except through a predefined set of functions |
| interface and implementation |
| implementation in C |
Keep in mind that
| ADT's are implemented for others to use |
| Well done ADT's do not have to be changed often to adapt to new situations |
| Avoid interacting with user (through messages) whenever possible |
| A good implementation of an ADT will be reused many times in many different applications |