Linear Data Structures 1.1

Linear Data Structures 1.1 - – Arrays – Stacks –...

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

View Full Document Right Arrow Icon
Last Updated: 12-01-17 9:52 AM CSE 2011 Prof. J. Elder - 1 - Lecture 3 Linear Data Structures Chapters 3.1-3.3 , 5.1-5.2, 6.1
Background image of page 1

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

View Full Document Right Arrow Icon
Last Updated: 12-01-17 9:52 AM CSE 2011 Prof. J. Elder - 2 - Outline Our goal in this lecture is to – Review the basic linear data structures – Demonstrate how each can be defined as an Abstract Data Type (ADT) – Demonstrate how each of these ADTs can be specified as a Java interface. – Outline the algorithms for creating, accessing and modifying each data structure – Analyze the running time of these operations – Identify particular applications for which each data structure would be suited.
Background image of page 2
Last Updated: 12-01-17 9:52 AM CSE 2011 Prof. J. Elder - 3 - Outline We will cover the following linear data structures:
Background image of page 3

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

View Full Document Right Arrow Icon
Background image of page 4
Background image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: – Arrays – Stacks – Queues – Singly-Linked Lists – Doubly-Linked Lists Last Updated: 12-01-17 9:52 AM CSE 2011 Prof. J. Elder - 4 - Arrays Chapter 3.1 Last Updated: 12-01-17 9:52 AM CSE 2011 Prof. J. Elder - 5 - Arrays • Array: a sequence of indexed components with the following properties: – array size is fixed at the time of array’s construction • int numbers = new int [10]; – array elements are placed contiguously in memory • address of any element can be calculated directly as its offset from the beginning of the array – consequently, array components can be efficiently inspected or updated in O(1) time, using their indices • randomNumber = numbers[5]; • numbers[2] = 100;...
View Full Document

{[ snackBarMessage ]}

Page1 / 5

Linear Data Structures 1.1 - – Arrays – Stacks –...

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

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