C S 314 Chapter Notes - Chapter 1: Mapreduce, Fibonacci Number, Apache Hadoop
13 Dec 2016
School
Department
Course
Professor
Document Summary
Introduction: why we need clever data structures and algorithms. Representation: how data, pointers, and structures are represented in the computer. Performance and big o: how much time and storage are needed as data sizes become large. Map, reduce, and mapreduce / hadoop: data-intensive and parallel computation. In this course, we will be interested in performance, especially as the size of the problem increases. Understanding performance allows us to select the right data structure for an application. An engineer can do for a dime what any fool can do for a dollar. Thus, engineer / fool 10 . Leonardo of pisa, known as fibonacci, introduced this series to western mathematics in 1202: The ratio between successive fibonacci numbers approaches the golden ratio . We want to be able to recognize problems or computations that will be intractable, impossible to solve in a reasonable amount of time. Exponential growth of computation has several names in computer science:
