Collection ArrayList<T> Collection Collection

Size: px
Start display at page:

Download "Collection ArrayList<T> Collection Collection"

Transcription

1

2 Collection ArrayList<T> Collection Collection Adapted from material by Walter Savitch

3 Adapted from material by Walter Savitch

4 public void method(string arg1, ArrayList<?> arg2) String ArrayList<T> Adapted from material by Walter Savitch

5 <? extends String> <? super String> String String Adapted from material by Walter Savitch

6 Collection<T> Collection<T> Adapted from material by Walter Savitch

7 Method Headings in the Collection<T> Interface (Part 1 of 10) Adapted from material by Walter Savitch

8 Method Headings in the Collection<T> Interface (Part 2 of 10) Adapted from material by Walter Savitch

9 Method Headings in the Collection<T> Interface (Part 3 of 10) Adapted from material by Walter Savitch

10 Method Headings in the Collection<T> Interface (Part 4 of 10) Adapted from material by Walter Savitch

11 Method Headings in the Collection<T> Interface (Part 5 of 10) Adapted from material by Walter Savitch

12 Method Headings in the Collection<T> Interface (Part 6 of 10) Adapted from material by Walter Savitch

13 Method Headings in the Collection<T> Interface (Part 7 of 10) Adapted from material by Walter Savitch

14 Method Headings in the Collection<T> Interface (Part 8 of 10) Adapted from material by Walter Savitch

15 Method Headings in the Collection<T> Interface (Part 9 of 10) Adapted from material by Walter Savitch

16 Method Headings in the Collection<T> Interface (Part 10 of 10) Adapted from material by Walter Savitch

17 Collection<T> Collection<T> Set<T> List<T> Collection<T> Adapted from material by Walter Savitch

18 Set<T> Set<T> Collection<T> Set<T> Collection<T> Adapted from material by Walter Savitch

19 List<T> List<T> List<T> ArrayList<T> List<T> Collection<T> List<T> Collection<T> Adapted from material by Walter Savitch

20 Set<T> The Set<T> interface is in the java.util package. The Set<T> interface extends the Collection<T> interface and has all the same method headings. However, the semantics of the add methods vary as described below. public boolean add(t element) (Optional) If element is not already in the calling object, element is added to the calling object and true is returned. If element is in the calling object, the calling object is unchanged and false is returned. public boolean addall(collection<? extends T> collectiontoadd) (Optional) Ensures that the calling object contains all the elements in collectiontoadd. Returns true if the calling object changed as a result of the call; returns false otherwise. Thus, if collectiontoadd is a Set<T>, then the calling object is changed to the union of itself with collectiontoadd. Adapted from material by Walter Savitch

21 The List<T> interface has more method headings than the Collection<T> interface. Adapted from material by Walter Savitch

22 Adapted from material by Walter Savitch

23 Adapted from material by Walter Savitch

24 Adapted from material by Walter Savitch

25 Adapted from material by Walter Savitch

26 Adapted from material by Walter Savitch

27 Adapted from material by Walter Savitch

28 Adapted from material by Walter Savitch

29 Adapted from material by Walter Savitch

30 Adapted from material by Walter Savitch

31 Adapted from material by Walter Savitch

32 Adapted from material by Walter Savitch

33 Adapted from material by Walter Savitch

34 Adapted from material by Walter Savitch

35 Adapted from material by Walter Savitch

36 Adapted from material by Walter Savitch

37 UnsupportedOperationException Adapted from material by Walter Savitch

38 Adapted from material by Walter Savitch

39 Set<T> HashSet<T> HashSet<T> Set<T> HashSet<T> ArrayList<T> List<T> ArrayList<T> Vector<T> Vector<T> List<T> List<T> Adapted from material by Walter Savitch

40 LinkedList<T> AbstractSequentialList<T> LinkedList<T> SortedSet<T> Set<T> TreeSet<T> Adapted from material by Walter Savitch

41 Adapted from material by Walter Savitch

42 Adapted from material by Walter Savitch

43 Adapted from material by Walter Savitch

44 Adapted from material by Walter Savitch

45 Adapted from material by Walter Savitch

46 Contents of set round: grapes pie ball peas Contents of set green: grass garden hose grapes peas ball in set round? true ball in set green? false ball and peas in same set? true pie and grass in same set? false Union of green and round: garden hose grass peas ball pie grapes Intersection of green and round: peas grapes Adapted from material by Walter Savitch

47 HashSet<T> Adapted from material by Walter Savitch

48 <T> <T> <ClassName> Adapted from material by Walter Savitch

49 Map<T> AbstractMap<T> AbstractMap<T> Adapted from material by Walter Savitch

50 Map<K,V> Implements SortedMap<K,V> AbstractMap<K,V> Implements TreeMap<K,V> HashMap<K,V> Interface Abstract Class Concrete Class A single line between two boxes means the lower class or interface is derived from (extends) the higher one. K and V are type parametersfor the type of the keys and elements stored in the map. Adapted from material by Walter Savitch

51 Adapted from material by Walter Savitch

52 Adapted from material by Walter Savitch

53 Adapted from material by Walter Savitch

54 HashMap<K,V> LinkedHashMap<K,V> TreeMap<K,V> Adapted from material by Walter Savitch

55 Adapted from material by Walter Savitch

56 Adapted from material by Walter Savitch

57 All of the Map Interface methods are supported, such as get and put Adapted from material by Walter Savitch

58 Adapted from material by Walter Savitch

59 Adapted from material by Walter Savitch

60 SAMPLE OUTPUT Added Joe, Andy, Greg, Kiki, and Antoinette to the map. Enter a name to look up in the map. Press enter to quit. Joe Name found: Joe September 15, 1970 Enter a name to look up in the map. Press enter to quit. Andy Name found: Andy August 22, 1971 Enter a name to look up in the map. Press enter to quit. Kiki Name found: Kiki October 8, 1970 Enter a name to look up in the map. Press enter to quit. Myla Name not found. Adapted from material by Walter Savitch

61 Adapted from material by Walter Savitch

CMSC 202. Containers

CMSC 202. Containers CMSC 202 Containers Container Definition A container is a data structure whose purpose is to hold objects. Most languages support several ways to hold objects. Arrays are compiler-supported containers.

More information

Chapter 16. The Collection Landscape. Collections, Maps and Iterators

Chapter 16. The Collection Landscape. Collections, Maps and Iterators Chapter 16 Collections, Maps and Iterators Collections A Java collection is any class that holds objects and implements the Collection interface For example, ea pe,the ArrayList class cassis a Java

More information

CMSC 202H. Containers and Iterators

CMSC 202H. Containers and Iterators CMSC 202H Containers and Iterators Container Definition A container is a data structure whose purpose is to hold objects. Most languages support several ways to hold objects Arrays are compiler-supported

More information

Module 11. Collections and Iterators. Adapted from Absolute Java, Rose Williams, Binghamton University

Module 11. Collections and Iterators. Adapted from Absolute Java, Rose Williams, Binghamton University Module 11 Collections and Iterators Adapted from Absolute Java, Rose Williams, Binghamton University Parameterized Classes and Generics Beginning with version 5.0, Java allows class and method definitions

More information

Peter Sestoft. Java Precisely. Third Edition. The MIT Press Cambridge, Massachusetts London, England

Peter Sestoft. Java Precisely. Third Edition. The MIT Press Cambridge, Massachusetts London, England Peter Sestoft Java Precisely Third Edition The MIT Press Cambridge, Massachusetts London, England Contents Preface Notational Conventions xi xii 1 Running Java: Compilation, Loading, and Execution 2 2

More information

Collections IS311. The Collections Framework. Type Trees for Collections. Java Collections Framework (ต อ)

Collections IS311. The Collections Framework. Type Trees for Collections. Java Collections Framework (ต อ) IS311 Java Collections Framework (ต อ) Collections Collections are holders that let you store and organize objects in useful ways for efficient access. In the package java.util, there are interfaces and

More information

IS311. Java Collections Framework (ต อ)

IS311. Java Collections Framework (ต อ) IS311 Java Collections Framework (ต อ) 1 Collections Collections are holders that let you store and organize objects in useful ways for efficient access. In the package java.util, there are interfaces

More information

Programming Java. The Java Class Libraries

Programming Java. The Java Class Libraries Programming The Class Libraries Incheon Paik 1 Contents The Random Class The Date Class The Calendar and GregorianCalendar Classes The Vector Class and Enumeration Interface The Stack Class The Hashtable

More information

Here is how we use an arraylist. To access the arraylist code we can import the class via:

Here is how we use an arraylist. To access the arraylist code we can import the class via: ArrayLists, Generics A data structure is a software construct used to organize our data in a particular way. Some common data structures include lists, stacks, queues, and heaps. Dynamic data structures

More information

1. Suppose you are using a HashMap<String,Integer>. What is the runtime of put and get assuming you have a reasonable hash function?

1. Suppose you are using a HashMap<String,Integer>. What is the runtime of put and get assuming you have a reasonable hash function? Data Structures Brett Bernstein Lecture 10: BitSets and Packages Exercises 1. Suppose you are using a HashMap. What is the runtime of put and get assuming you have a reasonable hash function?

More information

Lists using LinkedList

Lists using LinkedList Lists using LinkedList 1 LinkedList Apart from arrays and array lists, Java provides another class for handling lists, namely LinkedList. An instance of LinkedList is called a linked list. The constructors

More information

COMP 250. inheritance (cont.) interfaces abstract classes

COMP 250. inheritance (cont.) interfaces abstract classes COMP 250 Lecture 31 inheritance (cont.) interfaces abstract classes Nov. 20, 2017 1 https//goo.gl/forms/ymqdaeilt7vxpnzs2 2 class Object boolean equals( Object ) int hashcode( ) String tostring( ) Object

More information

Framework in Java 5. DAAD project Joint Course on OOP using Java

Framework in Java 5. DAAD project Joint Course on OOP using Java Topic XXX Collections Framework in Java 5 DAAD project Joint Course on OOP using Java Humboldt University Berlin, University of Novi Sad, Polytehnica University of Timisoara, University of Plovdiv, University

More information

Generic Programming Recursive Binary Search SESSION 9. Programming Languages for Objects

Generic Programming Recursive Binary Search SESSION 9. Programming Languages for Objects SESSION 9 Programming Languages for Objects Generic Programming Lists and Sets Maps Programming with the Java Collection Framework Writing Generic Classes and Methods Generic Programming.1.1 Recursive

More information

Programming II (CS300)

Programming II (CS300) 1 Programming II (CS300) Chapter 07: Linked Lists and Iterators MOUNA KACEM mouna@cs.wisc.edu Fall 2018 Linked Lists 2 Introduction Linked List Abstract Data Type General Implementation of the ListADT

More information

Chapter 17. Linked Data Structures. Copyright 2016 Pearson, Inc. All rights reserved.

Chapter 17. Linked Data Structures. Copyright 2016 Pearson, Inc. All rights reserved. Chapter 17 Linked Data Structures Copyright 2016 Pearson, Inc. All rights reserved. Learning Objectives Nodes and Linked Lists Creating, searching Linked List Applications Stacks, queues, sets, hash tables

More information

Programming II (CS300)

Programming II (CS300) 1 Programming II (CS300) Chapter 07: Linked Lists MOUNA KACEM mouna@cs.wisc.edu Spring 2019 Linked Lists 2 Introduction Linked List Abstract Data Type SinglyLinkedList ArrayList Keep in Mind Introduction:

More information

11/7/18 JAVA GENERICS. Java Collections. Java Collections. Using Java Collections. Proposals for adding Generics to Java.

11/7/18 JAVA GENERICS. Java Collections. Java Collections. Using Java Collections. Proposals for adding Generics to Java. JAVA GENERICS Lecture CS110 Fall 018 Photo credit: Andrew Kennedy Java Collections Early versions of Java lacked generics interface Collection { /** Return true iff the collection contains ob */ boolean

More information

Photo credit: Andrew Kennedy JAVA GENERICS

Photo credit: Andrew Kennedy JAVA GENERICS Photo credit: Andrew Kennedy JAVA GENERICS Lecture 17 CS2110 Spring 2017 Java Collections 2 Early versions of Java lacked generics interface Collection { /** Return true iff the collection contains ob

More information

CSC 1052 Algorithms & Data Structures II: Stacks

CSC 1052 Algorithms & Data Structures II: Stacks CSC 1052 Algorithms & Data Structures II: Stacks Professor Henry Carter Spring 2018 Recap Abstraction allows for information to be compartmentalized and simplifies modular use Interfaces are the Java construction

More information

Section Lists and Sets

Section Lists and Sets Section 10.2 Lists and Sets IN THE PREVIOUS SECTION, we looked at the general properties of collection classes in Java. In this section, we look at some specific collection classes and how to use them.

More information

Interfaces. Assume that we construct a general List class. public class List {

Interfaces. Assume that we construct a general List class. public class List { (November 13, 2014 Interface etc 1 ) Interfaces Assume that we construct a general List class public class List { protected static class ListNode { public Object data; public ListNode next; public ListNode()

More information

CS61B Lecture #24. Today: Java support for generic programming. Readings for today: A Java Reference, Chapter 10.

CS61B Lecture #24. Today: Java support for generic programming. Readings for today: A Java Reference, Chapter 10. CS61B Lecture #24 Today: Java support for generic programming Readings for today: A Java Reference, Chapter 10. Readings for Monday: Data Structures, 6.4. Last modified: Fri Oct 19 19:33:03 2012 CS61B:

More information

CS61B Lecture #23. Today: Java support for generic programming. Readings for today: A Java Reference, Chapter 10.

CS61B Lecture #23. Today: Java support for generic programming. Readings for today: A Java Reference, Chapter 10. CS61B Lecture #23 Announcements: Josh s office hours are now back in his office. HW6 now due Saturday. Partial solar eclipse tomorrow, starting at 1:52PM. Next one in August, 2017. See http://www.timeanddate.com/eclipse/list.html

More information

CS200: Balanced Search Trees

CS200: Balanced Search Trees Value Oriented Data Structures CS200: Balanced Search Trees Walls & Mirrors Chapters 12,13 Homework 4 extension Next week: Programming quiz during recit Midterm 2 April 8 th (in class) New partners and

More information

Outline. 1 Generic Classes. 2 Generics and Subtyping. Generics. Guy Wiener. Generic Classes. Generics and Subtyping

Outline. 1 Generic Classes. 2 Generics and Subtyping. Generics. Guy Wiener. Generic Classes. Generics and Subtyping Outline 1 2 Outline 1 2 (Parametric) classes are classes that have Parameters A generic class with a concrete type parameter is an instance of the generic class The type parameter can be the type of variables,

More information

COMP 250. Lecture 29. interfaces. Nov. 18, 2016

COMP 250. Lecture 29. interfaces. Nov. 18, 2016 COMP 250 Lecture 29 interfaces Nov. 18, 2016 1 ADT (abstract data type) ADT s specify a set of operations, and allow us to ignore implementation details. Examples: list stack queue binary search tree priority

More information

CS 2230 CS II: Data structures. Meeting 26: the Set ADT Brandon Myers University of Iowa

CS 2230 CS II: Data structures. Meeting 26: the Set ADT Brandon Myers University of Iowa CS 2230 CS II: Data structures Meeting 26: the Set ADT Brandon Myers University of Iowa Today s learning objectives Interpret code that uses the Set interface Describe how to use a Set for a simple application

More information

CSCI-142 Exam 1 Review September 25, 2016 Presented by the RIT Computer Science Community

CSCI-142 Exam 1 Review September 25, 2016 Presented by the RIT Computer Science Community CSCI-12 Exam 1 Review September 25, 2016 Presented by the RIT Computer Science Community http://csc.cs.rit.edu 1. Provide a detailed explanation of what the following code does: 1 public boolean checkstring

More information

What is the Java Collections Framework?

What is the Java Collections Framework? 1 of 13 What is the Java Collections Framework? To begin with, what is a collection?. I have a collection of comic books. In that collection, I have Tarzan comics, Phantom comics, Superman comics and several

More information

CSE 331 Software Design and Implementation. Lecture 14 Generics 2

CSE 331 Software Design and Implementation. Lecture 14 Generics 2 CSE 331 Software Design and Implementation Lecture 14 Generics 2 Zach Tatlock / Spring 2018 Big picture Last time: Generics intro Subtyping and Generics Using bounds for more flexible subtyping Using wildcards

More information

Sets and Maps. Sets Maps The Comparator Interface Sets and Maps in Java Collections API. Review for Exam Reading:

Sets and Maps. Sets Maps The Comparator Interface Sets and Maps in Java Collections API. Review for Exam Reading: Sets and Maps Sets Maps The Comparator Interface Sets and Maps in Java Collections API TreeSet TreeMap Review for Exam Reading: 13.1-13.6 Sets A set is a collection of elements with no duplicates We had

More information

CSE 331 Software Design and Implementation. Lecture 14 Generics 2

CSE 331 Software Design and Implementation. Lecture 14 Generics 2 CSE 331 Software Design and Implementation Lecture 14 Generics 2 James Wilcox / Winter 2016 Hi, I m James! Big picture Last time: Generics intro Subtyping and Generics Using bounds for more flexible subtyping

More information

The list abstract data type defined a number of operations that all list-like objects ought to implement:

The list abstract data type defined a number of operations that all list-like objects ought to implement: Chapter 7 Polymorphism Previously, we developed two data structures that implemented the list abstract data type: linked lists and array lists. However, these implementations were unsatisfying along two

More information

PIC 20A Number, Autoboxing, and Unboxing

PIC 20A Number, Autoboxing, and Unboxing PIC 20A Number, Autoboxing, and Unboxing Ernest Ryu UCLA Mathematics Last edited: October 27, 2017 Illustrative example Consider the function that can take in any object. public static void printclassandobj

More information

Test Class A. public class A { private int x, y; public int getx() { return x; } public int gety() { return y; }

Test Class A. public class A { private int x, y; public int getx() { return x; } public int gety() { return y; } Test Class A Two simple exampel classes public class A { private int x, y; public int getx() { return x; public int gety() { return y; public A( int ax, int ay ) { x = ax; y = ay; public String tostring()

More information

Java Collection Framework

Java Collection Framework Java Collection Framework Readings Purpose To provide a working knowledge of the Java Collections framework and iterators. Learning Objectives Understand the structure of the Java Collections framework

More information

Dynamic Data Structures and Generics

Dynamic Data Structures and Generics Dynamic Data Structures and Generics Reading: Savitch ch. 12 Objectives Introduce Abstract Data Types (ADTs) and review interfaces Introduce Java's ArrayList class Learn about linked lists and inner classes

More information

CSE 331 Software Design & Implementation

CSE 331 Software Design & Implementation CSE 331 Software Design & Implementation Hal Perkins Autumn 2013 Generics (Polymorphism) (Slides by Mike Ernst and David Notkin) 1 Varieties of abstraction Abstraction over computation: procedures int

More information

AP CS Unit 7: Interfaces Exercises Assume all code compiles unless otherwise suggested.

AP CS Unit 7: Interfaces Exercises Assume all code compiles unless otherwise suggested. AP CS Unit 7: Interfaces Exercises Assume all code compiles unless otherwise suggested. 1. The Nose class... b) will not compile because the m1 method parameter should be named n, not x. 2. The Ears class...

More information

CSE 331 Software Design & Implementation

CSE 331 Software Design & Implementation CSE 331 Software Design & Implementation Hal Perkins Winter 2018 Generics UW CSE 331 Winter 2018 1 Varieties of abstraction Abstraction over computation: procedures (methods) int x1, y1, x2, y2; Math.sqrt(x1*x1

More information

Principles of So3ware Construc9on: Objects, Design, and Concurrency. Designing classes

Principles of So3ware Construc9on: Objects, Design, and Concurrency. Designing classes Principles of So3ware Construc9on: Objects, Design, and Concurrency Designing classes Introduc9on to design paderns, con9nued and Parametric polymorphism (with Java generics) Josh Bloch Charlie Garrod

More information

CE204 Data Structures and Algorithms Part 2

CE204 Data Structures and Algorithms Part 2 CE204 Data Structures and Algorithms Part 2 14/01/2018 CE204 Part 2 1 Abstract Data Types 1 An abstract data type is a type that may be specified completely without the use of any programming language.

More information

Java Collections Framework: Interfaces

Java Collections Framework: Interfaces Java Collections Framework: Interfaces Introduction to the Java Collections Framework (JCF) The Comparator Interface Revisited The Collection Interface The List Interface The Iterator Interface The ListIterator

More information

Lecture Outline. Parametric Polymorphism and Java Generics. Polymorphism. Polymorphism

Lecture Outline. Parametric Polymorphism and Java Generics. Polymorphism. Polymorphism Lecture Outline Parametric Polymorphism and Java Generics Parametric polymorphism Java generics Declaring and instantiating generics Bounded types: restricting instantiations Generics and subtyping. Wildcards

More information

CS 310: Hash Table Collision Resolution

CS 310: Hash Table Collision Resolution CS 310: Hash Table Collision Resolution Chris Kauffman Week 8-1 Logistics Reading Weiss Ch 20: Hash Table Weiss Ch 6.7-8: Maps/Sets Homework HW 1 Due Saturday Discuss HW 2 next week Questions? Schedule

More information

Ausblick auf Java 8. Martin Plümicke. 25. Mai Baden-Wuerttemberg Cooperative State University Stuttgart/Horb

Ausblick auf Java 8. Martin Plümicke. 25. Mai Baden-Wuerttemberg Cooperative State University Stuttgart/Horb Ausblick auf Java 8 Martin Plümicke Baden-Wuerttemberg Cooperative State University Stuttgart/Horb 25. Mai 2012 Overview Introduction Introduction Closures Java s motivation λ expressions Functional interfaces

More information

Lecture Notes Chapter #9 Summery. Inheritance

Lecture Notes Chapter #9 Summery. Inheritance Lecture Notes Chapter #9 Summery Inheritance Subclass inherits all members of its superclass except its constructors methods inherited from a superclass can overridden in the subclass o a method overrides

More information

CS Ananda Gunawardena

CS Ananda Gunawardena CS 15-121 Ananda Gunawardena A collection (sometimes called a container) is simply an object that groups multiple elements into a single unit. Collections are used to store, retrieve and manipulate data,

More information

Lists using ArrayList

Lists using ArrayList Lists using ArrayList 1 ArrayList One of the drawbacks of arrays is that they do not make it easy to accommodate collections of arbitrary size. We have to commit ourselves to a fixed size when we introduce

More information

Java Collections Framework. 24 April 2013 OSU CSE 1

Java Collections Framework. 24 April 2013 OSU CSE 1 Java Collections Framework 24 April 2013 OSU CSE 1 Overview The Java Collections Framework (JCF) is a group of interfaces and classes similar to the OSU CSE components The similarities will become clearly

More information

10/30/2010. Introduction to Control Statements. The if and if-else Statements (cont.) Principal forms: JAVA CONTROL STATEMENTS SELECTION STATEMENTS

10/30/2010. Introduction to Control Statements. The if and if-else Statements (cont.) Principal forms: JAVA CONTROL STATEMENTS SELECTION STATEMENTS JAVA CONTROL STATEMENTS Introduction to Control statements are used in programming languages to cause the flow of control to advance and branch based on changes to the state of a program. In Java, control

More information

AP CS Unit 7: Interfaces Exercises 1. Select the TRUE statement(s).

AP CS Unit 7: Interfaces Exercises 1. Select the TRUE statement(s). AP CS Unit 7: Interfaces Exercises 1. Select the TRUE statement(s). a) This code will not compile because a method cannot specify an interface as a parameter. public class Testing { public static void

More information

CIS 110 Introduction to Computer Programming Spring 2016 Final Exam

CIS 110 Introduction to Computer Programming Spring 2016 Final Exam CIS 110 Introduction to Computer Programming Spring 2016 Final Exam Name: Recitation # (e.g., 201): Pennkey (e.g., eeaton): My signature below certifies that I have complied with the University of Pennsylvania

More information

Improving Type Error Messages for Generic Java

Improving Type Error Messages for Generic Java Higher-Order and Symbolic Computation manuscript No. (will be inserted by the editor) Improving Type Error Messages for Generic Java Nabil el Boustani Jurriaan Hage Received: date / Accepted: date Abstract

More information

Parametric polymorphism and Generics

Parametric polymorphism and Generics Parametric polymorphism and Generics Today s Lecture Outline Parametric polymorphism Java generics Declaring and instantiating generics Bounded types: restricting instantiations Generics and subtyping.

More information

Day 6. COMP1006/1406 Summer M. Jason Hinek Carleton University

Day 6. COMP1006/1406 Summer M. Jason Hinek Carleton University Day 6 COMP1006/1406 Summer 2016 M. Jason Hinek Carleton University today s agenda assignments Assignment 3 is due on Monday a quick look back abstract classes and interfaces casting objects abstract data

More information

Java for Python Programmers. Comparison of Python and Java Constructs Reading: L&C, App B

Java for Python Programmers. Comparison of Python and Java Constructs Reading: L&C, App B Java for Python Programmers Comparison of Python and Java Constructs Reading: L&C, App B 1 General Formatting Shebang #!/usr/bin/env python Comments # comments for human readers - not code statement #

More information

Why Use Generics? Generic types Generic methods Bounded type parameters Generics, Inheritance, and Subtypes Wildcard types

Why Use Generics? Generic types Generic methods Bounded type parameters Generics, Inheritance, and Subtypes Wildcard types Why Use Generics? Generic types Generic methods Bounded type parameters Generics, Inheritance, and Subtypes Wildcard types generics enable types (classes and interfaces) to be parameters when defining

More information

Tables and Priority Queues

Tables and Priority Queues Chapter 12 Tables and Priority Queues 2011 Pearson Addison-Wesley. All rights reserved 12 A-1 The ADT Table The ADT table, or dictionary Uses a search key to identify its items Its items are records that

More information

CS 310: Hash Table Collision Resolution Strategies

CS 310: Hash Table Collision Resolution Strategies CS 310: Hash Table Collision Resolution Strategies Chris Kauffman Week 7-1 Logistics HW 2 Due Wednesday night Test Cases Final Questions for group discussion? Goals Today Midterm Exam Next Monday Review

More information

Tables and Priority Queues!

Tables and Priority Queues! Chapter 12! Tables and Priority Queues! 2011 Pearson Addison-Wesley. All rights reserved 12 A-1 2015-11-30 21:52:31 1/49 Chapter-12.pdf (#14) The ADT Table The ADT table, or dictionary! Uses a search key

More information

Overview of Java ArrayList, HashTable, HashMap, Hashet,LinkedList

Overview of Java ArrayList, HashTable, HashMap, Hashet,LinkedList Overview of Java ArrayList, HashTable, HashMap, Hashet,LinkedList This article discusses the main classes of Java Collection API. The following figure demonstrates the Java Collection framework. Figure

More information

Announcements. Lecture 15 Generics 2. Announcements. Big picture. CSE 331 Software Design and Implementation

Announcements. Lecture 15 Generics 2. Announcements. Big picture. CSE 331 Software Design and Implementation CSE 331 Software Design and Implementation Lecture 15 Generics 2 Announcements Leah Perlmutter / Summer 2018 Announcements Quiz 5 is due tomorrow Homework 6 due tomorrow Section tomorrow! Subtyping now

More information

CSE 331 Software Design and Implementation. Lecture 15 Generics 2

CSE 331 Software Design and Implementation. Lecture 15 Generics 2 CSE 331 Software Design and Implementation Lecture 15 Generics 2 Leah Perlmutter / Summer 2018 Announcements Announcements Quiz 5 is due tomorrow Homework 6 due tomorrow Section tomorrow! Subtyping now

More information

Programming Problems 22nd Annual Computer Science Programming Contest

Programming Problems 22nd Annual Computer Science Programming Contest Programming Problems 22nd Annual Computer Science Programming Contest Department of Mathematics and Computer Science Western Carolina University 5 April 2011 Problem One: Add Times Represent a time by

More information

חומר עזר לבחינה מבוא למדעי המחשב

חומר עזר לבחינה מבוא למדעי המחשב שיטות במחלקה Object // Indicates whether some other object is "equal to" // this one. boolean equals(object other) // Returns a string representation of the object. String tostring() // Returns the length

More information

Lecture 6 Collections

Lecture 6 Collections Lecture 6 Collections Concept A collection is a data structure actually, an object to hold other objects, which let you store and organize objects in useful ways for efficient access Check out the java.util

More information

CS61B Lecture #25: Java Generics. Last modified: Thu Oct 19 19:36: CS61B: Lecture #25 1

CS61B Lecture #25: Java Generics. Last modified: Thu Oct 19 19:36: CS61B: Lecture #25 1 CS61B Lecture #25: Java Generics Last modified: Thu Oct 19 19:36:29 2017 CS61B: Lecture #25 1 The Old Days Java library types such as List didn t used to be parameterized. All Lists were lists of Objects.

More information

Principles of Software Construction: Objects, Design, and Concurrency. Part 1: Design for reuse. Design patterns for reuse

Principles of Software Construction: Objects, Design, and Concurrency. Part 1: Design for reuse. Design patterns for reuse Principles of Software Construction: Objects, Design, and Concurrency Part 1: Design for reuse Design patterns for reuse Charlie Garrod Bogdan Vasilescu School of Computer Science 1 Administrivia Homework

More information

Unified Modeling Language 2

Unified Modeling Language 2 Unified Modeling Language 2 Profiles 166 Usage scenarios Metamodel customization for adapting terminology to a specific platform or domain adding (visual) notation adding and specializing semantics adding

More information

CS61B Lecture #25: Java Generics. Last modified: Thu Oct 18 21:04: CS61B: Lecture #25 1

CS61B Lecture #25: Java Generics. Last modified: Thu Oct 18 21:04: CS61B: Lecture #25 1 CS61B Lecture #25: Java Generics Last modified: Thu Oct 18 21:04:53 2018 CS61B: Lecture #25 1 The Old Days Java library types such as List didn t used to be parameterized. All Lists were lists of Objects.

More information

CS 132 Midterm Exam Fall 2004

CS 132 Midterm Exam Fall 2004 Date:1-Nov-2004 Time:7:00-9:00p.m. Permitted Aids:None CS 132 Midterm Exam Fall 2004 Please complete this page in ink. Last Name: Signature: First Name: ID: Please check off your Practicum Section: Dana

More information

Converting Collections to Arrays. A Bad Approach to Array Conversion. A Better Approach to Array Conversion. public Object[] toarray();

Converting Collections to Arrays. A Bad Approach to Array Conversion. A Better Approach to Array Conversion. public Object[] toarray(); Converting Collections to Arrays Every Java collection can be converted to an array This is part of the basic Collection interface The most elementary form of this method produces an array of base-type

More information

Collections Framework: Part 2

Collections Framework: Part 2 Collections Framework: Part 2 Computer Science and Engineering College of Engineering The Ohio State University Lecture 18 Collection Implementations Java SDK provides several implementations of Collection

More information

Josh Bloch Charlie Garrod Darya Melicher

Josh Bloch Charlie Garrod Darya Melicher Principles of So3ware Construc9on: Objects, Design, and Concurrency Part 2: Class-level design Design paderns for reuse, part 2 Josh Bloch Charlie Garrod Darya Melicher 1 Administrivia Reading due today:

More information

Charlie Garrod Michael Hilton

Charlie Garrod Michael Hilton Principles of So3ware Construc9on: Objects, Design, and Concurrency Part 1: Designing classes Design pacerns for reuse (con9nued) and design heuris9cs Charlie Garrod Michael Hilton School of Computer Science

More information

CSE 331 Software Design & Implementation

CSE 331 Software Design & Implementation CSE 331 Software Design & Implementation Kevin Zatloukal Summer 2017 Generics (Based on slides by Mike Ernst, Dan Grossman, David Notkin, Hal Perkins, Zach Tatlock) Preface This lecture will get into the

More information

Strings and Arrays. Hendrik Speleers

Strings and Arrays. Hendrik Speleers Hendrik Speleers Overview Characters and strings String manipulation Formatting output Arrays One-dimensional Two-dimensional Container classes List: ArrayList and LinkedList Iterating over a list Characters

More information

Exercise 8 Parametric polymorphism November 17, 2017

Exercise 8 Parametric polymorphism November 17, 2017 Concepts of Object-Oriented Programming AS 2017 Exercise 8 Parametric polymorphism November 17, 2017 Task 1 Implement a list in Java or C# with two methods: public void add(int i, Object el) public Object

More information

CS 310: Maps and Sets

CS 310: Maps and Sets CS 310: Maps and Sets Chris Kauffman Week 9-1 Logistics Goals Today HW2 Discussion Maps and Sets HW2 Discussion Milestones due Thu 7/6 Discuss AdditiveList Iterator Implementation O(1) Undo/Redo Reading

More information

Assertions, pre/postconditions

Assertions, pre/postconditions Programming as a contract Assertions, pre/postconditions Assertions: Section 4.2 in Savitch (p. 239) Specifying what each method does q Specify it in a comment before method's header Precondition q What

More information

Midterm Exam 2 CS 455, Spring 2014

Midterm Exam 2 CS 455, Spring 2014 Name: USC loginid (e.g., ttrojan): Midterm Exam 2 CS 455, Spring 2014 Monday, April 7, 2014 There are 6 problems on the exam, with 58 points total available. There are 7 pages to the exam, including this

More information

About This Lecture. Repetition Control Structures - while. Outline. Repetition

About This Lecture. Repetition Control Structures - while. Outline. Repetition 2 About This Lecture Repetition Control Structures - while Cmput 114 - Lecture 16 Department of Computing Science University of Alberta z So far our programs execute each statement exactly once or zero

More information

Topic 10: The Java Collections Framework (and Iterators)

Topic 10: The Java Collections Framework (and Iterators) Topic 10: The Java Collections Framework (and Iterators) A set of interfaces and classes to help manage collections of data. Why study the Collections Framework? very useful in many different kinds of

More information

Fall 2017 Mentoring 7: October 9, Abstract Data Types

Fall 2017 Mentoring 7: October 9, Abstract Data Types CSM 61B Sequences & ADTs Fall 2017 Mentoring 7: October 9, 2017 1 Abstract Data Types A list is an ordered sequence of items: like an array, but without worrying about the length or size. interface List

More information

Predicate Abstraction of Java Programs with Collections. Pavel Parízek, Ondřej Lhoták

Predicate Abstraction of Java Programs with Collections. Pavel Parízek, Ondřej Lhoták Predicate Abstraction of Java Programs with Collections Pavel Parízek, Ondřej Lhoták Predicate abstraction void main() { int i = 0; int x = 1; while (i < 1) { x += i; i++; assert(x > 0); Predicates P_xle0:

More information

Programming Languages and Techniques (CIS120)

Programming Languages and Techniques (CIS120) Programming Languages and Techniques (CIS120) Lecture 27 March 23 rd, 2016 Generics and Collections Chapter 25 HW #6 due Tuesday Announcements I will be away all next week (FP workshop in Germany) Monday's

More information

CMPSCI 187: Programming With Data Structures. Lecture #11: Implementing Stacks With Arrays David Mix Barrington 28 September 2012

CMPSCI 187: Programming With Data Structures. Lecture #11: Implementing Stacks With Arrays David Mix Barrington 28 September 2012 CMPSCI 187: Programming With Data Structures Lecture #11: Implementing Stacks With Arrays David Mix Barrington 28 September 2012 Implementing Stacks With Arrays The Idea of the Implementation Data Fields

More information

About This Lecture. Repetition Control Structures - while. Repetition. Outline. Semantics - while. Java Syntax: while Statement

About This Lecture. Repetition Control Structures - while. Repetition. Outline. Semantics - while. Java Syntax: while Statement 2 About This Lecture Repetition Control Structures - while Cmput 114 - Lecture 16 Department of Computing Science University of Alberta z So far our programs execute each statement exactly once or zero

More information

301AA - Advanced Programming [AP-2017]

301AA - Advanced Programming [AP-2017] 301AA - Advanced Programming [AP-2017] Lecturer: Andrea Corradini andrea@di.unipi.it Tutor: Lillo GalleBa galleba@di.unipi.it Department of Computer Science, Pisa Academic Year 2017/18 AP-2018-15: Java

More information

11. Collections of Objects

11. Collections of Objects 11. Collections of Objects 1 Arrays There are three issues that distinguish arrays from other types of containers: efficiency, type, and the ability to hold primitives. When you re solving a more general

More information

Arrays. Chapter Arrays What is an Array?

Arrays. Chapter Arrays What is an Array? Chapter 8 Arrays 81 Arrays 811 What is an Array? To motivate why we might be interested in using arrays, let us implement an app that creates a collection of doubles We will keep track of the number of

More information

Abstract Data Types (ADTs) Example ADTs. Using an Abstract Data Type. Class #08: Linear Data Structures

Abstract Data Types (ADTs) Example ADTs. Using an Abstract Data Type. Class #08: Linear Data Structures Abstract Data Types (ADTs) Class #08: Linear Data Structures Software Design III (CS 340): M. Allen, 08 Feb. 16 An ADT defines a kind of computational entity: A set of objects, with possible values A set

More information

What is an Iterator? An iterator is an abstract data type that allows us to iterate through the elements of a collection one by one

What is an Iterator? An iterator is an abstract data type that allows us to iterate through the elements of a collection one by one Iterators What is an Iterator? An iterator is an abstract data type that allows us to iterate through the elements of a collection one by one 9-2 2-2 What is an Iterator? An iterator is an abstract data

More information

ALGORITHM ANALYSIS. cs2420 Introduction to Algorithms and Data Structures Spring 2015

ALGORITHM ANALYSIS. cs2420 Introduction to Algorithms and Data Structures Spring 2015 ALGORITHM ANALYSIS cs2420 Introduction to Algorithms and Data Structures Spring 2015 1 administrivia 2 -assignment 2 is due Friday at midnight -note change in due date, and time -tutoring experiment http://doodle.com/89cbb4u5n5acy9ag

More information

301AA - Advanced Programming [AP-2017]

301AA - Advanced Programming [AP-2017] 301AA - Advanced Programming [AP-2017] Lecturer: Andrea Corradini andrea@di.unipi.it Tutor: Lillo GalleBa galleba@di.unipi.it Department of Computer Science, Pisa Academic Year 2017/18 AP-2017-14: Java

More information

Full file at

Full file at Chapter 3 Flow of Control Multiple Choice 1) An if selection statement executes if and only if: (a) the Boolean condition evaluates to false. (b) the Boolean condition evaluates to true. (c) the Boolean

More information

Computational Expression

Computational Expression Computational Expression Variables, Primitive Data Types, Expressions Janyl Jumadinova 28-30 January, 2019 Janyl Jumadinova Computational Expression 28-30 January, 2019 1 / 17 Variables Variable is a name

More information

Iterator and For-Each Loops COMP110 - Lecture 18

Iterator and For-Each Loops COMP110 - Lecture 18 Iterator and For-Each Loops COMP110 - Lecture 18 Announcements PS3 - Paternity Test is out! Game of Thrones: Spoilers vs. No Spoilers Due Sunday at 11:59pm 400 Points - Get started early! Whiteboard Hours

More information