notes8 - Program - data structures and algorithm Data...

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

View Full Document Right Arrow Icon
Program - data structures and algorithm Data Structure - representation of the real world in the computer Algorithm - thransformation of input data to obtain some output (how data is processed) Content: Analysis tools, stack, queue, lists (single and double linked lists), trees, priority queues, dictionaries (hashTables, trees), sorting (quicksort, mergesort, bucketsort, radixsort), text processing, graphs Garbage Collection: frees objects no longer used (java has built in garbage collection) Algorithm Characteristics: Time - Running Time typically mesaured in secs depends on input type/kind of input processing power compiler language (different languages different optimizations) programmer Space: Amount of memory that algorithm uses (Bytes) memory is cheap -we will concentrate more in time than space -cpu time NOT I/O time Types of Running Time - worst case (most difficult input) - avg case (take avg time among all inputs) - best case (easiest input) CS 251 will study the worst case more than the average case and best case because if
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

notes8 - Program - data structures and algorithm Data...

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