Transformation of Dependency and Association in UML Design Class
Ngamsantivong Thavatchai1, Ratanavilisagul Chiabwoot2
1Ngamsantivong Thavatchai, Faculty, Department of Applied Science, King Mongkut’s University of Technology North Bangkok, Thailand.
2Ratanavilisagul Chiabwoot, Faculty, Department of Applied Science, King Mongkut’s University of Technology North Bangkok , Thailand.
Manuscript received on 05 September 2019 | Revised Manuscript received on 29 September 2019 | Manuscript Published on 29 June 2020 | PP: 385-388 | Volume-8 Issue-10S2 August 2019 | Retrieval Number: J107108810S19//2019©BEIESP | DOI: 10.35940/ijitee.J1071.08810S19
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: This paper presents two new conceptual relationships between classes of software development known as dependency and association. The design between the two relationships could be interchangeable because it always takes place in real-life situations — for instance, the relationship from friends to husband-wife and vice versa. However, in terms of coding, the most important factor is system performance. That means the designer could write the code as dependency or association to provide the same result. To improve the efficiency of the program, the researcher writes the code in the C++ language to execute four types of variables named messages, strings, calculation, and sorting. The four types of the variable used to test the performance of aggregation, composition, dependency, and functional programming, the timestamp was used to measure the execution time before and after for each case 50 times. The F-test statistic was used to compare the mean difference of each type of variable. The researcher found that for the Message variable. The functional programming is the fastest, followed by aggregation, composition, and dependency, the average C.P.U. time are 13566.60, 17891.70, 18532.66 and 19336.76, at 0.0 level of significance. For the String variable found that functional programming is the fastest followed by dependency, composition, and aggregation, the average C.P.U. time are 23785.88, 27449.76, 28478.24 and 28788.18, at 0.0 level of significance. For calculation found that functional programming is the fastest, followed by aggregation, composition, and dependency, the average C.P.U. time are 26982.68, 29311.86, 29377.50 and 29397.30, at 0.0 level of significance. For sorting found that functional programming is the fastest, followed by aggregation, composition, and dependency, the average C.P.U. time are 17925.20, 18408.36, 21641.68 and 22861.14, at 0.0 level of significance.
Keywords: Association, Dependency, Composition, Aggregation, Relationship Between Class
Scope of the Article: Computer Science and Its Applications