Evaluation of List Implementations

Slides:



Advertisements
Similar presentations
Stacks, Queues, and Linked Lists
Advertisements

Data Structure HKOI training /4/2010 So Pak Yeung.
CS 206 Introduction to Computer Science II 09 / 17 / 2008 Instructor: Michael Eckmann.
Algorithms and Data Structures Representing Sequences by Arrays and Linked Lists.
Week7 Stack Data Structures & Algorithms. Introduction to Stacks and Queues Widely used data structures Ordered List of element Easy to implement Easy.
Computer Science Department Data Structure & Algorithms Lecture 8 Recursion.
Lecture 14 Linked Lists 14-1 Richard Gesick. Linked Lists Dynamic data structures can grow and shrink at execution time. A linked list is a linear collection.
Due: 2007/11/12. Problem 1 Rewrite function Push and Pop (Program 3.10 and 3.12) using an additional variable lastOp as discussed on Page 146. The queue.
4-1 Topic 6 Linked Data Structures. 4-2 Objectives Describe linked structures Compare linked structures to array- based structures Explore the techniques.
Foundation of Computing Systems Lecture 3 Stacks and Queues.
Cousin of the Stack.  An abstract data type (container class) in which items are entered at one end and removed from the other end  First In First.
1 Lecture 14: Queues Lecturer: Santokh Singh CompSci 105 SS 2005 Principles of Computer Science.
Stacks and Queues. Announcements USACO Open competition results are out o Congrats to Johnny for scoring 2nd in the US USACO Finalists are also announced.
Data Structures for Midterm 2. C++ Data Structure Runtimes.
Computer Engineering Rabie A. Ramadan Lecture 6.
Data Structures David Kauchak cs302 Spring Data Structures What is a data structure? Way of storing data that facilitates particular operations.
Computer Science: A Structured Programming Approach Using C1 Objectives ❏ To introduce the basic concepts of linked lists ❏ To introduce the basic concepts.
CISC220 Spring 2010 James Atlas Lecture 10: Queues.
Chapter 3 Lists, Stacks, Queues. Abstract Data Types A set of items – Just items, not data types, nothing related to programming code A set of operations.
Stacks and Queues. DCS – SWC 2 Stacks A stack is an abstract data structure, with some special properties: –Insertion and deletion is only allowed at.
 Chapter 7 introduces the stack data type.  Several example applications of stacks are given in that chapter.  This presentation shows another use called.
Final Exam Review COP4530.
Prefix notation in action
Data Structures Interview Questions.
Data Structure By Amee Trivedi.
G64ADS Advanced Data Structures
Set Collection A Bag is a general collection class that implements the Collection interface. A Set is a collection that resembles a Bag with the provision.
Data Structure Interview Question and Answers
Chapter 15 Lists Objectives
MEMORY REPRESENTATION OF STACKS
Lecture No.06 Data Structures Dr. Sohail Aslam
Objectives In this lesson, you will learn to: Define stacks
Stacks and Queues CMSC 202.
Stacks and Queues.
Topics discussed in this section:
Topics discussed in this section:
CMSC 341 Lecture 5 Stacks, Queues
Principles of Computing – UFCFA3-30-1
STACK By:- Rajendra ShakyawalP.G.T. Computer Science KV-No.1, AFS, Tambaram, Chennai.
Chapter 15 Lists Objectives
Circularly Linked Lists
Stacks, Queues, and Deques
Lecture 20 Linked Lists Richard Gesick.
Final Exam Review COP4530.
Stacks and Queues.
Linked Lists with Tail Pointers
Doubly Linked Lists Lecture 21 Tue, Mar 21, 2006.
CSE 214 – Computer Science II Stacks
Indirection.
Recursive Linked Lists
Stack A data structure in which elements are inserted and removed only at one end (called the top). Enforces Last-In-First-Out (LIFO) Uses of Stacks Evaluating.
Mutable Data (define mylist (list 1 2 3)) (bind ((new (list 4)))
Binary Trees: Motivation
Evaluation of List Implementations
Lecture 16 Section 6.2 Thu, Mar 1, 2007
Lecture 16 CSE 331 Oct 2, 2013.
CS210- Lecture 6 Jun 13, 2005 Announcements
Recursive Linked Lists
Lecture 15: Quicker Sorting CS150: Computer Science
Recursive Linked Lists
Windows Development Dynadata Copyright, 2014 © DynaData S.A. 1/11.
Data Structures Using C++ 2E
More on Linked List Yumei Huo Department of Computer Science
BY PROF. IRSHAD AHMAD LONE.
Chapter 9 Linked Lists.
Presented by : Aman Gupta PGT CS KV No.1, Narimedu, Madurai
Applications of Arrays
LINEAR DATA STRUCTURES
CMPT 225 Lecture 5 – linked list.
CMPT 225 Lecture 7 – Stack.
Presentation transcript:

Evaluation of List Implementations Lecture 23 Wed, Mar 17, 2004

Topics The Test Program Evaluation Results

Evaluation of List Implementations The functions of the various List classes were tested by executing each of them 1,000,000 times and computing the average execution time. Run times are expressed in microseconds. All functions were applied to a list of 1000 elements.

Evaluation of List Implementations The function GetElement() accessed positions both sequentially and randomly in the list. The functions Insert() and Delete() accessed elements randomly in the list.

The Test Program TimeTest.cpp

Table of Results Type of List Get Element (seq) (rand) Insert Delete Push Front Pop Back Array List 0.02 0.30 14.9 15.9 28.7 31.1 0.14 0.23 Circ Array List 0.13 0.38 7.81 7.83 0.21 0.19 0.24 Linked List 8.49 8.81 16.9 19.7 0.68 0.69 32.5 61.1 Linked List w Tail 8.41 8.82 16.8 19.8 0.71 0.66 35.3 Doubly Linked List 4.51 4.85 8.07 9.13 0.60 0.65 0.67 Circ Linked List 4.53 4.92 8.13 0.64 0.72 0.63