chapter 2 data design and implementation

65
1 Chapter 2 Data Design and Implementation

Upload: bianca-campbell

Post on 01-Jan-2016

45 views

Category:

Documents


1 download

DESCRIPTION

Chapter 2 Data Design and Implementation. The representation of information in a manner suitable for communication or analysis by humans or machines Data are the nouns of the programming world: The objects that are manipulated The information that is processed. Data. - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: Chapter 2 Data Design and Implementation

1

Chapter 2Data Design and Implementation

Page 2: Chapter 2 Data Design and Implementation

2

Data

• The representation of information in a manner suitable for communication or analysis by humans or machines

• Data are the nouns of the programming world: • The objects that are manipulated• The information that is processed

Page 3: Chapter 2 Data Design and Implementation

3

Data Abstraction

• Separation of a data type’s logical properties from its implementation.

LOGICAL PROPERTIES IMPLEMENTATION

What are the possible values? How can this be done in C++?

What operations will be needed? How can data types be used?

Page 4: Chapter 2 Data Design and Implementation

4

APPLICATION

0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1

REPRESENTATION

Data Encapsulation

• is the separation of the representation of data from the applications that use the data at a logical level; a programming language feature that enforces information hiding.

int y;

y = 25;

Page 5: Chapter 2 Data Design and Implementation

5

Encapsulated C++ Data Type int

Value range: INT_MIN . . INT_MAX

Operations: + prefix - prefix + infix - infix * infix / infix % infixRelational Operators infix

TYPE int

(inside)

Representation of

int

as 16 bits two’s complement

+

Implementation of Operations

Page 6: Chapter 2 Data Design and Implementation

6

Abstract Data Type (ADT)

• A data type whose properties (domain and operations) are specified independently of any particular implementation.

Page 7: Chapter 2 Data Design and Implementation

7

• Application (or user) level: modeling real-life data in a specific context.

• Logical (or ADT) level: abstract view of the domain and operations. WHAT

• Implementation level: specific representation of the structure to hold the data items, and the coding for operations. HOW

Data from 3 different levels

Page 8: Chapter 2 Data Design and Implementation

8

Communication between the Application Level and Implementation Level

Page 9: Chapter 2 Data Design and Implementation

9

Viewing a library from 3 different levels

• Application (or user) level: Library of Congress, or Baltimore County Public Library.

• Logical (or ADT) level: domain is a collection of books; operations include: check book out, check book in, pay fine, reserve a book.

• Implementation level: representation of the structure to hold the “books”, and the coding for operations.

Page 10: Chapter 2 Data Design and Implementation

10

Composite Data Type

A composite data type is a type which

• stores a collection of individual data components under one variable name,

• and allows the individual data components to be accessed.

Page 11: Chapter 2 Data Design and Implementation

4 Basic Kinds of ADT Operations

• Constructor -- creates a new instance (object) of an ADT.

• Transformer -- changes the state of one or more of the data values of an instance.

• Observer -- allows us to observe the state of one or more of the data values without changing them.

• Iterator -- allows us to process all the components in a data structure sequentially.

11

Page 12: Chapter 2 Data Design and Implementation

Two Forms of Composite Data Types

Components are not organized with respect to one another.

The organization determines method used to access individual data components.

UNSTRUCTURED STRUCTURED

EXAMPLES: EXAMPLES: arraysclasses and structs

12

Page 13: Chapter 2 Data Design and Implementation

13

C++ Built-In Data Types

Composite

array struct union class

Address

pointer reference

Simple

Integral Floating

char short int long enum

float double long double

Page 14: Chapter 2 Data Design and Implementation

14

Records

A record is a composite data type made up of a finite collection of not necessarily homogeneous elements called members or fields. For example . . .

.year 1999

.maker ‘h’ ‘o’ ‘n’ ‘d’ ‘a’ ‘\0’ . . .

.price 18678.92

thisCar at Base Address 6000

Page 15: Chapter 2 Data Design and Implementation

15

struct CarType

struct CarType{

int year ; char maker[10]; float price ;

} ;

CarType thisCar; //CarType variables

CarType myCar;

Page 16: Chapter 2 Data Design and Implementation

16

Accessing struct members

The member selection operator (period . ) is used between the variable name and the member identifier to access individual members of a record (struct or class) type variable.

EXAMPLES

myCar.year

thisCar.maker[4]

Page 17: Chapter 2 Data Design and Implementation

17

Valid struct operations

• Operations valid on an entire struct type variable:

assignment to another struct variable of same type,

pass as a parameter to a function

(either by value or by reference),

return as the value of a function.

Page 18: Chapter 2 Data Design and Implementation

Pass-by-value

CALLINGBLOCK

FUNCTION CALLED

sends a copy of the contents of the actual parameter

SO, the actual parameter cannot be changed by the function. 18

Page 19: Chapter 2 Data Design and Implementation

Pass-by-reference

sends the location (memory address)of the actual parameter

can change value ofactual parameter

CALLINGBLOCK FUNCTION

CALLED

19

Page 20: Chapter 2 Data Design and Implementation

20

Using struct type Reference Parameter to change a member

void AdjustForInflation(CarType& car, float perCent)

// Increases price by the amount specified in perCent{

car.price = car.price * perCent + car.price; } ;

SAMPLE CALL

AdjustForInflation(myCar, 0.03);

Page 21: Chapter 2 Data Design and Implementation

21

Using struct type Value Parameter to examine a member

bool LateModel(CarType car, int date)

// Returns true if the car’s model year is later than or

// equal to date; returns false otherwise.{

return ( car.year >= date ) ;

} ;

SAMPLE CALL

if ( LateModel(myCar, 1995) )std::cout << myCar.price << std::endl ;

Page 22: Chapter 2 Data Design and Implementation

22

One-Dimensional Array at the Logical Level

A one-dimensional array is a structured composite data type made up of a finite, fixed size (known at compile time) collection of homogeneous (all of the same data type) elements having relative positions and to which there is direct access (any element can be accessed immediately).

Array operations (creation, storing a value, retrieving a value) are performed using a declaration and indexes.

Page 23: Chapter 2 Data Design and Implementation

23

Implementation Example

float values[5]; // assume element size is 4 bytes

This ACCESSING FUNCTION gives position of values[Index]

Address(Index) = BaseAddress + Index * SizeOfElement

Base Address

values[0] values[1] values[2] values[3] values[4]

7000 7004 7008 7012 7016

Indexes

Page 24: Chapter 2 Data Design and Implementation

24

One-Dimensional Arrays in C++

• The index must be of an integral type (char, short, int, long, or enum).

• The index range is always 0 through the array size minus 1.

• Arrays cannot be assigned one to another, and cannot be the return type of a function.

Page 25: Chapter 2 Data Design and Implementation

25

Another Example

char name[10]; // assume element size is 1 byte

name[0] name[1] name[2] name[3] name[4] . . . . . name[9]

6000 6001 6002 6003 6004 6005 6006 6007 6008 6009

Base Address

This ACCESSING FUNCTION gives position of name[Index]

Address(Index) = BaseAddress + Index * SizeOfElement

Page 26: Chapter 2 Data Design and Implementation

26

Passing Arrays as Parameters

• In C++, arrays are always passed by reference, and & is not used with the formal parameter type.

• Whenever an array is passed as a parameter, its base address is sent to the called function.

Page 27: Chapter 2 Data Design and Implementation

27

const array parameter

Because arrays are always passed as reference parameters, you can protect the actual parameter from unintentional changes by using const in formal parameter list and function prototype.

FOR EXAMPLE . . . // prototype

float SumValues( const float values[ ],

int numOfValues );

Page 28: Chapter 2 Data Design and Implementation

28

float SumValues (const float values[ ], numOfValues )

// Pre: values[ 0] through values[numOfValues-1]

// have been assigned

// Returns the sum of values[0] through

// values[numOfValues-1]

{

float sum = 0;

for ( int index = 0; index < numOfValues; index++ )

{

sum += values [ index ] ;

}

return sum;

}28

Page 29: Chapter 2 Data Design and Implementation

29

Two-Dimensional Array at the Logical Level

A two-dimensional array is a structured composite data type made up of a finite, fixed size collection of homogeneous elements having relative positions and to which there is direct access.

Array operations (creation, storing a value, retrieving a value) are performed using a declaration and a pair of indexes (called row and column) representing the component’s position in each dimension.

Page 30: Chapter 2 Data Design and Implementation

30

EXAMPLE -- To keep monthly high temperatures for 50 states in a two-dimensional array. const int NUM_STATES = 50 ;const int NUM_MONTHS = 12 ;int stateHighs [ NUM_STATES ] [ NUM_MONTHS ] ;

[ 0 ] [ 1 ] [ 2 ] . . stateHighs [2] [7] . [ 48 ] [ 49 ]

[0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11]

66 64 72 78 85 90 99 115 98 90 88 80row 2,col 7might beArizona’shigh forAugust

Page 31: Chapter 2 Data Design and Implementation

31

Finding the average high temperature for Arizona

int total = 0 ;

int month ;

int average ;

for ( month = 0 ; month < NUM_MONTHS ; month ++ )

total = total + stateHighs [ 2 ] [ month ] ;

average = int ( total / 12.0 + 0.5 ) ;

Page 32: Chapter 2 Data Design and Implementation

32

const int NUM_STATES = 50 ;const int NUM_MONTHS = 12 ;int stateHighs [ NUM_STATES ] [ NUM_MONTHS ] ;

• In memory, C++ stores arrays in row order. The first row is followed by the second row, etc.

12 highs for state 0 12 highs for state 1 etc. Alabama Alaska first row second row

8000 8024 8048

Base Address

STORAGE

. . .

rows columns

Page 33: Chapter 2 Data Design and Implementation

33

Implementation Level View

stateHighs[ 0 ] [ 0 ]stateHighs[ 0 ] [ 1 ]stateHighs[ 0 ] [ 2 ]stateHighs[ 0 ] [ 3 ]stateHighs[ 0 ] [ 4 ]stateHighs[ 0 ] [ 5 ]stateHighs[ 0 ] [ 6 ]stateHighs[ 0 ] [ 7 ]stateHighs[ 0 ] [ 8 ]stateHighs[ 0 ] [ 9 ]stateHighs[ 0 ] [10 ]stateHighs[ 0 ] [11 ]stateHighs[ 1 ] [ 0 ]stateHighs[ 1 ] [ 1 ]stateHighs[ 1 ] [ 2 ]stateHighs[ 1 ] [ 3 ] . . .

To locate an element such asstateHighs [ 2 ] [ 7] the compiler needs to know that there are 12 columnsin this two-dimensional array.

At what address will stateHighs [ 2 ] [ 7 ] be found?

Assume 2 bytes for type int.

Base Address 8000

Page 34: Chapter 2 Data Design and Implementation

34

Two-Dimensional Array Parameters

• Just as with a one-dimensional array, when a two- (or higher) dimensional array is passed as a parameter, the base address of the actual array is sent to the function.

• The size of all dimensions except the first must be included in the function heading and prototype.

• The sizes of those dimensions for the formal parameter must be exactly the same as in the actual array.

Page 35: Chapter 2 Data Design and Implementation

35

const int NUM_STATES = 50 ;const int NUM_MONTHS = 12 ;int stateHighs [ NUM_STATES ] [ NUM_MONTHS ] ;int stateAverages [ NUM_STATES ] ;

[ 0 ] ? [ 1 ] ? [ 2 ] . . . [ 48 ] [ 49 ]

[0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11]

43 42 50 55 60 78 79 80 77 72 63 4066 64 72 78 85 90 99 115 98 90 88 80

Use the two-dimensional stateHighs array to fill a

one-dimensional stateAverages array

Alaska

Arizona

Page 36: Chapter 2 Data Design and Implementation

36

void findAverages ( const int stateHighs [ ] [ NUM_MONTHS] , int stateAverages [ ] )

// Pre: stateHighs[ 0..NUM_STATES-1] [ 0..NUM_MONTHS-1] // assigned// Post: stateAverages[ 0..NUM_STATES-1 ] contains rounded // average high temperature for each state{ int state; int month; int total; for ( state = 0 ; state < NUM_STATES; state++ ) { total = 0 ; for ( month = 0 ; month < NUM_MONTHS ; month++ )

total += stateHighs [ state ] [ month ] ; stateAverages [ state ] = int ( total / 12.0 + 0.5 ) ;

}} 36

Page 37: Chapter 2 Data Design and Implementation

37

Using typedef with arrays

helps eliminate the chances of size mismatches between

formal and actual parameters. FOR EXAMPLE,

typedef int StateHighsType [ NUM_STATES ] [ NUM_MONTHS ] ;

typedef int StateAveragesType [ NUM_STATES ] ;

void findAverages( const StateHighsType stateHighs , StateAveragesType

stateAverages )

{

.

.

.

}

37

Page 38: Chapter 2 Data Design and Implementation

38

Declaring Multidimensional Arrays

EXAMPLE USING TYPEDEF

const int NUM_DEPTS = 5; // mens, womens, childrens, electronics, linens

const int NUM_MONTHS = 12 ;

const int NUM_STORES = 3 ; // White Marsh, Owings Mills, Towson

typedef long MonthlySalesType [NUM_DEPTS] [NUM_MONTHS] [NUM_STORES];

MonthlySalesType monthlySales;

Page 39: Chapter 2 Data Design and Implementation

39

const int NUM_DEPTS = 5; // mens, womens, childrens, electronics, linensconst int NUM_MONTHS = 12 ; const int NUM_STORES = 3 ; // White Marsh, Owings Mills, Towson

typedef long MonthlySalesType [NUM_DEPTS] [NUM_MONTHS] [NUM_STORES] ;MonthlySalesType monthlySales;

monthlySales[3][7][0]sales for electronics in August at White Marsh

12 MONTHS columns

5 D

EP

TS

ro

ws

3 STORES

sheets

39

Page 40: Chapter 2 Data Design and Implementation

40

C++ class data type

• A class is an unstructured type that encapsulates a fixed number of data components (data members) with the functions (called member functions) that manipulate them.

• The predefined operations on an instance of a class are whole assignment and component access.

Page 41: Chapter 2 Data Design and Implementation

41

class DateType Specification

// SPECIFICATION FILE ( datetype.h )

class DateType // declares a class data type{

public : // 4 public member functions

void Initialize (int newMonth, int newDay, int newYear ) ;int YearIs( ) const ; // returns yearint MonthIs( ) const ; // returns monthint DayIs( ) const ; // returns day

private : // 3 private data members

int year ; int month ; int day ;

} ;

41

Page 42: Chapter 2 Data Design and Implementation

42

Use of C++ data type class

• Variables of a class type are called objects (or instances) of that particular class.

• Software that declares and uses objects of the class is called a client.

• Client code uses public member functions (called methods in OOP) to handle its class objects.

• Sending a message means calling a public member function.

Page 43: Chapter 2 Data Design and Implementation

43

Client Code Using DateType#include “datetype” // includes specification of the class#include “bool”using namespace std;int main ( void ){

DateType startDate ; // declares 2 objects of DateType DateType endDate ; bool retired = false ; startDate.Initialize ( 6, 30, 1998 ) ; endDate.Initialize ( 10, 31, 2002 ) ;

cout << startDate.MonthIs( ) << “/” << startDate.DayIs( ) << “/” << startDate.YearIs( ) << endl;

while ( ! retired ) { finishSomeTask( ) ; . . . } }

43

Page 44: Chapter 2 Data Design and Implementation

44

2 separate files generally used for class type

// SPECIFICATION FILE ( datetype .h ) // Specifies the data and function members. class DateType { public: . . .

private: . . . } ;

// IMPLEMENTATION FILE ( datetype.cpp )

// Implements the DateType member functions. . . .

Page 45: Chapter 2 Data Design and Implementation

45

DateType Class Instance Diagrams

Initialize

YearIs

MonthIs

DayIs

startDate endDate

Private data:

year

month

day

2002

10

31

Initialize

YearIs

MonthIs

DayIs

1998

6

30

Private data:

year

month

day

Page 46: Chapter 2 Data Design and Implementation

46

Implementation of DateType member functions

// IMPLEMENTATION FILE (datetype.cpp)

#include “datetype.h” // also must appear in client code

void DateType :: Initialize ( int newMonth, int newDay,

int newYear )

// Post: year is set to newYear.

// month is set to newMonth.

// day is set to newDay.

{

year = newYear ;

month = newMonth ;

day = newDay ;

}

46

Page 47: Chapter 2 Data Design and Implementation

47

int DateType :: MonthIs ( ) const// Accessor function for data member month{ return month ;}

int DateType :: YearIs ( ) const// Accessor function for data member year{ return year ;}

int DateType :: DayIs ( ) const// Accessor function for data member day{ return day ;}

47

Page 48: Chapter 2 Data Design and Implementation

48

Familiar Class Instances and Member Functions

• The member selection operator ( . ) selects either data members or member functions.

• Header files iostream and fstream declare the istream, ostream,and ifstream, ofstream I/O classes.

• Both cin and cout are class objects and get and ignore are member functions.

cin.get (someChar) ;cin.ignore (100, ‘\n’) ;

• These statements declare myInfile as an instance of class ifstream and invoke member function open.

ifstream myInfile ;myInfile.open ( “A:\\mydata.dat” ) ;

Page 49: Chapter 2 Data Design and Implementation

49

Scope Resolution Operator ( :: )

• C++ programs typically use several class types.

• Different classes can have member functions with the same identifer, like Write( ).

• Member selection operator is used to determine the class whose member function Write( ) is invoked.

currentDate .Write( ) ; // class DateTypenumberZ .Write( ) ; // class ComplexNumberType

• In the implementation file, the scope resolution operator is used in the heading before the member function’s name to specify its class.

void DateType :: Write ( ) const{ . . .

}

Page 50: Chapter 2 Data Design and Implementation

50

A Short Review of Object-Oriented Programming

• Three inter-related constructs: classes, objects, and inheritance

• Objects are the basic run-time entities in an object-oriented system.

• A class defines the structure of its objects.

• Classes are organized in an “is-a” hierarchy defined by inheritance.

Page 51: Chapter 2 Data Design and Implementation

51

Inheritance

1. Allows programmers to create a new class that is a specialization of an existing class.

2. The new class is called a derived class of the existing class; the existing class is the base class of the new class.

Page 52: Chapter 2 Data Design and Implementation

52

Inheritance

• Inheritance fosters reuse by allowing an application to take an already-tested class and derive a class from it that inherits the properties the application needs

• Polymorphism: the ability of a language to have duplicate method names in an inheritance hierarchy and to apply the method that is appropriate for the object to which the method is applied

Page 53: Chapter 2 Data Design and Implementation

53

Inheritance

• Inheritance and polymorphism combined allow the programmer to build useful hierarchies of classes that can be reused in different applications

• Mapping of problem into solution

Page 54: Chapter 2 Data Design and Implementation

54

# include <string>

class MoneyType

{

public:

void Initialize(long, long);

long DollarsAre( ) const;

long CentsAre( ) const;

private:

long dollars;

long cents;

};

Page 55: Chapter 2 Data Design and Implementation

55

class ExtMoneyType:public MoneyType{public: string CurrencyIs( ); void Initialize(long, long, const string);private: string currency;};ExtMoneyType extMoney;void ExtMoneyType::Initialize (long newDollars, long newCents, string newCurrency){ currency = newCurrency; MoneyType::Initialize(newDollars, newCents);}String ExtMoneyType::CurrencyIs() const{ return currency;

}

Page 56: Chapter 2 Data Design and Implementation

56

Exceptions

• An exception is an unusual situation that occurs when the program is running.

• Exception Management • Define the error condition• Enclose code containing possible error (try).• Alert the system if error occurs (throw).• Handle error if it is thrown (catch).

Page 57: Chapter 2 Data Design and Implementation

57

try, catch, and throw

Try{ // code that contains a possible error

… throw string(“An error has occurred in function …”);

}Catch (string message){

std::cout << message << std::endl;return 1;

}

Page 58: Chapter 2 Data Design and Implementation

58

Namespace

namespace mySpace

{

// All variables and functions within this

// block must be accessed using scope

// resolution operator (::).

}

Purpose: Avoid namespace pollution.

Page 59: Chapter 2 Data Design and Implementation

59

Three Ways to Access Members within a Namespace

• Qualify each reference: mySpace::name with every reference.

• Using declaration: using mySpace::name;All future references to name refer to mySpace::name.

• Using directive:using namespace mySpace;All members of mySpace can be referenced without

qualification.

Page 60: Chapter 2 Data Design and Implementation

60

Rules for Use of Namespace std(within text)

• Qualify names in prototypes and/or function definitions.

• If name used more than once in a function block, use a using declaration.

• If more than one name is used from a namespace, use a using directive.

Page 61: Chapter 2 Data Design and Implementation

Order of Magnitude of a Function

The order of magnitude, or Big-O notation, of a function expresses the computing timeof a problem as the term in a function that increases most rapidly relative to the sizeof a problem.

61

Page 62: Chapter 2 Data Design and Implementation

Names of Orders of Magnitude

O(1) bounded (by a constant) time

O(log2N) logarithmic time

O(N) linear time

O(N*log2N) N*log2N time

O(N2) quadratic time

O( 2N ) exponential time 62

Page 63: Chapter 2 Data Design and Implementation

N log2N N*log2N N2 2N

1 0 0 1 2

2 1 2 4 4

4 2 8 16 16

8 3 24 64 256

16 4 64 256 65,536

32 5 160 1024 4,294,967,296

64 6 384 4096

128 7 896 16,384

Page 64: Chapter 2 Data Design and Implementation

Big-O Comparison of List Operations

OPERATION UnsortedList SortedList

RetrieveItem O(N) O(N) linear search O(log2N) binary search

InsertItemFind O(1) O(N) searchPut O(1) O(N) moving downCombined O(1) O(N)

DeleteItemFind O(N) O(N) searchPut O(1) swap O(N) moving upCombined O(N) O(N)

Page 65: Chapter 2 Data Design and Implementation

65

// SPECIFICATION FILE ( strtype.h )

const int MAX_CHARS = 200 ;enum InType { ALPHA_NUM, ALPHA, NON_WHITE, NOT_NEW } ;

class StrType{public :

StrType ( ) ; // DEFAULT CONSTRUCTORvoid MakeEmpty ( ) ;

void GetString ( bool skip, InType charsAllowed ) ;void PrintToScreen ( bool newLine ) const ;

.

.

. // OVERLOADED OPERATORS

bool operator< (StrType otherString ) const ;bool operator== (StrType otherString ) const ;

private :char letters [MAX_CHARS + 1 ] ;

} ;