Lecture 3a - 2/1/2012 1 Data Structures Data Structures...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon

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

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

Unformatted text preview: 2/1/2012 1 Data Structures Data Structures CNIT 17600 Lecture 3a Fundamental Data Structures Data structures hold a piece of data in order to allow it to be accessed easily Defined and manipulated within software There are many different types of data structures Array Linked List Buffer Queue Each data structure is referenced by its memory address 2/1/2012 2 Memory Addresses References the location of bytes in primary storage Simple or complex numeric values Flat memory addresses (single integer) Segmented memory addresses (multiple integers) Require definition of specific coding format The exact addressing scheme is dependent on the CPU Each is slightly different 3 Address vs. Pointer Address Location of a data element within a storage device Based on the type of storage system The data element at an address stores information Pointer A special data element that contains the memory address of another data element 4 2/1/2012 3 Arrays An ordered list in which each element can be referenced by indices to its position...
View Full Document

This note was uploaded on 02/05/2012 for the course CNIT 176 taught by Professor Hansen during the Spring '09 term at Purdue University-West Lafayette.

Page1 / 8

Lecture 3a - 2/1/2012 1 Data Structures Data Structures...

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

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