13-Jul-15 Abstract Data Types. 2 Data types I We type data--classify it into various categories-- such as int, boolean, String, Applet A data type represents.

Slides:



Advertisements
Similar presentations
An introduction to pointers in c
Advertisements

Composition CMSC 202. Code Reuse Effective software development relies on reusing existing code. Code reuse must be more than just copying code and changing.
23-Apr-15 Abstract Data Types. 2 Data types I We type data--classify it into various categories-- such as int, boolean, String, Applet A data type represents.
Written by: Dr. JJ Shepherd
ECE122 L4: Creating Objects February 8, 2007 ECE 122 Engineering Problem Solving with Java Lecture 4 Creating and Using Objects.
Road Map Introduction to object oriented programming. Classes
CS 330 Programming Languages 09 / 13 / 2007 Instructor: Michael Eckmann.
Using the Java API
Stacks. 2 What is a stack? A stack is a Last In, First Out (LIFO) data structure Anything added to the stack goes on the “top” of the stack Anything removed.
Chapter 2 storing numbers and creating objects Pages in Horstmann.
26-Jun-15 Abstract Data Types. 2 Data types I We type data--classify it into various categories-- such as int, boolean, String, Applet A data type represents.
Terms and Rules Professor Evan Korth New York University (All rights reserved)
29-Jun-15 Using the Java API
Abstract Data Types II. Sufficient operations Operations on an ADT are sufficient if they meet all the requirements –They must be able to create all the.
CS2110 Recitation Week 8. Hashing Hashing: An implementation of a set. It provides O(1) expected time for set operations Set operations Make the set empty.
Java. Why Java? It’s the current “hot” language It’s almost entirely object-oriented It has a vast library of predefined objects It’s platform independent.
Data Structures Week 5 Further Data Structures The story so far  We understand the notion of an abstract data type.  Saw some fundamental operations.
CSC 212 Object-Oriented Programming and Java Part 1.
4.1 Instance Variables, Constructors, and Methods.
Course: Object Oriented Programming - Abstract Data Types Unit1: IntroductionSlide Number 1 Introduction Course: Object Oriented Programming Abstract Data.
By Nicholas Policelli An Introduction to Java. Basic Program Structure public class ClassName { public static void main(String[] args) { program statements.
Characters The data type char represents a single character in Java. –Character values are written as a symbol: ‘a’, ‘)’, ‘%’, ‘A’, etc. –A char value.
Introduction to Java Applications Part II. In this chapter you will learn:  Different data types( Primitive data types).  How to declare variables?
Chapter 1 Object Orientation: Objects and Classes.
23-Oct-15 Abstract Data Types. 2 Data types A data type is characterized by: a set of values a data representation, which is common to all these values,
Using Data Within a Program Chapter 2.  Classes  Methods  Statements  Modifiers  Identifiers.
CSE 114 Computer Science I Objects Lake Superior, Michigan.
1 CIS 2168 Data Structures and Algorithms in JAVA Brief Introduction to JAVA.
Object-Oriented Program Development Using Java: A Class-Centered Approach, Enhanced Edition.
10-Nov-15 Java Object Oriented Programming What is it?
Data TypestMyn1 Data Types The type of a variable is not set by the programmer; rather, it is decided at runtime by PHP depending on the context in which.
Chapter 10 Defining Classes. The Internal Structure of Classes and Objects Object – collection of data and operations, in which the data can be accessed.
Linked List. Iterators Operation to find a link, deleting, and inserting before or after a specified link, also involve searching through the list to.
Data Abstaraction Chapter 10.
Simple Classes. ADTs A specification for a real world data item –defines types and valid ranges –defines valid operations on the data. Specification is.
Chapter 3 Syntax, Errors, and Debugging Fundamentals of Java.
Computers, Variables and Types Engineering 1D04, Teaching Session 2.
Computer Science 111 Fundamentals of Computer Programming I Working with our own classes.
Java Basics Opening Discussion zWhat did we talk about last class? zWhat are the basic constructs in the programming languages you are familiar.
Working With Objects Tonga Institute of Higher Education.
Object-Oriented Programming Chapter Chapter
CS305j Introduction to Computing Classes II 1 Topic 24 Classes Part II "Object-oriented programming as it emerged in Simula 67 allows software structure.
M1G Introduction to Programming 2 3. Creating Classes: Room and Item.
Java Classes Chapter 1. 2 Chapter Contents Objects and Classes Using Methods in a Java Class References and Aliases Arguments and Parameters Defining.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI CSCI 240 Elementary Data Structures Array Lists Array Lists Dale.
Introduction to Java Applications Part II. In this chapter you will learn:  Different data types( Primitive data types).  How to declare variables?
Written by: Dr. JJ Shepherd
Object Oriented Programming. OOP  The fundamental idea behind object-oriented programming is:  The real world consists of objects. Computer programs.
Introduction to Objects and Encapsulation Computer Science 4 Mr. Gerb Reference: Objective: Understand Encapsulation and abstract data types.
CS 106 Introduction to Computer Science I 09 / 10 / 2007 Instructor: Michael Eckmann.
Announcements Assignment 2 Out Today Quiz today - so I need to shut up at 4:25 1.
CSC 243 – Java Programming, Spring, 2014 Week 4, Interfaces, Derived Classes, and Abstract Classes.
Arrays, Link Lists, and Recursion Chapter 3. Sorting Arrays: Insertion Sort Insertion Sort: Insertion sort is an elementary sorting algorithm that sorts.
XuanTung Hoang 1 Something to discuss Feedbacks on Midterm Exam Final exam and term project  Final exam requires solid knowledge/skills in Java  Be more.
CSC 243 – Java Programming, Fall, 2008 Tuesday, September 30, end of week 5, Interfaces, Derived Classes, and Abstract Classes.
Objects as a programming concept
Introduction to Computer Science / Procedural – 67130
Java Primer 1: Types, Classes and Operators
Chapter 3: Using Methods, Classes, and Objects
Data Structures Mohammed Thajeel To the second year students
Pointers and References
Pointers and References
Subroutines Idea: useful code can be saved and re-used, with different data values Example: Our function to find the largest element of an array might.
Lesson 2: Building Blocks of Programming
Building Java Programs Chapter 2
Stacks.
Abstract Data Types 24-Feb-19.
Outline Anatomy of a Class Encapsulation Anatomy of a Method
Java Programming Language
CS2013 Lecture 7 John Hurley Cal State LA.
Presentation transcript:

13-Jul-15 Abstract Data Types

2 Data types I We type data--classify it into various categories-- such as int, boolean, String, Applet A data type represents a set of possible values, such as {..., -2, -1, 0, 1, 2,... }, or { true, false } By typing our variables, we allow the computer to find some of our errors Some operations only make sense when applied to certain kinds of data--multiplication, searching Typing simplifies internal representation A String requires more and different storage than a boolean

3 Data types II A data type is characterized by: a set of values a data representation, which is common to all these values, and a set of operations, which can be applied uniformly to all these values

4 Primitive types in Java Java provides eight primitive types: boolean char, byte, short, int, long float, double Each primitive type has a set of values a data representation a set of operations These are “set in stone”—there is nothing the programmer can do to change anything about them

5 Primitive types as data types

6 Classes in Java A class is a data type The possible values of a class are called objects The data representation is a reference (pointer) to a block of storage The structure of this block is defined by the fields (both inherited and immediate) of the class The operations on the objects are called methods Many classes are defined in Java’s packages You can (and must) define your own, as well

7 Methods and operators An operator typically Is written with non-alphabetic characters: +, *, ++, +=, &&, etc. Is written as prefix, infix, or postfix: -x, x+y, x++ Has only one or two arguments, or operands A method (or function) typically Is written with letters, and its arguments are enclosed in parentheses: toString(), Math.abs(n) Has any (predetermined) number of arguments

8 Methods are operators The differences between methods and operations are only syntactic differences, not fundamental ones Many languages (not including Java) let you define new operators, that is, new syntax When you define a new class and its methods, you are, fundamentally, defining a new data type and its operators Suppose a language defines the to mean “times 3 plus 1”; for is 22 Would you consider this a good operation to have in the language? What does this suggest about defining classes and their methods?

9 Insertion into a list There are many ways you could insert a new node into a list: Is it a good idea to supply all of these? If not, why not? As the new first element As the new last element Before a given node After a given node Before a given value After a given value Before the n th element After the n th element Before the n th from the end After the n th from the end In the correct location to keep the list in sorted order

10 Cognitive load Human minds are limited—you can’t remember everything You probably don’t even remember all the Java operators for integers What’s the difference between >> and >>> ? What about between << and <<< ? We want our operators (and methods) to be useful and worth remembering

11 Efficiency A list is just a sequence of values—it could be implemented by a linked list or by an array Inserting as a new first element is efficient for a linked list representation, inefficient for an array Accessing the n th element is efficient for an array representation, inefficient for a linked list Inserting in the n th position is efficient for neither Do we want to make it easy for the user to be inefficient? Do we want the user to have to know the implementation?

12 Abstract Data Types An Abstract Data Type (ADT) is: a set of values a set of operations, which can be applied uniformly to all these values To abstract is to leave out information, keeping (hopefully) the more important parts What part of a Data Type does an ADT leave out?

13 Data Structures Many kinds of data consist of multiple parts, organized (structured) in some way A data structure is simply some way of organizing a value that consists of multiple parts Hence, an array is a data structure, but an integer is not When we talk about data structures, we are talking about the implementation of a data type If I talk about the possible values of, say, complex numbers, and the operations I can perform with them, I am talking about them as an ADT If I talk about the way the parts (“real” and “imaginary”) of a complex number are stored in memory, I am talking about a data structure An ADT may be implemented in several different ways A complex number might be stored as two separate doubles, or as an array of two doubles, or even in some bizarre way

14 Data representation in an ADT An ADT must obviously have some kind of representation for its data The user need not know the representation The user should not be allowed to tamper with the representation Solution: Make all data private But what if it’s really more convenient for the user to have direct access to the data? Solution: Use setters and getters

15 Example of setters and getters class Pair { private int first, last; public getFirst() { return first; } public setFirst(int first) { this.first = first; } public getLast() { return last; } public setLast(int last) { this.last = last; } }

16 Naming setters and getters Setters and getters should be named by: Capitalizing the first letter of the variable ( first becomes First ), and Prefixing the name with get or set ( setFirst ) For boolean variables, replace get with is (for example, isRunning ) This is more than just a convention—if and when you start using JavaBeans, it becomes a requirement

17 What’s the point? Setters and getters allow you to keep control of your implementation For example, you decide to define a Point in a plane by its x-y coordinates: class Point { public int x; public int y; } Later on, as you gradually add methods to this class, you decide that it’s more efficient to represent a point by its angle and distance from the origin, θ and ρ Sorry, you can’t do that—you’ll break too much code that accesses x and y directly If you had used setters and getters, you could redefine them to compute x and y from θ and ρ

18 Contracts Every ADT should have a contract (or specification) that: Specifies the set of valid values of the ADT Specifies, for each operation of the ADT: Its name Its parameter types Its result type, if any Its observable behavior Does not specify: The data representation The algorithms used to implement the operations

19 Importance of the contract A contract is an agreement between two parties; in this case The implementer of the ADT, who is concerned with making the operations correct and efficient The applications programmer, who just wants to use the ADT to get a job done It doesn’t matter if you are both of these parties; the contract is still essential for good code This separation of concerns is essential in any large project

20 Promise no more than necessary For a general API, the implementer should provide as much generality as feasible But for a specific program, the class author should provide only what is essential at the moment In Extreme Programming terms, “You ain’t gonna need it!” In fact, XP practice is to remove functionality that isn’t currently needed! Your documentation should not expose anything that the application programmer does not need to know If you design for generality, it’s easy to add functionality later—but removing it may have serious consequences

21 Implementing an ADT To implement an ADT, you need to choose: a data representation must be able to represent all necessary values of the ADT should be private an algorithm for each of the necessary operations must be consistent with the chosen representation all auxiliary (helper) operations that are not in the contract should be private Remember: Once other people (or other classes) are using your class: It’s easy to add functionality You can only remove functionality if no one is using it!

22 Example contract (Javadoc) General description of class /** * Each value is a die (singular of dice) with n sides, * numbered 1 to n, with one face showing. */ public class Die Constructor /** * Constructs a die with faces numbered 1 thru numberOfSides. */ public Die(int numberOfSides) Accessor /** * Returns the result of the previous roll. */ int lastRoll() Transformer (mutative) /** * Returns the result of a new roll of the die. */ int roll()

23 Implementation, page 1 import java.util.*; public class Die { private int numberOfSides; private static Random random = new Random(); private int face; public Die(int numberOfSides) { this.numberOfSides = numberOfSides; face = roll(); // construct in a valid state! }

24 Implementation, page 2 int lastRoll() { return face; } int roll() { face = random.nextInt(numberOfSides) + 1; return face; } } // class Die

25 Responsibilities A class is responsible for its own values It should protect them from careless or malicious users Ideally, a class should be written to be generally useful The goal is to make the class reusable The class should not be responsible for anything specific to the application in which it is used In practice, most classes are application-specific Java’s classes are, on the whole, extremely well designed They weren’t written specifically for your program Strive to make your classes more like Java’s!

26 Aside: an interesting bug Originally, I left the word static out of private static Random random = new Random(); Then I created a Vector of ten dice ( Die s) When I printed the Vector, I got: Why? These really were ten different Die objects Hint: How does Java initialize its random number generator?

27 Summary A Data Type describes values, representations, and operations An Abstract Data Type describes values and operations, but not representations An ADT should protect its data and keep it valid All, or nearly all, data should be private Access to data should be via getters and setters An ADT should provide: A contract A necessary and sufficient set of operations

28 The End