&DUORV'HOJDGR.ORRV,QJHQLHUtD7HOHPiWLFD 8QLY&DUORV,,,GH0DGULG. Copyright 2001 Java: Pilas y Colas / 1

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "&DUORV'HOJDGR.ORRV,QJHQLHUtD7HOHPiWLFD 8QLY&DUORV,,,GH0DGULG. Copyright 2001 cdk@it.uc3m.es Java: Pilas y Colas / 1"

Transcription

1 3LODV &DUORV'HOJDGR.ORRV,QJHQLHUtD7HOHPiWLFD 8QLY&DUORV,,,GH0DGULG Copyright 2001 Java: Pilas y Colas / 1 MHPSOR Copyright 2001 Java: Pilas y Colas / 2 1

2 MHPSOR Copyright 2001 Java: Pilas y Colas / 3 MHPSOR Copyright 2001 Java: Pilas y Colas / 4 2

3 &DUDFWHUtVWLFDV VWUXFWXUDOLQHDO $FFHVRGHLQVHUFLyQ\HOLPLQDFLyQ SRUXQVRORH[WUHPR Copyright 2001 Java: Pilas y Colas / 5 0pWRGRVSULQFLSDOHV 0HWHUSRUXQH[WUHPRpushx) 6DFDUSRUHOPLVPRH[WUHPRpop) Copyright 2001 Java: Pilas y Colas / 6 3

4 MHPSOR &RPSUREDUSDUpQWHVLV %LHQ 0DO 5HJODV %ivlfr 6HFXHQFLDFLyQ $QLGDPLHQWR Copyright 2001 Java: Pilas y Colas / 7 MHPSOR &RPSUREDUSDUpQWHVLV 5HJODV &DGDYH]TXHQRVHQFRQWUHPRV ORPHWHPRVHQODSLOD &DGDYH]TXHQRVHQFRQWUHPRV ) VDFDPRVHOVXSHULRUGHODSLOD /DFDGHQDGHSDUpQWHVLVHVFRUUHFWD VLODSLODHVWiYDFtD DODFDEDUGHUHFRUUHUWRGDODFDGHQD Copyright 2001 Java: Pilas y Colas / 8 4

5 MHPSOR )))))) Copyright 2001 Java: Pilas y Colas / 9 MHPSOR )))))) Copyright 2001 Java: Pilas y Colas / 10 5

6 MHPSOR )))))) Copyright 2001 Java: Pilas y Colas / 11 MHPSOR )))))) Copyright 2001 Java: Pilas y Colas / 12 6

7 MHPSOR )))))) Copyright 2001 Java: Pilas y Colas / 13 MHPSOR )))))) Copyright 2001 Java: Pilas y Colas / 14 7

8 MHPSOR )))))) Copyright 2001 Java: Pilas y Colas / 15 MHPSOR )))))) Copyright 2001 Java: Pilas y Colas / 16 8

9 MHPSOR )))))) Copyright 2001 Java: Pilas y Colas / 17 MHPSOR )))))) Copyright 2001 Java: Pilas y Colas / 18 9

10 MHPSOR )))))) Copyright 2001 Java: Pilas y Colas / 19 MHPSOR )))))) Copyright 2001 Java: Pilas y Colas / 20 10

11 MHPSOR &RUUHFWR +HPRV UHFRUULGR WRGD OD FDGHQD \ OD SLOD HVWi YDFtD )))))) Copyright 2001 Java: Pilas y Colas / 21,QWHUID]SDUDSLODV public interface Stack { public int size); public boolean isempty); public void pushobject o); public Object pop) throws StackEmptyException; public Object top) throws StackEmptyException; } Copyright 2001 Java: Pilas y Colas / 22 11

12 8QLQWHUID]\ YDULDVLPSOHPHQWDFLRQHV Stack ArrayStack LinkedStack Copyright 2001 Java: Pilas y Colas / 23,PSOHPHQWDFLyQ EDVDGDHQDUUD\V S top top top top top top N-1 Copyright 2001 Java: Pilas y Colas / 24 12

13 ,PSOHPHQWDFLyQ EDVDGDHQDUUD\V public class ArrayStack implements Stack { public static final int CAP=1000; private int capacity; private Object S[]; private int top=-1; public ArrayStack){thisCAP);} public ArrayStackint cap){ capacity=cap; S=new Object[capacity];} Copyright 2001 Java: Pilas y Colas / 25,PSOHPHQWDFLyQ EDVDGDHQDUUD\V public int size) {return top+1);} public boolean isempty) {return top<0);} public Object top) throws StackEmptyException { if isempty)) throw new StackEmptyException"vacio"}; return S[top];} Copyright 2001 Java: Pilas y Colas / 26 13

14 ,PSOHPHQWDFLyQ EDVDGDHQDUUD\V public void pushobject o) throws StackFullException { if size)==capacity) throw new StackFullException"lleno"); S[++top]=o;} public Object pop) throws StackEmptyException { Object el; if isempty)) throw new StackEmptyException"vacio"}; el=s[top]; S[top--]=null; return el;} Copyright 2001 Java: Pilas y Colas / 27 },PSOHPHQWDFLyQEDVDGD HQOLVWDVHQFDGHQDGDV Madrid Miami Múnich Copyright 2001 Java: Pilas y Colas / 28 14

15 ,PSOHPHQWDFLyQ EDVDGDHQOLVWDV class Node { private Object elem; private Node next; public NodeObject e, Node n) { elem=e; next=n;} void setelemobject e) {elem=e;} void setnextnode n) {next=n;} Object getelem) {return elem;} Object getnext) {return next;} } Copyright 2001 Java: Pilas y Colas / 29,PSOHPHQWDFLyQ EDVDGDHQOLVWDV public class LinkedStack implements Stack { private Node top; private int size; public LinkedStack) {top=null; size=0;} public int size) {return size;} public boolean isempty) { returntop==null);} Copyright 2001 Java: Pilas y Colas / 30 15

16 ,PSOHPHQWDFLyQ EDVDGDHQOLVWDV public void pushobject e) { Node n=new Node); n.seteleme); n.setnexttop); top=n; size++; } Copyright 2001 Java: Pilas y Colas / 31,QVHUFLyQpush top Madrid Miami Múnich Moscú Copyright 2001 Java: Pilas y Colas / 32 16

17 ,PSOHPHQWDFLyQ EDVDGDHQOLVWDV public Object top) throws StackEmptyException { if isempty)) throw new StackEmptyException"vacia"); return top.getelem); } Copyright 2001 Java: Pilas y Colas / 33,PSOHPHQWDFLyQ EDVDGDHQOLVWDV public Object pop) throws StackEmptyException { Object temp; if isempty)) throw new StackEmptyException"vacia"); temp=top.getelem); top=top.getnext); size--; return temp; } Copyright 2001 Java: Pilas y Colas / 34 17

18 %RUUDGRpop top Moscú Madrid Miami Múnich Copyright 2001 Java: Pilas y Colas / 35 3LODV\UHFXUVLyQ public static long fac int n) {if n<=1) return 1; else return n*facn-1); } Copyright 2001 Java: Pilas y Colas / 36 18

19 MHFXFLyQ fac4) 4*fac3) 4*3*fac2)) 4*3*2*fac1))) 4*3*2*1))) 4*3*2) 4*6 24 2* 3* 4* Copyright 2001 Java: Pilas y Colas / 37 &RODV &DUORV'HOJDGR.ORRV,QJHQLHUtD7HOHPiWLFD 8QLY&DUORV,,,GH0DGULG Copyright 2001 Java: Pilas y Colas / 38 19

20 MHPSOR /DFRODGHODXWRE~V /DFRODGHODLPSUHVRUD Copyright 2001 Java: Pilas y Colas / 39 &DUDFWHUtVWLFDV VWUXFWXUDOLQHDO $FFHVRGHLQVHUFLyQSRUXQH[WUHPR\ GHHOLPLQDFLyQSRUHORWURH[WUHPR Copyright 2001 Java: Pilas y Colas / 40 20

21 ,QWHUID]SDUDFRODV public interface Queue { public int size); public boolean isempty); public void enqueueobject o); public Object dequeue) throws QueueEmptyException; public Object front) throws QueueEmptyException; } Copyright 2001 Java: Pilas y Colas / 41 8QLQWHUID]\ YDULDVLPSOHPHQWDFLRQHV Queue ArrayQueue LinkedQueue Copyright 2001 Java: Pilas y Colas / 42 21

22 ,QVHUFLyQenqueue top tail Madrid Miami Múnich Moscú Copyright 2001 Java: Pilas y Colas / 43,PSOHPHQWDFLyQ EDVDGDHQOLVWDV public void enqueueobject e) { Node n=new Node); n.seteleme); n.setnextnull); if size==0) top=n; else tail.setnextn); tail=n; size++; } Copyright 2001 Java: Pilas y Colas / 44 22

23 ,PSOHPHQWDFLyQ EDVDGDHQOLVWDV public Object dequeue) throws QueueEmptyException { Object temp; if isempty)) throw new QueueEmptyException"vacia"); temp=top.getelem); top=top.getnext); size--; if size==0) tail=null return temp; } Copyright 2001 Java: Pilas y Colas / 45 23

What is a Stack? Stacks and Queues. Stack Abstract Data Type. Java Interface for Stack ADT. Array-based Implementation

What is a Stack? Stacks and Queues. Stack Abstract Data Type. Java Interface for Stack ADT. Array-based Implementation Stacks and Queues What is a Stack? Stores a set of elements in a particular order Accessed in Last-In In-First-Out (LIFO) fashion Real life examples: Pile of books PEZ dispenser Cup trays in cafeteria

More information

STACKS,QUEUES, AND LINKED LISTS

STACKS,QUEUES, AND LINKED LISTS STACKS,QUEUES, AND LINKED LISTS Stacks Queues Linked Lists Double-Ended Queues Case Study: A Stock Analysis Applet 1 Stacks Astack is a container of objects that are inserted and removed according to the

More information

Queues Outline and Required Reading: Queues ( 4.2 except 4.2.4) COSC 2011, Fall 2003, Section A Instructor: N. Vlajic

Queues Outline and Required Reading: Queues ( 4.2 except 4.2.4) COSC 2011, Fall 2003, Section A Instructor: N. Vlajic Queues Outline and Required Reading: Queues ( 4. except 4..4) COSC, Fall 3, Section A Instructor: N. Vlajic Queue ADT Queue linear data structure organized according to first-in/first-out (FIFO) principle!

More information

This lecture. Abstract data types Stacks Queues. ADTs, Stacks, Queues 1. 2004 Goodrich, Tamassia

This lecture. Abstract data types Stacks Queues. ADTs, Stacks, Queues 1. 2004 Goodrich, Tamassia This lecture Abstract data types Stacks Queues ADTs, Stacks, Queues 1 Abstract Data Types (ADTs) An abstract data type (ADT) is an abstraction of a data structure An ADT specifies: Data stored Operations

More information

1.00 Lecture 35. Data Structures: Introduction Stacks, Queues. Reading for next time: Big Java: 15.1-15.3. Data Structures

1.00 Lecture 35. Data Structures: Introduction Stacks, Queues. Reading for next time: Big Java: 15.1-15.3. Data Structures 1.00 Lecture 35 Data Structures: Introduction Stacks, Queues Reading for next time: Big Java: 15.1-15.3 Data Structures Set of reusable classes used in algorithms, simulations, operating systems, applications

More information

Stacks & Queues. Data structures and Algorithms

Stacks & Queues. Data structures and Algorithms Stacks & Queues Data structures and Algorithms Acknowledgement: These slides are adapted from slides provided with Data Structures and Algorithms in C++ Goodrich, Tamassia and Mount (Wiley, 2004) Outline

More information

CmpSci 187: Programming with Data Structures Spring 2015

CmpSci 187: Programming with Data Structures Spring 2015 CmpSci 187: Programming with Data Structures Spring 2015 Lecture #12 John Ridgway March 10, 2015 1 Implementations of Queues 1.1 Linked Queues A Linked Queue Implementing a queue with a linked list is

More information

Outline. The Stack ADT Applications of Stacks Array-based implementation Growable array-based stack. Stacks 2

Outline. The Stack ADT Applications of Stacks Array-based implementation Growable array-based stack. Stacks 2 Stacks Outline The Stack ADT Applications of Stacks Array-based implementation Growable array-based stack Stacks 2 Abstract Data Types (ADTs) An abstract data type (ADT) is an abstraction of a data structure

More information

Announcements. FINAL EXAM Monday May 21, 1:30pm Review Session. Wednesday May 16, 7-9pm

Announcements. FINAL EXAM Monday May 21, 1:30pm Review Session. Wednesday May 16, 7-9pm Announcements FINAL EXAM Monday May 21, 1:30pm Review Session Wednesday May 16, 7-9pm 1 Recitation 12 Root Finding, Sorting, Stacks, Queues 2 Outline Linked Lists Sorting Queues 3 Object References Let

More information

csci 210: Data Structures Stacks and Queues

csci 210: Data Structures Stacks and Queues csci 210: Data Structures Stacks and Queues Summary Topics stacks and queues as abstract data types implementations arrays linked lists analysis and comparison application: searching with stacks and queues

More information

Stacks. Stacks (and Queues) Stacks. q Stack: what is it? q ADT. q Applications. q Implementation(s) CSCU9A3 1

Stacks. Stacks (and Queues) Stacks. q Stack: what is it? q ADT. q Applications. q Implementation(s) CSCU9A3 1 Stacks (and Queues) 1 Stacks Stack: what is it? ADT Applications Implementation(s) 2 CSCU9A3 1 Stacks and ueues A stack is a very important data structure in computing science. A stack is a seuence of

More information

Arrays and Linked Lists. Johns Hopkins Department of Computer Science Course : Data Structures, Professor: Greg Hager

Arrays and Linked Lists. Johns Hopkins Department of Computer Science Course : Data Structures, Professor: Greg Hager Arrays and Linked Lists Value vs. Reference Variables Value i 10 j Reference 10 new performs dynamic memory allocation int i=10; int[] j = new int[1]; j[0] = 10; Or int[] j = {10}; Variables of primitive

More information

14 Stacks, Queues, And Linked Lists

14 Stacks, Queues, And Linked Lists 14-1 Java Au Naturel by William C. Jones 14-1 14 Stacks, Queues, And Linked Lists Overview This chapter requires that you have a solid understanding of arrays (Chapter Seven) and have studied Exceptions

More information

C++ Introduction to class and data abstraction

C++ Introduction to class and data abstraction C++ Introduction to class and data abstraction 1 Data abstraction A data abstraction is a simplified view of an object by specifying what can be done with the object while hiding unnecessary details In

More information

! stack, queue, priority queue, dictionary, sequence, set e.g., a Stack is a list implements a LIFO policy on additions/deletions.

! stack, queue, priority queue, dictionary, sequence, set e.g., a Stack is a list implements a LIFO policy on additions/deletions. Abstract Data Types and Data Structures Often, these terms are used as synonyms. But it s better to think of them this way: ADTs and Data Structures An Abstract Data Type (ADT) represents a particular

More information

Outline. Computer Science 331. Stack ADT. Definition of a Stack ADT. Stacks. Parenthesis Matching. Mike Jacobson

Outline. Computer Science 331. Stack ADT. Definition of a Stack ADT. Stacks. Parenthesis Matching. Mike Jacobson Outline Computer Science 1 Stacks Mike Jacobson Department of Computer Science University of Calgary Lecture #12 1 2 Applications Array-Based Linked List-Based 4 Additional Information Mike Jacobson (University

More information

Course: Programming II - Abstract Data Types. The ADT Stack. A stack. The ADT Stack and Recursion Slide Number 1

Course: Programming II - Abstract Data Types. The ADT Stack. A stack. The ADT Stack and Recursion Slide Number 1 Definition Course: Programming II - Abstract Data Types The ADT Stack The ADT Stack is a linear sequence of an arbitrary number of items, together with access procedures. The access procedures permit insertions

More information

Queues and Stacks. Atul Prakash Downey: Chapter 15 and 16

Queues and Stacks. Atul Prakash Downey: Chapter 15 and 16 Queues and Stacks Atul Prakash Downey: Chapter 15 and 16 Queues Queues occur in real life a lot. Queues at checkout Queues in banks In software systems: Queue of requests at a web servers Properties of

More information

Course: Programming II - Abstract Data Types. The ADT Queue. (Bobby, Joe, Sue, Ellen) Add(Ellen) Delete( ) The ADT Queues Slide Number 1

Course: Programming II - Abstract Data Types. The ADT Queue. (Bobby, Joe, Sue, Ellen) Add(Ellen) Delete( ) The ADT Queues Slide Number 1 Definition Course: Programming II - Abstract Data Types The ADT Queue The ADT Queue is a linear sequence of an arbitrary number of items, together with access procedures. The access procedures permit addition

More information

Data Structures in the Java API

Data Structures in the Java API Data Structures in the Java API Vector From the java.util package. Vectors can resize themselves dynamically. Inserting elements into a Vector whose current size is less than its capacity is a relatively

More information

Problem 1 (1.5 points)

Problem 1 (1.5 points) Leganés, June 17th, 2014 Time: 120 min Systems Programming Extraordinary Call (Problems) Grade: 5 points out of 10 from the exam Problem 1 (1.5 points) City councils apply two types of municipal taxes

More information

Algorithms and Data Structures

Algorithms and Data Structures Basic Data Structures Page 1 BFH-TI: Softwareschule Schweiz Basic Data Structures Dr. CAS SD01 Basic Data Structures Page 2 Outline Data Structures and Abstract Data Types Linear Data Structures Implementing

More information

LINKED DATA STRUCTURES

LINKED DATA STRUCTURES LINKED DATA STRUCTURES 1 Linked Lists A linked list is a structure in which objects refer to the same kind of object, and where: the objects, called nodes, are linked in a linear sequence. we keep a reference

More information

1.204 Lecture 6. Data structures: stacks, queues, trees, dictionaries. Data structures

1.204 Lecture 6. Data structures: stacks, queues, trees, dictionaries. Data structures 1.204 Lecture 6 Data structures: stacks, queues, trees, dictionaries Data structures Correct and efficient representation of data and applicable rules Stack: last in, first out discipline Queue: first

More information

Introduction to Stacks

Introduction to Stacks Introduction to Stacks What is a Stack Stack implementation using array. Stack implementation using linked list. Applications of Stack. What is a Stack? Stack is a data structure in which data is added

More information

Data Structures and Algorithms Lists

Data Structures and Algorithms Lists Data Structures and Algorithms Lists Chris Brooks Department of Computer Science University of San Francisco Department of Computer Science University of San Francisco p.1/19 5-0: Abstract Data Types An

More information

Linked Lists Linked Lists, Queues, and Stacks

Linked Lists Linked Lists, Queues, and Stacks Linked Lists Linked Lists, Queues, and Stacks CSE 10: Introduction to C Programming Fall 200 Dynamic data structure Size is not fixed at compile time Each element of a linked list: holds a value points

More information

Software Development with UML and Java 2 SDJ I2, Spring 2010

Software Development with UML and Java 2 SDJ I2, Spring 2010 Software Development with UML and Java 2 SDJ I2, Spring 2010 Agenda week 7, 2010 Pakages Looking back Looking forward Packages Interfaces Page 1 Spring 2010 Download, Install/Setup 1. Java SE SDK (http://java.sun.com/javase/downloads)

More information

Programming with Data Structures

Programming with Data Structures Programming with Data Structures CMPSCI 187 Spring 2016 Please find a seat Try to sit close to the center (the room will be pretty full!) Turn off or silence your mobile phone Turn off your other internet-enabled

More information

Recursion. Definition: o A procedure or function that calls itself, directly or indirectly, is said to be recursive.

Recursion. Definition: o A procedure or function that calls itself, directly or indirectly, is said to be recursive. Recursion Definition: o A procedure or function that calls itself, directly or indirectly, is said to be recursive. Why recursion? o For many problems, the recursion solution is more natural than the alternative

More information

Data Structures and Algorithms(3)

Data Structures and Algorithms(3) Ming Zhang Data Structures and Algorithms Data Structures and Algorithms(3) Instructor: Ming Zhang Textbook Authors: Ming Zhang, Tengjiao Wang and Haiyan Zhao Higher Education Press, 2008.6 (the "Eleventh

More information

csci 210: Data Structures Linked lists

csci 210: Data Structures Linked lists csci 210: Data Structures Linked lists Summary Today linked lists single-linked lists double-linked lists circular lists READING: GT textbook chapter 3 Arrays vs. Linked Lists We ve seen arrays: int[]

More information

COMPUTER SCIENCE. Paper 1 (THEORY)

COMPUTER SCIENCE. Paper 1 (THEORY) COMPUTER SCIENCE Paper 1 (THEORY) (Three hours) Maximum Marks: 70 (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time) -----------------------------------------------------------------------------------------------------------------------

More information

Data Structures. Topic #4

Data Structures. Topic #4 Topic #4 Today s Agenda Stack and Queue ADTs What are they Like Ordered Lists, are position oriented Use of Data Structures for Stacks and Queues arrays (statically & dynamically allocated) linear linked

More information

Algorithms and Data Structures Written Exam Proposed SOLUTION

Algorithms and Data Structures Written Exam Proposed SOLUTION Algorithms and Data Structures Written Exam Proposed SOLUTION 2005-01-07 from 09:00 to 13:00 Allowed tools: A standard calculator. Grading criteria: You can get at most 30 points. For an E, 15 points are

More information

Class Overview. CSE 326: Data Structures. Goals. Goals. Data Structures. Goals. Introduction

Class Overview. CSE 326: Data Structures. Goals. Goals. Data Structures. Goals. Introduction Class Overview CSE 326: Data Structures Introduction Introduction to many of the basic data structures used in computer software Understand the data structures Analyze the algorithms that use them Know

More information

Input: an array of elements (e.g. integers) Output: an array containing all the elements provided as input in sorted order Steps

Input: an array of elements (e.g. integers) Output: an array containing all the elements provided as input in sorted order Steps Bubble Sort Input: an array of elements (e.g. integers) Output: an array containing all the elements provided as input in sorted order Steps take two adjacent elements at a time and compare them. if input[i]

More information

Universidad Carlos III de Madrid

Universidad Carlos III de Madrid Universidad Carlos III de Madrid Algorithms and Data Structures (ADS) Bachelor in Informatics Engineering Computer Science Department Lists, Stacks and Queues. Authors: Isabel Segura Bedmar April 2011

More information

Linked Lists, Stacks, Queues, Deques. It s time for a chainge!

Linked Lists, Stacks, Queues, Deques. It s time for a chainge! Linked Lists, Stacks, Queues, Deques It s time for a chainge! Learning Goals After this unit, you should be able to... Differentiate an abstraction from an implementation. Define and give examples of problems

More information

API for java.util.iterator. ! hasnext() Are there more items in the list? ! next() Return the next item in the list.

API for java.util.iterator. ! hasnext() Are there more items in the list? ! next() Return the next item in the list. Sequences and Urns 2.7 Lists and Iterators Sequence. Ordered collection of items. Key operations. Insert an item, iterate over the items. Design challenge. Support iteration by client, without revealing

More information

Copyright 2013 wolfssl Inc. All rights reserved. 2

Copyright 2013 wolfssl Inc. All rights reserved. 2 - - Copyright 2013 wolfssl Inc. All rights reserved. 2 Copyright 2013 wolfssl Inc. All rights reserved. 2 Copyright 2013 wolfssl Inc. All rights reserved. 3 Copyright 2013 wolfssl Inc. All rights reserved.

More information

Monitors, Java, Threads and Processes

Monitors, Java, Threads and Processes Monitors, Java, Threads and Processes 185 An object-oriented view of shared memory A semaphore can be seen as a shared object accessible through two methods: wait and signal. The idea behind the concept

More information

Programming by Contract. Programming by Contract: Motivation. Programming by Contract: Preconditions and Postconditions

Programming by Contract. Programming by Contract: Motivation. Programming by Contract: Preconditions and Postconditions COMP209 Object Oriented Programming Designing Classes 2 Mark Hall Programming by Contract (adapted from slides by Mark Utting) Preconditions Postconditions Class invariants Programming by Contract An agreement

More information

HW3: Programming with stacks

HW3: Programming with stacks HW3: Programming with stacks Due: 12PM, Noon Thursday, September 18 Total: 20pts You may do this assignment with one other student. A team of two members must practice pair programming. Pair programming

More information

Java Software Structures

Java Software Structures INTERNATIONAL EDITION Java Software Structures Designing and Using Data Structures FOURTH EDITION John Lewis Joseph Chase This page is intentionally left blank. Java Software Structures,International Edition

More information

CSE 2123: Collections: Maps. Jeremy Morris

CSE 2123: Collections: Maps. Jeremy Morris CSE 2123: Collections: Maps Jeremy Morris 1 Collections - Map A map is another kind of collection Different from previously discussed examples Lists, Queues, Stacks are all linear collections Some meaning

More information

7.1 Our Current Model

7.1 Our Current Model Chapter 7 The Stack In this chapter we examine what is arguably the most important abstract data type in computer science, the stack. We will see that the stack ADT and its implementation are very simple.

More information

List, Stack and Queue. Tom Chao Zhou CSC2100B Data Structures Tutorial 3

List, Stack and Queue. Tom Chao Zhou CSC2100B Data Structures Tutorial 3 List, Stack and Queue Tom Chao Zhou CSC2100B Data Structures Tutorial 3 Outline Structure Linked List Overview Implementation Stack Overview Implementation Queue Overview Implementation Structure A collection

More information

Data Structures In Java

Data Structures In Java Data Structures In Java In this section of notes you will learn about two common types of data structures: Queues Stacks Data structures in Java Data Structures: Description A composite type that has a

More information

Description: Maintenance review of the JDBC RowSets 1.0 Specification. Feedback: Comments should be sent to jsr114-comments@jcp.

Description: Maintenance review of the JDBC RowSets 1.0 Specification. Feedback: Comments should be sent to jsr114-comments@jcp. JDBC RowSets Maintenance Release 1.2 Description: Maintenance review of the JDBC RowSets 1.0 Specification Maintenance Lead: Lance Andersen, Oracle Corporation Feedback: Comments should be sent to jsr114-comments@jcp.org

More information

University of Illinois at Urbana-Champaign Department of Computer Science. First Examination

University of Illinois at Urbana-Champaign Department of Computer Science. First Examination University of Illinois at Urbana-Champaign Department of Computer Science First Examination CS 225 Data Structures and Software Principles Fall 2007 7p-9p, Thursday, October 4 Name: NetID: Lab Section

More information

Last not not Last Last Next! Next! Line Line Forms Forms Here Here Last In, First Out Last In, First Out not Last Next! Call stack: Worst line ever!

Last not not Last Last Next! Next! Line Line Forms Forms Here Here Last In, First Out Last In, First Out not Last Next! Call stack: Worst line ever! ECE 551 C++ Programming, Data structures, and Algorithms Abstract Data Type: Stack Last In First Out (LIFO) 1 2 2 1 4 3 1 3 4 Stacks in Programming Worst line ever! 5 3 1 5 Stacks are not useful for waiting

More information

CS0213 DATA STRUCTURES AND ALGORITHM LAB USING C & C++ LABORATORY MANUAL II - CSE III - SEMESTER ACADEMIC YEAR:

CS0213 DATA STRUCTURES AND ALGORITHM LAB USING C & C++ LABORATORY MANUAL II - CSE III - SEMESTER ACADEMIC YEAR: CS0213 DATA STRUCTURES AND ALGORITHM LAB USING C & C++ LABORATORY MANUAL II - CSE III - SEMESTER ACADEMIC YEAR: 2012-2013 SCHOOL OF COMPUTER SCIENCE & ENGINEERING SRM UNIVERSITY, SRM NAGAR, KATTANKULATHUR-603203.

More information

Stacks and queues. Algorithms and Data Structures, Fall 2011. Rasmus Pagh. Based on slides by Kevin Wayne, Princeton

Stacks and queues. Algorithms and Data Structures, Fall 2011. Rasmus Pagh. Based on slides by Kevin Wayne, Princeton Algorithms and Data Structures, Fall 2011 Stacks and queues Rasmus Pagh Based on slides by Kevin Wayne, Princeton Algorithms, 4 th Edition Robert Sedgewick and Kevin Wayne Copyright 2002 2011 Stacks and

More information

Data Structures and Algorithms Binary Search Trees

Data Structures and Algorithms Binary Search Trees Data Structures and Algorithms Binary Search Trees Chris Brooks Department of Computer Science University of San Francisco Department of Computer Science University of San Francisco p.1/34 To find the

More information

ADTs,, Arrays, Linked Lists

ADTs,, Arrays, Linked Lists 1 ADTs,, Arrays, Linked Lists Outline and Required Reading: ADTs ( 2.1.2) Arrays ( 1.5) Linked Lists ( 4.3.1, 4.3.2) COSC 2011, Fall 2003, Section A Instructor: N. Vlajic Abstract Data Type (ADT) 2 abstract

More information

Lecture 4. The Java Collections Framework

Lecture 4. The Java Collections Framework Lecture 4. The Java s Framework Chapters 6.3-6.4-1 - The Java s Framework We will consider the Java s Framework as a good example of how apply the principles of objectoriented software engineering (see

More information

TESTING WITH JUNIT. Lab 3 : Testing

TESTING WITH JUNIT. Lab 3 : Testing TESTING WITH JUNIT Lab 3 : Testing Overview Testing with JUnit JUnit Basics Sample Test Case How To Write a Test Case Running Tests with JUnit JUnit plug-in for NetBeans Running Tests in NetBeans Testing

More information

UIL Computer Science for Dummies by Jake Warren and works from Mr. Fleming

UIL Computer Science for Dummies by Jake Warren and works from Mr. Fleming UIL Computer Science for Dummies by Jake Warren and works from Mr. Fleming 1 2 Foreword First of all, this book isn t really for dummies. I wrote it for myself and other kids who are on the team. Everything

More information

DATA STRUCTURE - QUEUE

DATA STRUCTURE - QUEUE DATA STRUCTURE - QUEUE http://www.tutorialspoint.com/data_structures_algorithms/dsa_queue.htm Copyright tutorialspoint.com Queue is an abstract data structure, somewhat similar to stack. In contrast to

More information

Abstract Data Type. EECS 281: Data Structures and Algorithms. The Foundation: Data Structures and Abstract Data Types

Abstract Data Type. EECS 281: Data Structures and Algorithms. The Foundation: Data Structures and Abstract Data Types EECS 281: Data Structures and Algorithms The Foundation: Data Structures and Abstract Data Types Computer science is the science of abstraction. Abstract Data Type Abstraction of a data structure on that

More information

1. What are Data Structures? Introduction to Data Structures. 2. What will we Study? CITS2200 Data Structures and Algorithms

1. What are Data Structures? Introduction to Data Structures. 2. What will we Study? CITS2200 Data Structures and Algorithms 1 What are ata Structures? ata Structures and lgorithms ata structures are software artifacts that allow data to be stored, organized and accessed Topic 1 They are more high-level than computer memory

More information

Keys and records. Binary Search Trees. Data structures for storing data. Example. Motivation. Binary Search Trees

Keys and records. Binary Search Trees. Data structures for storing data. Example. Motivation. Binary Search Trees Binary Search Trees Last lecture: Tree terminology Kinds of binary trees Size and depth of trees This time: binary search tree ADT Java implementation Keys and records So far most examples assumed that

More information

Practical Session 4 Java Collections

Practical Session 4 Java Collections Practical Session 4 Java Collections Outline Working with a Collection The Collection interface The Collection hierarchy Case Study: Undoable Stack The Collections class Wrapper classes Collection A group

More information

Collaboration policy. Where to get help Email (but no code in email) Office hours Lab TAs in Friend 008/009 Bounce ideas (but not code) off classmates

Collaboration policy. Where to get help Email (but no code in email) Office hours Lab TAs in Friend 008/009 Bounce ideas (but not code) off classmates Collaboration policy Programs: Do not use someone else s code unless specifically authorized Exceptions Code from course materials OK [cite source] Coding with partner OK after first assignment [stay tuned]

More information

Analysis of a Search Algorithm

Analysis of a Search Algorithm CSE 326 Lecture 4: Lists and Stacks 1. Agfgd 2. Dgsdsfd 3. Hdffdsf 4. Sdfgsfdg 5. Tefsdgass We will review: Analysis: Searching a sorted array (from last time) List ADT: Insert, Delete, Find, First, Kth,

More information

Concurrent Programming (COMP 150-CCP) Spring 2008 Dr. Richard S. Hall April 24 th, 2008

Concurrent Programming (COMP 150-CCP) Spring 2008 Dr. Richard S. Hall April 24 th, 2008 Concurrent Programming (COMP 150-CCP) Spring 2008 Dr. Richard S. Hall April 24 th, 2008 Write your name on each sheet of paper you hand in. Make sure that mobile phones are turned off. This is a closed-book

More information

Rigorous Software Development CSCI-GA 3033-009

Rigorous Software Development CSCI-GA 3033-009 Rigorous Software Development CSCI-GA 3033-009 Instructor: Thomas Wies Spring 2013 Lecture 5 Disclaimer. These notes are derived from notes originally developed by Joseph Kiniry, Gary Leavens, Erik Poll,

More information

Chapter 4 Linked Lists

Chapter 4 Linked Lists Chapter 4 Linked Lists 4.1 Singly Linked lists Or Chains The representation of simple data structure using an array and a sequential mapping has the property: u Successive nodes of the data object are

More information

Object Oriented Software Design

Object Oriented Software Design Object Oriented Software Design Inner classes, RTTI, Tree implementation Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa October 29, 2010 G. Lipari (Scuola Superiore Sant

More information

Lecture 12: Abstract data types

Lecture 12: Abstract data types Lecture 12: Abstract data types Algebras Abstract data types Encapsulation and information hiding Parameterization Algebras Definition Which kinds of data do we want to discuss? What can we do with it?

More information

D06 PROGRAMMING with JAVA

D06 PROGRAMMING with JAVA Cicles Formatius de Grau Superior Desenvolupament d Aplicacions Informàtiques D06 PROGRAMMING with JAVA Ch20 Data Structures I PowerPoint presentation, created by Angel A. Juan - ajuanp(@)gmail.com, for

More information

Data Structures, Practice Homework 2, with Solutions (not to be handed in)

Data Structures, Practice Homework 2, with Solutions (not to be handed in) Data Structures, Practice Homework 2, with Solutions (not to be handed in) 1. Carrano, 4th edition, Chapter 7, Exercise 4. Consider a function int Queue::getNumberOfElements() const that returns the number

More information

Abstract Data Types. Chapter 2

Abstract Data Types. Chapter 2 Chapter 2 Abstract Data Types The second idea at the core of computer science, along with algorithms, is data. In a modern computer, data consists fundamentally of binary bits, but meaningful data is organized

More information

Data Structures and Algorithms

Data Structures and Algorithms Data Structures and Algorithms CS245-2016S-04 Stacks and Queues David Galles Department of Computer Science University of San Francisco 04-0: Abstract Data Types An Abstract Data Type is a definition of

More information

Language Examples of ADT: C++

Language Examples of ADT: C++ Language Examples of ADT: C++ Based on C struct type and Simula 67 classes All of the class instances of a class share a single copy of the member functions Each instance of a class has its own copy of

More information

Data Structures and Algorithms Stacks and Queues

Data Structures and Algorithms Stacks and Queues Data Structures and Algorithms Stacks and Queues Chris Brooks Department of Computer Science University of San Francisco Department of Computer Science University of San Francisco p.1/23 6-0: Stacks and

More information

A binary search tree or BST is a binary tree that is either empty or in which the data element of each node has a key, and:

A binary search tree or BST is a binary tree that is either empty or in which the data element of each node has a key, and: Binary Search Trees 1 The general binary tree shown in the previous chapter is not terribly useful in practice. The chief use of binary trees is for providing rapid access to data (indexing, if you will)

More information

Chapter 3: Restricted Structures Page 1

Chapter 3: Restricted Structures Page 1 Chapter 3: Restricted Structures Page 1 1 2 3 4 5 6 7 8 9 10 Restricted Structures Chapter 3 Overview Of Restricted Structures The two most commonly used restricted structures are Stack and Queue Both

More information

A linear structure is an ordered (e.g., sequenced) arrangement of elements.

A linear structure is an ordered (e.g., sequenced) arrangement of elements. Lists, Stacks, and Queues 1 A linear structure is an ordered (e.g., sequenced) arrangement of elements. There are three common types of linear structures: list stack queue random insertion and deletion

More information

Habanero Extreme Scale Software Research Project

Habanero Extreme Scale Software Research Project Habanero Extreme Scale Software Research Project Comp215: Java Method Dispatch Zoran Budimlić (Rice University) Always remember that you are absolutely unique. Just like everyone else. - Margaret Mead

More information

Table of Contents. LESSON: The JUnit Test Tool...1. Subjects...2. Testing 123...3. What JUnit Provides...4. JUnit Concepts...5

Table of Contents. LESSON: The JUnit Test Tool...1. Subjects...2. Testing 123...3. What JUnit Provides...4. JUnit Concepts...5 Table of Contents LESSON: The JUnit Test Tool...1 Subjects...2 Testing 123...3 What JUnit Provides...4 JUnit Concepts...5 Example Testing a Queue Class...6 Example TestCase Class for Queue...7 Example

More information

Datastrukturer och standardalgoritmer i Java

Datastrukturer och standardalgoritmer i Java 1 (8) Datastrukturer och standardalgoritmer i Java Dokumentet listar ett urval av konstruktorer och metoder för några vanliga Javaklasser. Class ArrayList ArrayList() Constructs an empty list. void

More information

Java Collection Framework hierarchy. What is Data Structure? Chapter 20 Lists, Stacks, Queues, and Priority Queues

Java Collection Framework hierarchy. What is Data Structure? Chapter 20 Lists, Stacks, Queues, and Priority Queues Chapter 20 Lists, Stacks, Queues, and Priority Queues Objectives q To explore the relationship between interfaces and classes in the Java Collections Framework hierarchy ( 20.2). q To use the common methods

More information

CHAPTER 4 ESSENTIAL DATA STRUCTRURES

CHAPTER 4 ESSENTIAL DATA STRUCTRURES CHAPTER 4 ESSENTIAL DATA STRUCTURES 72 CHAPTER 4 ESSENTIAL DATA STRUCTRURES In every algorithm, there is a need to store data. Ranging from storing a single value in a single variable, to more complex

More information

QUEUES. Primitive Queue operations. enqueue (q, x): inserts item x at the rear of the queue q

QUEUES. Primitive Queue operations. enqueue (q, x): inserts item x at the rear of the queue q QUEUES A queue is simply a waiting line that grows by adding elements to its end and shrinks by removing elements from the. Compared to stack, it reflects the more commonly used maxim in real-world, namely,

More information

// Basic node stored in unbalanced binary search trees // Note that this class is not accessible outside // of this package.

// Basic node stored in unbalanced binary search trees // Note that this class is not accessible outside // of this package. // Basic node stored in unbalanced binary search trees // Note that this class is not accessible outside // of this package. class BinaryNode AnyType element; // The data in the node BinaryNode

More information

Project 4 DB A Simple database program

Project 4 DB A Simple database program Project 4 DB A Simple database program Due Date April (Friday) Before Starting the Project Read this entire project description before starting Learning Objectives After completing this project you should

More information

Class 28: Binary Search Trees. Binary Search Trees

Class 28: Binary Search Trees. Binary Search Trees Introduction to Computation and Problem Solving Class 2: Binary Search Trees Prof. Steven R. Lerman and Dr. V. Judson Harward Binary Search Trees In the previous lecture, we defined the concept of binary

More information

Problem 1 (2.5 points)

Problem 1 (2.5 points) Duration: 90 minutes University Carlos III of Madrid Instructions for the exam: Books and notes are not allowed. Please write your name, surname, NIA and group on all pages. Problem 1 (2.5 points) Context:

More information

BSc (Hons) Business Information Systems, BSc (Hons) Computer Science with Network Security. & BSc. (Hons.) Software Engineering

BSc (Hons) Business Information Systems, BSc (Hons) Computer Science with Network Security. & BSc. (Hons.) Software Engineering BSc (Hons) Business Information Systems, BSc (Hons) Computer Science with Network Security & BSc. (Hons.) Software Engineering Cohort: BIS/05/FT BCNS/05/FT BSE/05/FT Examinations for 2005-2006 / Semester

More information

Arrays and Linked Lists

Arrays and Linked Lists Arrays and Linked Lists Data Structures and Algorithms Acknowledgement: These slides are adapted from slides provided with Data Structures and Algorithms in C++ Goodrich, Tamassia and Mount (Wiley, 2004)

More information

Priority Queues. Client, Implementation, Interface. Priority Queues. Abstract Data Types

Priority Queues. Client, Implementation, Interface. Priority Queues. Abstract Data Types Client, Implementation, Interface Priority Queues Priority Queue ADT Binary heaps Heapsort Reference: Chapter 6, Algorithms in Java, 3 rd Edition, Robert Sedgewick. Separate interface and implementation

More information

Collections & Data Structures. CS 3: Computer Programming in Java

Collections & Data Structures. CS 3: Computer Programming in Java Collections & Data Structures CS 3: Computer Programming in Java Objectives The concept of a collection Separating the interface from the implementation Dynamic data structures Linked lists Queues and

More information

Collections in Java. Arrays. Iterators. Collections (also called containers) Has special language support. Iterator (i) Collection (i) Set (i),

Collections in Java. Arrays. Iterators. Collections (also called containers) Has special language support. Iterator (i) Collection (i) Set (i), Arrays Has special language support Iterators Collections in Java Iterator (i) Collections (also called containers) Collection (i) Set (i), HashSet (c), TreeSet (c) List (i), ArrayList (c), LinkedList

More information

6 Data Structures. 6.1 Quadtree. 6.2 Binary search tree

6 Data Structures. 6.1 Quadtree. 6.2 Binary search tree 6 Data Structures 6.1 Quadtree he basic principles of quadtrees have been outlined in the lecture. ollow these steps for the implementation in Java: 1. Download the quadtree.zip file from the course web

More information

St S a t ck a ck nd Qu Q eue 1

St S a t ck a ck nd Qu Q eue 1 Stack and Queue 1 Stack Data structure with Last-In First-Out (LIFO) behavior In Out C B A B C 2 Typical Operations Pop on Stack Push isempty: determines if the stack has no elements isfull: determines

More information

CompSci-61B, Data Structures Final Exam

CompSci-61B, Data Structures Final Exam Your Name: CompSci-61B, Data Structures Final Exam Your 8-digit Student ID: Your CS61B Class Account Login: This is a final test for mastery of the material covered in our labs, lectures, and readings.

More information

File I/O - Chapter 10. Many Stream Classes. Text Files vs Binary Files

File I/O - Chapter 10. Many Stream Classes. Text Files vs Binary Files File I/O - Chapter 10 A Java stream is a sequence of bytes. An InputStream can read from a file the console (System.in) a network socket an array of bytes in memory a StringBuffer a pipe, which is an OutputStream

More information

Concurrent programming in Java

Concurrent programming in Java Concurrent programming in Java INF4140 04.10.12 Lecture 5 0 Book: Andrews - ch.05 (5.4) Book: Magee & Kramer ch.04 - ch.07 INF4140 (04.10.12) Concurrent programming in Java Lecture 5 1 / 33 Outline 1 Monitors:

More information