- Object Oriented Analysis and Design
- Abstraction and information hiding
- Object oriented programming principles
- Unified Modeling Language
- Software life-cycle models
- Key programming issues
Chapter 1: Programming Principles
1-1 EECS 268 Programming II
Chapter 1: Programming Principles Object Oriented Analysis and - - PowerPoint PPT Presentation
Chapter 1: Programming Principles Object Oriented Analysis and Design Abstraction and information hiding Object oriented programming principles Unified Modeling Language Software life-cycle models Key programming issues EECS
1-1 EECS 268 Programming II
1-2 EECS 268 Programming II
1-3 EECS 268 Programming II
1-4 EECS 268 Programming II
1-5 EECS 268 Programming II
1-6 EECS 268 Programming II
1-7 EECS 268 Programming II
implement it
1-8 EECS 268 Programming II
1-9 EECS 268 Programming II
1-10 EECS 268 Programming II
circumstances from the perspective of the user
user’s goals
user and system when all goes well
under exceptional circumstances
1-11 EECS 268 Programming II
1-12 EECS 268 Programming II
1-13 EECS 268 Programming II
1-14
Figure 1-2 Sequence diagram for the main success scenario
EECS 268 Programming II
1-15
Figure 1-3 Sequence diagram showing the creation of a new object
EECS 268 Programming II
1-16 EECS 268 Programming II
1-17
Figure 1-4 Three possible class diagrams for a class of banks
EECS 268 Programming II
1-18
Figure 1-5 A UML class diagram of a banking system
EECS 268 Programming II
classes)
(composition)
1-19 EECS 268 Programming II
1-20 EECS 268 Programming II
1-21 EECS 268 Programming II
1-22
Figure 1-8 Relative amounts of work done in each development phase
EECS 268 Programming II
1-23 EECS 268 Programming II
1-24 EECS 268 Programming II
1-25 EECS 268 Programming II
1-26 EECS 268 Programming II
1-27 EECS 268 Programming II
1-28 EECS 268 Programming II
// Sorts an array. // Precondition: anArray is an array of num integers; num > 0. // Postcondition: The integers in anArray are sorted.
// Sorts an array into ascending order. // Precondition: anArray is an array of num // integers; 1 <= num <= MAX_ARRAY, where // MAX_ARRAY is a global constant that specifies // the maximum size of anArray. // Postcondition: anArray[0] <= anArray[1] <= ... // <= anArray[num-1], num is unchanged
1-29 EECS 268 Programming II
1-30 EECS 268 Programming II
1-31 EECS 268 Programming II
1-32 EECS 268 Programming II
1-33 EECS 268 Programming II
1-34 EECS 268 Programming II
1-35 EECS 268 Programming II
1-36 EECS 268 Programming II
1-37 EECS 268 Programming II
1-38 EECS 268 Programming II
1-39 EECS 268 Programming II
1-40 EECS 268 Programming II