CMPT 120 Study Guide - Final Guide: Binary Search Tree, List Of Data Structures, Data Structure

• School: Simon Fraser University
• Department: Computing Science
• Course: CMPT 120
• Professor: Steven Pearce

Document Summary

Could be defined by 3 operations: push (inserts data into structure), pop (extracts item from. Defines a class of abstract objects indirectly which is completely characterized by operations available on those objects. Study of adt is a functional view from perspective of user rather than details of storage it), peek (data examined without removal) Adt is more logical, thought of as a picture of the data and the operations to manipulate / change it. Data structure is more concrete, where it can be implemented and used within an algorithm (how) Based upon their implementation such as users are only interested in the returned value of stacks (restrictive versions of lists) and not the details of storage. Programming language primitive whose value refers directly to (points to) another value stored elsewhere in the computer memory using its address. Necessary for managing implementation / operation when building data structures such as lists.