notes15 - August 25, 2009 Lecture 1 To know and understand...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
August 25, 2009 – Lecture 1 “To know and understand how something works is necessary to create something new.” Course Overview Goals Learn o Represent real-life information in the computer o Algorithms to process data structures Improve programming skills Content Analysis tools (Asymptotic Analysis) Stacks, Queues Vectors, Lists, Sequences Trees (Binary, AVL, red/black, 2-3 trees) Priority Queues, Heap Dictionaries (Tries) Sorting o Quick sort, heap sort, merge sort, bucket sort, radix sort, bubble sort Text Processing Graphs Lecture Data Structure – Representation of a portion of the world inside the computer (how data is stored) Algorithm – Transformation of input data to obtain some output (how data is processed) Algorithm Characteristics Running Time – How long does the algorithm take? o Measured in: seconds, steps, machine cycles o Depends on: Size of input (n) Characteristics of input Algorithm itself Machine CPU load, programmer, language, compiler, optimizer… Computer Storage – Amount of memory that algorithm uses
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/02/2012 for the course CS 251 taught by Professor Staff during the Fall '08 term at Purdue University-West Lafayette.

Page1 / 4

notes15 - August 25, 2009 Lecture 1 To know and understand...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online