CS 240 Lecture Notes - Lecture 2: Formicarium, Hash Table, Linked List
16 Oct 2017
School
Department
Course
Professor
Document Summary
How would you represent the number 1 in a 32 bit computer? (cid:882)(cid:882)(cid:882) (cid:883) (cid:4666)with (cid:885)(cid:884) (cid:882)"s(cid:4667) Perform: addition/basic math, shift operation, logical operations, load/store. We have a way of representing data and things you can do with that data: data representation, operations. A data structure is : data representation, operations. Why do we need to discuss data structures in general: we have a ton of data and we need a way to make data manageable, managable and efficient. Aggregate object: def: a whole formed by combining several (typically disparate) elements, example: array, has a set of same type data points, have the same type of operations. Let"s say we have an unsorted array which means it is unstable data. Example: you have a list of all of the movies on netflix and you have a list of people watching any movie. This needs to allow for the user to check the number of people watching any particular movie.
