Algorithms_and_Data_Structures_08b

# Algorithms_and_Data_Structures_08b - Course Outline 1. 2....

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

Algorithms and Data Structures Dr. Andreas Nüchter September 29, 2009 283 Course Outline 1. Introduction to Algorithms 2. Sorting 3. Data Structures 4. Advanced Design and Analysis Techniques 5. Graph Algorithms 6. Selected Topics and Outlook

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

View Full Document
Algorithms and Data Structures Dr. Andreas Nüchter September 29, 2009 284 Data Structures A Java/C/Pascal/… program is composed of an algorithmic part (the instructions) that describe, how the stored data is manipulated and a declaration part that contains the structure of the data. Niklaus Wirth (the inventor of Modula and Pascal) used the following formula: Now: Lets look at data structures and (abstract) data types
Algorithms and Data Structures Dr. Andreas Nüchter September 29, 2009 285 Data Structures Roughly spoken data structures are the construction of the co-domain from the variable used by a program. These co-domains are constructed from the co- domains of elementary data types (e.g. int , float , char ) using so-called constructors . From the math point of view they are: Cartesian products (array, record) Disjoint union (variant record) Recursion (pointer) Power sets (set of)

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

View Full Document
Algorithms and Data Structures Dr. Andreas Nüchter
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 05/04/2010 for the course CS 320251 taught by Professor Nuechter during the Fall '09 term at Jacobs University Bremen.

### Page1 / 15

Algorithms_and_Data_Structures_08b - Course Outline 1. 2....

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

View Full Document
Ask a homework question - tutors are online