Data Abstraction The Walls Or Techniques for solving

Data Abstraction: The Walls Or Techniques for solving large complex problems Chapter 1

Object-Oriented Concepts • Object-oriented analysis and design (OOAD) o Process for solving problems • Solution o Computer program consisting of system of interacting classes of objects • Object o Has set of characteristics, behaviors related to solution

Object-Oriented Analysis & Design • Requirements of a solution o What solution must be, do • Object-oriented design o Describe solution to problem o Express solution in terms of software objects o Create one or more models of solution

Aspects of Object-Oriented Solution Principles of object-oriented programming • Encapsulation: Objects combine data and operations. • Inheritance: Classes inherit properties from other classes. • Polymorphism: Objects determine appropriate operations at execution time.

Software Modules – High Cohesion • Each module should perform one well-defined task • Cohesion refers to the degree to which the elements inside a module belong together. • Benefits of high cohesion o Well named, self-documenting o Easy to reuse o Easier to maintain o More robust Low or high cohesion example? function do. It () { read. Data(L, input. File) sort(L) print(L) }

Software Modules – Loose Coupling • Measure of dependence among modules • Dependence o Sharing data structures or calling each other’s methods • Modules should be loosely coupled o Highly coupled modules should be avoided i. Pods are a good example of tight coupling: once the battery dies you might as well buy a new i. Pod because the battery is soldered in place and won't come loose, thus making replacement very expensive. A loosely coupled player would allow effortless battery replacement. http: //stackoverflow. com/questions/226977/what-isloose-coupling-please-provide-examples

Coupling • Benefits of loose coupling in a system o More adaptable to change o Easier to understand o Increases reusability o Has increased cohesion Well designed software systems have high cohesion and loose coupling.

Specifications • • The task sort is a module separate from the My. Program module If sort does only the data reordering it is a highly cohesive unit. The program is loosely coupled because the unsorted data is passed as input to sort and the sorted data is returned to My. Program.

Operation Contracts for Program Modules • What documentation is necessary for a program unit such as the sort function in the previous slide? • Analysis - Documents o How method can be used o What limitations it has • Design and Coding - Specifies o Purpose of modules o Data flow among modules o Pre-, post-condition, input, output of each module

/* Sort Function Documentation Purpose: Sorts in ascending order the input, an. Array. Pre: an. Array is an array of n integers and 1<=n<MAX_ARRAY_SIZE. Post: an. Array[0] <= an. Array[1] <= … <= an. Array[n-1] and n is unchanged Checks: throws a logic exception if n <= 0 */ void sort(int [] an. Array, int n) throws logic_exception;

Unusual Conditions Ways to address invalid conditions: o. Assume they will not happen o. Ignore such situations o. Guess at client’s intentions o. Return value that signals problem o. Throw an exception

Documentation Abstraction • Separate purpose of a module from its implementation • Specifications do not indicate how to implement • The sort function can be used without knowing implementation – fast or slow sort? In place or extra memory used? Not necessary for correct use.

Information Hiding • Abstraction helps identify details that should be hidden from public view o Ensures no other module can tamper with these hidden details either maliciously or inadvertently. • Isolation of the modules cannot be total, however o Client must know what tasks can be done, how to initiate a task

Information Hiding • Tasks communicate through a slit in the wall

Information Hiding • A revised implementation communicates through the same slit in the wall and can still be used without changing My. Program as long as the sort signature does not change

Minimal and Complete Interfaces • Interface for a class is made up of publicly accessible methods and data • Complete interface for a class o Allows programmer to accomplish any reasonable task • Minimal interface for a class o Contains method if and only if that method is essential to class’s responsibilities • You have been assigned the task of implementing a Circle interface – what data are needed? what are the minimal set of functions needed? what other functions might be useful? circle. h

Abstract Data Types (ADT) • Typical operations on data o Add data to a data collection. o Remove data from a data collection. o Ask questions about the data in a data collection. • An ADT : a collection of data and a set of operations on data • A data structure : an implementation of an ADT within a programming language

Abstract Data Types (ADT) • A dispenser of chilled water, crushed ice, and ice cubes

Abstract Data Types (ADT) • A wall of ADT operations isolates a data structure from the program that uses it

Designing an ADT • Evolves naturally during the problem-solving process o What data does a problem require? o What operations does a problem require? • ADTs typically have initialization and destruction operations o Assumed but not specified at this stage

ADTs That Suggest Other ADTs • You can use an ADT to implement another ADT o Example: Date-Time objects available in C++ for use in various contexts o Possible to create your own fraction object to use in some other object which requires fractions

The ADT Bag • Consider the bag to be an abstract data type. o We are specifying an abstraction inspired by an actual physical bag o Doesn’t do much more than contain its items o Unordered with possibly duplicate objects o We insist objects be of same or similar types • Knowing just its interface o Can use ADT bag in a program

Identifying Behaviors • A (class responsibility-collaboration) CRC card for a class Bag

Specifying Data and Operations • (unified modeling language) UML notation for the class Bag

An Interface Template for the ADT • LISTING 1 -1 A file containing a C++ interface for bags

Using the ADT Bag • LISTING 1 -2 A program for a card guessing game

End Chapter 1