![3 parts of program or 3 modules
Type student < …
>
Dictionary
……
function add_student(…)
……
Algorithm
……
……
Function add_student( … )
……
Function delete_student( … )
……
Procedure …… ……
……
Type description and Primitive declaration
[ Specification ]
Body of main program
[ Program implementation ]
Primitive Implementation (basic operation)
6 1/23/2019
Here, we actually have
CCH1D4-STRUKTUR DATA](https://image.slidesharecdn.com/slideadt-241101081919-43120cfa/85/Slide-ADT-modularity-and-data-abstraction-pdf-6-320.jpg)
Slide ADT-modularity and data abstraction.pdf
- 1. CCH1D4 STRUKTUR DATA Modularity and Data Abstraction
- 2. describes a program organized into loosely coupled, highly cohesive modules” – Carrano and Prichard, p. 7 “a technique that keeps the complexity of a large program manageable by systematically controlling the interaction of its components” – Carrano and Prichard, p. 106 2 1/23/2019 Modularity CCH1D4-STRUKTUR DATA
- 3. Modularity is the degree to which a system's components may be separated and recombined Here we will know about Abstract Data Type (ADT) – to understand better about ADT, let’s see the illustration 3 1/23/2019 In Short : CCH1D4-STRUKTUR DATA
- 4. Suppose we will make an information System to store students record There are 4 menus – Add new data – Delete data – Edit data – View stored data 4 1/23/2019 Student Information System CCH1D4-STRUKTUR DATA
- 5. Basic Algorithm Writing Style 5 1/23/2019 What we usually do? CCH1D4-STRUKTUR DATA Type student < … > Dictionary …… function add_student(…) …… Algorithm …… …… Function add_student( … ) …… Function delete_student( … ) …… Procedure …… …… …… Type description of student, name, id, class, etc. Declaring Variables and name of functions that will be used in main program Main program, contains menu, interface, etc. The main program will use the functions available or has been specified Function specification, basic operation for student All in one file (one script)
- 6. 3 parts of program or 3 modules Type student < … > Dictionary …… function add_student(…) …… Algorithm …… …… Function add_student( … ) …… Function delete_student( … ) …… Procedure …… …… …… Type description and Primitive declaration [ Specification ] Body of main program [ Program implementation ] Primitive Implementation (basic operation) 6 1/23/2019 Here, we actually have CCH1D4-STRUKTUR DATA
- 7. The Goal of ADT is to separates between specification and implementation ADT itself is the Specification part that contains TYPE declaration and PRIMITIVE specification 7 1/23/2019 Abstract Data Type CCH1D4-STRUKTUR DATA
- 8. Basic Writing Stye : 1 file ADT Style : At least 3 files Header / type declaration Primitive specification Main / body program ADT style Algorithm 8 1/23/2019 Change the basic style CCH1D4-STRUKTUR DATA Type student < … > Dictionary …… function add_student(…) …… Algorithm …… …… Function add_student( … ) …… Function delete_student( … ) …… Procedure …… …… …… Type student < … > function add_student(…) function delete_student(…) Function add_student( … ) …… Function delete_student( … ) …… Algorithm …… ……
- 9. 9 1/23/2019 Connectivity Between Modules CCH1D4-STRUKTUR DATA Interface (Implementation) Header/Type declaration compile implement specify Primitive specification
- 10. Security – user only needs to know the specifications of features without the need to be given detailed implementation of these features. 10 1/23/2019 Why we use ADT? CCH1D4-STRUKTUR DATA Interface (main program) ADT students There are 4 menus I can add, edit, or delete data Don’t need to know how they do it
- 11. Reusability – Suppose we’re going to build another information system that happens also use students record (add, edit, delete) – We don’t need to code the ADT again, we can use what we already have 11 1/23/2019 Why we use ADT? CCH1D4-STRUKTUR DATA IS 2 Interface 2 (main program 2) Interface 1 (main program 1) ADT students IS 1
- 13. DRY Principles Don't repeat yourself “Every piece of knowledge must have a single, unambiguous, authoritative representation within a system” – When the DRY principle is applied successfully, a modification of any single element of a system does not require a change in other logically unrelated elements 1/23/2019 13
- 14. Task/Exercise : Clock ADT Create a Clock ADT (Clock.h) to store time (hour, minute, and second) 1/23/2019 14 TYPE Hour : integer {0..23} TYPE Minute : integer {0..59} TYPE Second : integer {0..59} TYPE Clock : < HH : Hour, MM: Minute, SS : Second; >
- 15. Task/Exercise : Clock ADT Primitive for Clock.h Validator – Function IsValid(HH,MM,SS: integer) boolean – { return true if 0≤HH≤23, and 0≤MM≤59, and 0≤MM≤59 } Constructor – Function MakeClock(HH, MN, SS: integer) clock – { return clock created from input } 1/23/2019 15
- 16. Task/Exercise : Clock ADT Selector – Function GetHour(c : clock) hour c.HH – Function GetMinute(c : clock) minute – Function GetSecond(c : clock) second Value changer – Procedure SetHour(In/Out c : clock, newHH: integer) c.HH newHH – Procedure SetMinute(In/Out c : clock, newMM: integer) – Procedure SetSecond(In/Out c : clock, newSS: integer) 1/23/2019 16
- 17. Task/Exercise : Clock ADT Relational Operation – Function IsEqual (c1 : clock, c2 :clock) Boolean c1=c2 Arithmetic Operation – Function AddClock (c1 : clock, c2 :clock) clock Output Process – Procedure PrintClock ( c : clock ); 1/23/2019 17
- 18. Task/Exercise : Clock ADT Create the Implementation of Clock ADT (Clock.cpp) Create the Driver application to try the implementation (Main.cpp) – Example : – c1 MakeClock(2,30,4) – c2 MakeClock(6,0,0) – c3 IsEqual (c1, c2 ) – output(GetHours(c1)) 1/23/2019 18
- 19. 1/23/2019 19 Clock ADT Implementation Diagram of Clock ADT //Clock.h //TYPE Declaration //PRIMITIF Declaration //Clock.Cpp //PRIMITIF Implementation //Main.Cpp //Driver ADT Jam
- 20. 20 1/23/2019