Data Structures

# Data Structures - Introduction to Data Structures Dr. David...

This preview shows pages 1–6. Sign up to view the full content.

Introduction to Data Structures Dr. David A. Gaitros [email protected]

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

View Full Document
Introduction Data structures form the basis for efficient programming methods and data manipulation for today’s computer scientists. They (data structures) are based upon mathematical concepts such as queues, trees, vectors, hash tables, sets etc. “Tree structures represented explicitly in computer memory were described for the first time in applications to algebraic formula manipulation by Grace M. Hopper circa 1951” The Art of Computer Programming, Fundamental Aglorithms, Vol 1, Donald Knuth, Addison Wesley 1969
Data Structures Vectors (Arrays) Stacks Queues Deques Single Linked Lists Double Linked Lists Circular Linked Lists Binary Trees Balanced Binary Trees Other Tree structures

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

View Full Document
Vectors [0] All [1] good [2] men [3] must [4] come [5] to [6] the [7] aid [8] of [9] their [10] party [11] .
Vectors Usually simple arrays All items stored are of the same type as

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 11/07/2011 for the course COP 3014 taught by Professor Tyson during the Fall '10 term at FSU.

### Page1 / 19

Data Structures - Introduction to Data Structures Dr. David...

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

View Full Document
Ask a homework question - tutors are online