CMPT 120 Study Guide - Final Guide: Hash Table, Linked Data, Semicolon

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

Document Summary

Method of representing logical relationships between individual data elements related to solution of a given problem. It"s the most convenient way to handle data of different types. Based all of computer"s ability to fetch and store data at any place in its memory. Data structure can compute the addresses of data items with arithmetic operations. Linked data structures are based on storing addresses of data items within structure itself. Array, records, hash table, union, set, graphs, trees. Organize data, access data, manipulate selections to derive information: should satisfactorily represent relationship between data element, should be simple for problem, so programmer can easily process data. Linear: values are stored in sequence and arranged in linear fashion e. g. ) linear list, queues, stacks. Non-linear: values are not sequentially stored e. g. ) trees, graphs, tables, sets. Homogeneous: values with same type of data are stored e. g. ) arrays. Non-homogeneous: values with different types of data are grouped e. g. ) structures, classes.