Module 11. Collections and Iterators. Adapted from Absolute Java, Rose Williams, Binghamton University
|
|
|
- Elinor Atkins
- 6 years ago
- Views:
Transcription
1 Module 11 Collections and Iterators Adapted from Absolute Java, Rose Williams, Binghamton University
2 Parameterized Classes and Generics Beginning with version 5.0, Java allows class and method definitions that include parameters for types Such definitions are called generics Generic programming with a type parameter enables code to be written that applies to any class These classes that have type parameters are called parameterized class or generic definitions, or, simply, generics Collection is a parameterized interface It has a parameter, denoted by Base_Type, that can be replaced by any reference type. Java-11-2
3 Parameterized Classes and Generics A type parameter can have any reference type (i.e., any class type) plugged in for the type parameter When a specific type is plugged in, this produces a specific class type or method Traditionally, a single uppercase letter is used for a type parameter, but any non-keyword identifier may be used The ArrayList and Vector classes discussed here have a type parameter for the base type For example, the type parameter of ArrayList can be replaced by any reference type to obtain a class for ArrayLists with the specified base type There are also ArrayList and Vector classes with no parameter whose base type is Object These classes are left over from earlier versions of Java Java-11-3
4 Collections A Java collection is any class that holds objects and implements the Collection interface For example, the ArrayList<T> class is a Java collection class, and implements all the methods in the Collection interface Collections are used along with iterators The Collection interface is the highest level of Java's framework for collection classes All of the collection classes discussed here can be found in package java.util Java-11-4
5 The Collection Landscape Java-11-5
6 Optional Operations When an interface lists a method as "optional," it must still be implemented in a class that implements the interface The optional part means that it is permitted to write a method that does not completely implement its intended semantics However, if a trivial implementation is given, then the method body should throw an UnsupportedOperationException Java-11-6
7 Wildcards Classes and interfaces in the collection framework can have parameter type specifications that do not fully specify the type plugged in for the type parameter Because they specify a wide range of argument types, they are known as wildcards public void method(string arg1, ArrayList<?> arg2) In the above example, the first argument is of type String, while the second argument can be an ArrayList<T> with any base type Java-11-7
8 Wildcards A bound can be placed on a wildcard specifying that the type used must be an ancestor type or descendent type of some class or interface The notation <? extends String> specifies that the argument plugged in be an object of any descendent class of String The notation <? super String> specifies that the argument plugged in be an object of any ancestor class of String Java-11-8
9 The Collection Framework The Collection<T> interface describes the basic operations that all collection classes should implement The method headings for these operations are shown on the next several slides Since an interface is a type, any method can be defined with a parameter of type Collection<T> That parameter can be filled with an argument that is an object of any class in the collection framework Java-11-9
10 Method Headings in the Collection<T> Interface (1/10) Java-11-10
11 Method Headings in the Collection<T> Interface (2/10) Java-11-11
12 Method Headings in the Collection<T> Interface (3/10) Java-11-12
13 Method Headings in the Collection<T> Interface (4/10) Java-11-13
14 Method Headings in the Collection<T> Interface (5/10) Java-11-14
15 Method Headings in the Collection<T> Interface (6/10) Java-11-15
16 Method Headings in the Collection<T> Interface (7/10) Java-11-16
17 Method Headings in the Collection<T> Interface (8/10) Java-11-17
18 Method Headings in the Collection<T> Interface (9/10) Java-11-18
19 Method Headings in the Collection<T> Interface (10/10) Java-11-19
20 Collection Relationships There is a number of different predefined classes that implement the Collection<T> interface Programmer defined classes can implement it also A method written to manipulate a parameter of type Collection<T> will work for all of these classes, either singly or intermixed There are two main interfaces that extend the Collection<T> interface: The Set<T> interface and the List<T> interface Java-11-20
21 Collection Relationships Classes that implement the Set<T> interface do not allow an element in the class to occur more than once The Set<T> interface has the same method headings as the Collection<T> interface, but in some cases the semantics (intended meanings) are different Methods that are optional in the Collection<T> interface are required in the Set<T> interface Java-11-21
22 Collection Relationships Classes that implement the List<T> interface have their elements ordered as on a list Elements are indexed starting with zero A class that implements the List<T> interface allows elements to occur more than once The List<T> interface has more method headings than the Collection<T> interface Some of the methods inherited from the Collection<T> interface have different semantics in the List<T> interface The ArrayList<T> class implements the List<T> interface Java-11-22
23 Methods in the Set<T> Interface (1/10) Java-11-23
24 Methods in the Set<T> Interface (2/10) Java-11-24
25 Methods in the Set<T> Interface (3/10) Java-11-25
26 Methods in the Set<T> Interface (4/10) Java-11-26
27 Methods in the Set<T> Interface (5/10) Java-11-27
28 Methods in the Set<T> Interface (6/10) Java-11-28
29 Methods in the Set<T> Interface (7/10) Java-11-29
30 Methods in the Set<T> Interface (8/10) Java-11-30
31 Methods in the Set<T> Interface (9/10) Java-11-31
32 Methods in the Set<T> Interface (10/10) Java-11-32
33 Methods in the List<T> Interface (1/16) Java-11-33
34 Methods in the List<T> Interface (2/16) Java-11-34
35 Methods in the List<T> Interface (3/16) Java-11-35
36 Methods in the List<T> Interface (4/16) Java-11-36
37 Methods in the List<T> Interface (5/16) Java-11-37
38 Methods in the List<T> Interface (6/16) Java-11-38
39 Methods in the List<T> Interface (7/16) Java-11-39
40 Methods in the List<T> Interface (8/16) Java-11-40
41 Methods in the List<T> Interface (9/16) Java-11-41
42 Methods in the List<T> Interface (10/16) Java-11-42
43 Methods in the List<T> Interface (11/16) Java-11-43
44 Methods in the List<T> Interface (12/16) Java-11-44
45 Methods in the List<T> Interface (13/16) Java-11-45
46 Methods in the List<T> Interface (14/16) Java-11-46
47 Methods in the List<T> Interface (15/16) Java-11-47
48 Methods in the List<T> Interface (16/16) Java-11-48
49 Dealing with All Those Exceptions The tables of methods for the various collection interfaces and classes indicate that certain exceptions are thrown These are unchecked exceptions, so they are useful for debugging, but need not be declared or caught In an existing collection class, they can be viewed as run-time error messages In a derived class of some other collection class, most or all of them will be inherited In a collection class defined from scratch, if it is to implement a collection interface, then it should throw the exceptions that are specified in the interface Java-11-49
50 Concrete Collections Classes The concrete class HashSet<T> implements the Set<T> interface, and can be used if additional methods are not needed The HashSet<T> class implements all the methods in the Set<T> interface, and adds only constructors The HashSet<T> class is implemented using a hash table The ArrayList<T> and Vector<T> classes implement the List<T> interface, and can be used if additional methods are not needed Both the ArrayList<T> and Vector<T> interfaces implement all the methods in the interface List<T> Either class can be used when a List<T> with efficient random access to elements is needed Java-11-50
51 Concrete Collections Classes The concrete class LinkedList<T> is a concrete derived class of the abstract class AbstractSequentialList<T> When efficient sequential movement through a list is needed, the LinkedList<T> class should be used The interface SortedSet<T> and the concrete class TreeSet<T> are designed for implementations of the Set<T> interface that provide for rapid retrieval of elements The implementation of the class is similar to a binary tree, but with ways to do inserting that keep the tree balanced Java-11-51
52 Methods in the Classes ArrayList<T> and Vector<T> (1/15) Java-11-52
53 Methods in the Classes ArrayList<T> and Vector<T> (2/15) Java-11-53
54 Methods in the Classes ArrayList<T> and Vector<T> (3/15) Java-11-54
55 Methods in the Classes ArrayList<T> and Vector<T> (4/15) Java-11-55
56 Methods in the Classes ArrayList<T> and Vector<T> (5/15) Java-11-56
57 Methods in the Classes ArrayList<T> and Vector<T> (6/15) Java-11-57
58 Methods in the Classes ArrayList<T> and Vector<T> (7/15) Java-11-58
59 Methods in the Classes ArrayList<T> and Vector<T> (8/15) Java-11-59
60 Methods in the Classes ArrayList<T> and Vector<T> (9/15) Java-11-60
61 Methods in the Classes ArrayList<T> and Vector<T> (10/15) Java-11-61
62 Methods in the Classes ArrayList<T> and Vector<T> (11/15) Java-11-62
63 Methods in the Classes ArrayList<T> and Vector<T> (12/15) Java-11-63
64 Methods in the Classes ArrayList<T> and Vector<T> (13/15) Java-11-64
65 Methods in the Classes ArrayList<T> and Vector<T> (14/15) Java-11-65
66 Methods in the Classes ArrayList<T> and Vector<T> (15/15) Java-11-66
67 Differences Between ArrayList<T> and Vector<T> For most purposes, the ArrayList<T> and Vector<T> are equivalent The Vector<T> class is older, and had to be retrofitted with extra method names to make it fit into the collection framework The ArrayList<T> class is newer, and was created as part of the Java collection framework The ArrayList<T> class is supposedly more efficient than the Vector<T> class also Java-11-67
68 Omitting the <T> When the <T> or corresponding class name is omitted from a reference to a collection class, this is an error for which the compiler may or may not issue an error message (depending on the details of the code), and even if it does, the error message may be quite strange Look for a missing <T> or <ClassName> when a program that uses collection classes gets a strange error message or doesn't run correctly Java-11-68
69 A Peek at the Map Framework The Java map framework deals with collections of ordered pairs For example, a key and an associated value Objects in the map framework can implement mathematical functions and relations, so can be used to construct database classes The map framework uses the Map<T> interface, the AbstractMap<T> class, and classes derived from the AbstractMap<T> class Java-11-69
70 Iterators An iterator is an object that is used with a collection to provide sequential access to the collection elements This access allows examination and possible modification of the elements An iterator imposes an ordering on the elements of a collection even if the collection itself does not impose any order on the elements it contains If the collection does impose an ordering on its elements, then the iterator will use the same ordering Java-11-70
71 The Iterator<T> Interface Java provides an Iterator<T> interface Any object of any class that satisfies the Iterator<T> interface is an Iterator<T> An Iterator<T> does not stand on its own It must be associated with some collection object using the method iterator If c is an instance of a collection class (e.g., ArrayList<String>), the following obtains an iterator for c: Iterator iteratorforc = c.iterator(); Java-11-71
72 Methods in the Iterator<T> Interface (1 of 2) Java-11-72
73 Methods in the Iterator<T> Interface (2 of 2) Java-11-73
74 Using an Iterator with a HashSet<T> Object A HashSet<T> object imposes no order on the elements it contains However, an iterator will impose an order on the elements in the hash set That is, the order in which they are produced by next() Although the order of the elements so produced may be duplicated for each program run, there is no requirement that this must be the case Java-11-74
75 An Iterator (1 of 3) Java-11-75
76 An Iterator (2 of 3) Java-11-76
77 An Iterator (3 of 3) Java-11-77
78 For-Each Loops as Iterators Although it is not an iterator, a for-each loop can serve the same purpose as an iterator A for-each loop can be used to cycle through each element in a collection For-each loops can be used with any of the collections discussed here Java-11-78
79 For-Each Loops as Iterators (1/2) Java-11-79
80 For-Each Loops as Iterators (2/2) Java-11-80
81 The ListIterator<T> Interface The ListIterator<T> interface extends the Iterator<T> interface, and is designed to work with collections that satisfy the List<T> interface A ListIterator<T> has all the methods that an Iterator<T> has, plus additional methods A ListIterator<T> can move in either direction along a list of elements A ListIterator<T> has methods, such as set and add, that can be used to modify elements Java-11-81
82 Methods in the ListIterator<T> Interface (1 of 4) Java-11-82
83 Methods in the ListIterator<T> Interface (2 of 4) Java-11-83
84 Methods in the ListIterator<T> Interface (3 of 4) Java-11-84
85 Methods in the ListIterator<T> Interface (4 of 4) Java-11-85
86 The ListIterator<T> Cursor Every ListIterator<T> has a position marker known as the cursor If the list has n elements, they are numbered by indices 0 through n-1, but there are n+1 cursor positions When next() is invoked, the element immediately following the cursor position is returned and the cursor is moved forward one cursor position When previous() is invoked, the element immediately before the cursor position is returned and the cursor is moved back one cursor position Java-11-86
87 ListIterator<T> Cursor Positions Java-11-87
88 next and previous Can Return a Reference Theoretically, when an iterator operation returns an element of the collection, it might return a copy or clone of the element, or it might return a reference to the element Iterators for the standard predefined collection classes, such as ArrayList<T> and HashSet<T>, actually return references Therefore, modifying the returned value will modify the element in the collection Java-11-88
89 An Iterator Returns a Reference (1/4) Java-11-89
90 An Iterator Returns a Reference (2/4) Java-11-90
91 An Iterator Returns a Reference (3/4) Java-11-91
92 An Iterator Returns a Reference (4/4) Java-11-92
93 Defining Your Own Iterator Classes There is usually little need for a programmer defined Iterator<T> or ListIterator<T> class The easiest and most common way to define a collection class is to make it a derived class of one of the library collection classes By doing this, the iterator() and listiterator() methods automatically become available to the program If a collection class must be defined in some other way, then an iterator class should be defined as an inner class of the collection class Java-11-93
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
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.
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
Collection ArrayList<T> Collection Collection
Collection ArrayList Collection Collection Adapted from material by Walter Savitch Adapted from material by Walter Savitch public void method(string arg1, ArrayList arg2) String ArrayList Adapted
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
Copyright 2007 Pearson Addison-Wesley Copyright 2018 Aiman Hanna All rights reserved
Comp 249 Programming Methodology Chapter 13 Generics & The ArrayList Class Dr. Aiman Hanna Department of Computer Science & Software Engineering Concordia University, Montreal, Canada These slides has
Copyright 2007 Pearson Addison-Wesley Copyright 2019 Aiman Hanna All rights reserved
Comp 249 Programming Methodology Chapter 15 Linked Data Structure Part A Dr. Aiman Hanna Department of Computer Science & Software Engineering Concordia University, Montreal, Canada These slides has been
Introduction to Linked Lists
Introduction to Linked Lists In your previous programming course, you organized and processed data items sequentially using an array (or possibly an arraylist, or a vector). You probably performed several
Comp 249 Programming Methodology Chapter 8 - Polymorphism
Comp 249 Programming Methodology Chapter 8 - Polymorphism Dr. Aiman Hanna Department of Computer Science & Software Engineering Concordia University, Montreal, Canada These slides has been extracted, modified
Comp 249 Programming Methodology Chapter 9 Exception Handling
Comp 249 Programming Methodology Chapter 9 Exception Handling Dr. Aiman Hanna Department of Computer Science & Software Engineering Concordia University, Montreal, Canada These slides has been extracted,
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
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
Collections and Iterators. Collections
Collections and Iterators Based on the notes from David Fernandez-Baca and Steve Kautz Based on The Java Tutorial (http://docs.oracle.com/javase/tutorial/java/) Bryn Mawr College CS206 Intro to Data Structures
CMSC 132: Object-Oriented Programming II
CMSC 132: Object-Oriented Programming II Java Support for OOP Department of Computer Science University of Maryland, College Park Object Oriented Programming (OOP) OO Principles Abstraction Encapsulation
Comp 249 Programming Methodology
Comp 249 Programming Methodology Chapter 7 - Inheritance Part A Dr. Aiman Hanna Department of Computer Science & Software Engineering Concordia University, Montreal, Canada These slides has been extracted,
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
CS 221 Review. Mason Vail
CS 221 Review Mason Vail Inheritance (1) Every class - except the Object class - directly inherits from one parent class. Object is the only class with no parent. If a class does not declare a parent using
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
Collections, Maps and Generics
Collections API Collections, Maps and Generics You've already used ArrayList for exercises from the previous semester, but ArrayList is just one part of much larger Collections API that Java provides.
IBS Software Services Technical Interview Questions. Q1. What is the difference between declaration and definition?
IBS Software Services Technical Interview Questions Q1. What is the difference between declaration and definition? The declaration tells the compiler that at some later point we plan to present the definition
Generalized Code. Fall 2011 (Honors) 2
CMSC 202H Generics Generalized Code One goal of OOP is to provide the ability to write reusable, generalized code. Polymorphic code using base classes is general, but restricted to a single class hierarchy
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?
Class, Variable, Constructor, Object, Method Questions
Class, Variable, Constructor, Object, Method Questions http://www.wideskills.com/java-interview-questions/java-classes-andobjects-interview-questions https://www.careerride.com/java-objects-classes-methods.aspx
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,
Introduction to Generics. Defining a Class with a Type Parameter
Introduction to Generics Beginning with version 5.0, Java allows class and method definitions that include parameters for types Such definitions are called generics Generic programming with a type parameter
This page intentionally left blank
This page intentionally left blank Absolute Java, Global Edition Table of Contents Cover Title Page Copyright Page Preface Acknowledgments Brief Contents Contents Chapter 1 Getting Started 1.1 INTRODUCTION
Goal. Generic Programming and Inner classes. Minor rewrite of linear search. Obvious linear search code. Intuitive idea of generic linear search
Goal Generic Programming and Inner classes First version of linear search Input was array of int More generic version of linear search Input was array of Comparable Can we write a still more generic version
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.
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
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
Java Inheritance. Written by John Bell for CS 342, Spring Based on chapter 6 of Learning Java by Niemeyer & Leuck, and other sources.
Java Inheritance Written by John Bell for CS 342, Spring 2018 Based on chapter 6 of Learning Java by Niemeyer & Leuck, and other sources. Review Which of the following is true? A. Java classes may either
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
CS506 Web Design & Development Final Term Solved MCQs with Reference
with Reference I am student in MCS (Virtual University of Pakistan). All the MCQs are solved by me. I followed the Moaaz pattern in Writing and Layout this document. Because many students are familiar
Inheritance and Interfaces
Inheritance and Interfaces Object Orientated Programming in Java Benjamin Kenwright Outline Review What is Inheritance? Why we need Inheritance? Syntax, Formatting,.. What is an Interface? Today s Practical
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
Java 5 New Language Features
Java 5 New Language Features Ing. Jeroen Boydens, BLIN prof dr. ir. Eric Steegmans http://users.khbo.be/peuteman/java5/ Enterprise Programming Last session. Jeroen Boydens 1. JDK v1.4: assert 2. Generics
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
Pace University. Fundamental Concepts of CS121 1
Pace University Fundamental Concepts of CS121 1 Dr. Lixin Tao http://csis.pace.edu/~lixin Computer Science Department Pace University October 12, 2005 This document complements my tutorial Introduction
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
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
DOWNLOAD PDF CORE JAVA APTITUDE QUESTIONS AND ANSWERS
Chapter 1 : Chapter-wise Java Multiple Choice Questions and Answers Interview MCQs Java Programming questions and answers with explanation for interview, competitive examination and entrance test. Fully
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:
CS 445: Data Structures Final Examination: Study Guide
CS 445: Data Structures Final Examination: Study Guide Java prerequisites Classes, objects, and references Access modifiers Arguments and parameters Garbage collection Self-test questions: Appendix C Designing
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
Java How to Program, 10/e. Copyright by Pearson Education, Inc. All Rights Reserved.
Java How to Program, 10/e Copyright 1992-2015 by Pearson Education, Inc. All Rights Reserved. Data structures Collections of related data items. Discussed in depth in Chapters 16 21. Array objects Data
5/24/12. Introduction to Polymorphism. Chapter 8. Late Binding. Introduction to Polymorphism. Late Binding. Polymorphism and Abstract Classes
Introduction to Polymorphism Chapter 8 Polymorphism and Abstract Classes Slides prepared by Rose Williams, Binghamton University There are three main programming mechanisms that constitute object-oriented
Weiss Chapter 1 terminology (parenthesized numbers are page numbers)
Weiss Chapter 1 terminology (parenthesized numbers are page numbers) assignment operators In Java, used to alter the value of a variable. These operators include =, +=, -=, *=, and /=. (9) autoincrement
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
Agenda. Objects and classes Encapsulation and information hiding Documentation Packages
Preliminaries II 1 Agenda Objects and classes Encapsulation and information hiding Documentation Packages Inheritance Polymorphism Implementation of inheritance in Java Abstract classes Interfaces Generics
Java for Non Majors. Final Study Guide. April 26, You will have an opportunity to earn 20 extra credit points.
Java for Non Majors Final Study Guide April 26, 2017 The test consists of 1. Multiple choice questions 2. Given code, find the output 3. Code writing questions 4. Code debugging question 5. Short answer
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
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.
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
Java Collections. Readings and References. Collections Framework. Java 2 Collections. CSE 403, Spring 2004 Software Engineering
Readings and References Java Collections "Collections", Java tutorial http://java.sun.com/docs/books/tutorial/collections/index.html CSE 403, Spring 2004 Software Engineering http://www.cs.washington.edu/education/courses/403/04sp/
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
Marcin Luckner Warsaw University of Technology Faculty of Mathematics and Information Science
Marcin Luckner Warsaw University of Technology Faculty of Mathematics and Information Science mluckner@mini.pw.edu.pl http://www.mini.pw.edu.pl/~lucknerm } Annotations do not directly affect program semantics.
AP COMPUTER SCIENCE JAVA CONCEPTS IV: RESERVED WORDS
AP COMPUTER SCIENCE JAVA CONCEPTS IV: RESERVED WORDS PAUL L. BAILEY Abstract. This documents amalgamates various descriptions found on the internet, mostly from Oracle or Wikipedia. Very little of this
Generic classes & the Java Collections Framework. *Really* Reusable Code
Generic classes & the Java Collections Framework *Really* Reusable Code First, a bit of history Since Java version 5.0, Java has borrowed a page from C++ and offers a template mechanism, allowing programmers
Objects and Iterators
Objects and Iterators Can We Have Data Structures With Generic Types? What s in a Bag? All our implementations of collections so far allowed for one data type for the entire collection To accommodate a
15CS45 : OBJECT ORIENTED CONCEPTS
15CS45 : OBJECT ORIENTED CONCEPTS QUESTION BANK: What do you know about Java? What are the supported platforms by Java Programming Language? List any five features of Java? Why is Java Architectural Neutral?
C# Generics. Object Oriented Programming (236703) Winter
C# Generics Object Oriented Programming (236703) Winter 2014-5 C# Generics in a nutshell Outline Generics what is it good for? C# generics semantics Generics and reflection Limitations Variance 2 Why Do
Chapter 9. Exception Handling. Copyright 2016 Pearson Inc. All rights reserved.
Chapter 9 Exception Handling Copyright 2016 Pearson Inc. All rights reserved. Last modified 2015-10-02 by C Hoang 9-2 Introduction to Exception Handling Sometimes the best outcome can be when nothing unusual
Java Generics -- an introduction. Based on https://docs.oracle.com/javase/tutorial/java/generics/why.html
Java Generics -- an introduction Based on https://docs.oracle.com/javase/tutorial/java/generics/why.html Generics vs. Templates Templates in C++ are compiled into unique code based on the types passed
1 Shyam sir JAVA Notes
1 Shyam sir JAVA Notes 1. What is the most important feature of Java? Java is a platform independent language. 2. What do you mean by platform independence? Platform independence means that we can write
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
Lecture 20. Java Exceptional Event Handling. Dr. Martin O Connor CA166
Lecture 20 Java Exceptional Event Handling Dr. Martin O Connor CA166 www.computing.dcu.ie/~moconnor Topics What is an Exception? Exception Handler Catch or Specify Requirement Three Kinds of Exceptions
CMSC 132: Object-Oriented Programming II
CMSC 132: Object-Oriented Programming II Object-Oriented Programming Intro Department of Computer Science University of Maryland, College Park Object-Oriented Programming (OOP) Approach to improving software
Inheritance, Polymorphism, and Interfaces
Inheritance, Polymorphism, and Interfaces Chapter 8 Inheritance Basics (ch.8 idea) Inheritance allows programmer to define a general superclass with certain properties (methods, fields/member variables)
3.Constructors and Destructors. Develop cpp program to implement constructor and destructor.
3.Constructors and Destructors Develop cpp program to implement constructor and destructor. Constructors A constructor is a special member function whose task is to initialize the objects of its class.
11/2/ Dynamic Data Structures & Generics. Objectives. Array-Based Data Structures: Outline. Harald Gall, Prof. Dr.
12. Dynamic Data Structures & Generics Harald Gall, Prof. Dr. Institut für Informatik Universität Zürich http://seal.ifi.uzh.ch Objectives! Define and use an instance of ArrayList! Describe general idea
Class Libraries. Readings and References. Java fundamentals. Java class libraries and data structures. Reading. Other References
Reading Readings and References Class Libraries CSE 142, Summer 2002 Computer Programming 1 Other References» The Java tutorial» http://java.sun.com/docs/books/tutorial/ http://www.cs.washington.edu/education/courses/142/02su/
EECS 2011 M: Fundamentals of Data Structures
EECS 2011 M: Fundamentals of Data Structures Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/2011m Also on Moodle S. Datta (York Univ.) EECS 2011 W18 1 / 19 Iterators and
COURSE 4 PROGRAMMING III OOP. JAVA LANGUAGE
COURSE 4 PROGRAMMING III OOP. JAVA LANGUAGE PREVIOUS COURSE CONTENT Inheritance Abstract classes Interfaces instanceof operator Nested classes Enumerations COUSE CONTENT Collections List Map Set Aggregate
Higher-Order Sequential Operations
Chapter 9 Higher-Order Sequential Operations Many of the operations we wish to perform over lists have common structure. In this chapter, we investigate the most common of these patterns and how we can
Java Review: Objects
Outline Java review Abstract Data Types (ADTs) Interfaces Class Hierarchy, Abstract Classes, Inheritance Invariants Lists ArrayList LinkedList runtime analysis Iterators Java references 1 Exam Preparation
Collections Questions
Collections Questions https://www.journaldev.com/1330/java-collections-interview-questions-and-answers https://www.baeldung.com/java-collections-interview-questions https://www.javatpoint.com/java-collections-interview-questions
Java: exceptions and genericity
Chair of Software Engineering Carlo A. Furia, Marco Piccioni, Bertrand Meyer Java: exceptions and genericity Chair of Software Engineering Carlo A. Furia, Marco Piccioni, Bertrand Meyer Exceptions Exceptions
CS 61B Discussion 5: Inheritance II Fall 2014
CS 61B Discussion 5: Inheritance II Fall 2014 1 WeirdList Below is a partial solution to the WeirdList problem from homework 3 showing only the most important lines. Part A. Complete the implementation
Array. 9 January 2015 OSU CSE 1
Array 9 January 2015 OSU CSE 1 Array The Array component family allows you to manipulate arrays in a way that overcomes surprising limitations of built-in Java arrays, but retains the time/space performance
Today. Book-keeping. Exceptions. Subscribe to sipb-iap-java-students. Collections. Play with problem set 1
Today Book-keeping Exceptions Subscribe to sipb-iap-java-students Collections http://sipb.mit.edu/iap/java/ Play with problem set 1 No class Monday (MLK); happy Hunting Problem set 2 on Tuesday 1 2 So
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
23. Generics and Adapters
COMP 401 Prasun Dewan 1 23. Generics and Adapters The term generic implies unspecialized/common behavior. In an object oriented language, it seems to apply to the class Object, which describes the behavior
Introduction to Computing II (ITI 1121) Final Examination
Université d Ottawa Faculté de génie École de science informatique et de génie électrique University of Ottawa Faculty of Engineering School of Electrical Engineering and Computer Science Introduction
Polymorphism. CMSC 330: Organization of Programming Languages. Two Kinds of Polymorphism. Polymorphism Overview. Polymorphism
CMSC 330: Organization of Programming Languages Polymorphism Polymorphism Definition Feature that allows values of different data types to be handled using a uniform interface Applicable to Functions Ø
Comp 248 Introduction to Programming Chapter 4 - Defining Classes Part A
Comp 248 Introduction to Programming Chapter 4 - Defining Classes Part A Dr. Aiman Hanna Department of Computer Science & Software Engineering Concordia University, Montreal, Canada These slides has been
09/02/2013 TYPE CHECKING AND CASTING. Lecture 5 CS2110 Spring 2013
1 TYPE CHECKING AND CASTING Lecture 5 CS2110 Spring 2013 1 Type Checking 2 Java compiler checks to see if your code is legal Today: Explore how this works What is Java doing? Why What will Java do if it
Absolute C++ Walter Savitch
Absolute C++ sixth edition Walter Savitch Global edition This page intentionally left blank Absolute C++, Global Edition Cover Title Page Copyright Page Preface Acknowledgments Brief Contents Contents
JAVA: A Primer. By: Amrita Rajagopal
JAVA: A Primer By: Amrita Rajagopal 1 Some facts about JAVA JAVA is an Object Oriented Programming language (OOP) Everything in Java is an object application-- a Java program that executes independently
CS108, Stanford Handout #8. Java Generics
CS108, Stanford Handout #8 Fall, 2007-08 Nick Parlante Java Generics Java generics (added in version 5) are a mixed bag. Some uses of generics are simple to understand and make the code cleaner. They are
Exception Handling. Chapter 9
Exception Handling Chapter 9 Objectives Describe the notion of exception handling React correctly when certain exceptions occur Use Java's exception-handling facilities effectively in classes and programs
Algorithms. Produced by. Eamonn de Leastar
Algorithms Produced by Eamonn de Leastar (edeleastar@wit.ie) Collections ± Collections Architecture ± Definition ± Architecture ± Interfaces ± Collection ± List ± Set ± Map ± Iterator ± Implementations
Generics and Type Safety. CS 180 Sunil Prabhakar Department of Computer Science Purdue University
Generics and Type Safety CS 180 Sunil Prabhakar Department of Computer Science Purdue University Dynamic Data Collections Already seen several examples of dynamic data Linked list, Stack, Queue, Trees
Java Collections. Readings and References. Collections Framework. Java 2 Collections. References. CSE 403, Winter 2003 Software Engineering
Readings and References Java Collections References» "Collections", Java tutorial» http://java.sun.com/docs/books/tutorial/collections/index.html CSE 403, Winter 2003 Software Engineering http://www.cs.washington.edu/education/courses/403/03wi/
Topic #9: Collections. Readings and References. Collections. Collection Interface. Java Collections CSE142 A-1
Topic #9: Collections CSE 413, Autumn 2004 Programming Languages http://www.cs.washington.edu/education/courses/413/04au/ If S is a subtype of T, what is S permitted to do with the methods of T? Typing
1 10 3:30 5: :30 1:30 206, ICICS/CS
Department of Computer Science Undergraduate Events Events this week Resume Editing Drop-In Session Date: Mon., Feb 1 Time: 11 am 2 pm Location: Rm 255, ICICS/CS EADS Info Session Date: Mon., Feb 1 Time:
interface MyAnno interface str( ) val( )
Unit 4 Annotations: basics of annotation-the Annotated element Interface. Using Default Values, Marker Annotations. Single-Member Annotations. The Built-In Annotations-Some Restrictions. 1 annotation Since
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
Object oriented programming. Instructor: Masoud Asghari Web page: Ch: 7
Object oriented programming Instructor: Masoud Asghari Web page: http://www.masses.ir/lectures/oops2017sut Ch: 7 1 In this slide We follow: https://docs.oracle.com/javase/tutorial/index.html Trail: Essential
CSCI 136 Written Exam #1 Fundamentals of Computer Science II Spring 2014
CSCI 136 Written Exam #1 Fundamentals of Computer Science II Spring 2014 Name: This exam consists of 5 problems on the following 6 pages. You may use your double- sided hand- written 8 ½ x 11 note sheet
CompuScholar, Inc. Alignment to Nevada "Computer Science" Course Standards
CompuScholar, Inc. Alignment to Nevada "Computer Science" Course Standards Nevada Course Details: Course Name: Computer Science Primary Cluster: Information and Media Technologies Standards Course Code(s):