Difference between aggregation and association, Computer Engineering

Assignment Help:

Difference between aggregation and association

Aggregation is a particular form of association, not an independent concept. Aggregation acts semantic connotations. If two objects are tightly bound by a part-hole relationship, it is an aggregation. If the two objects are usually considered as independent, even though they might be often be linked, it is an association.

 


Related Discussions:- Difference between aggregation and association

What do you mean by linker, Q. What do you mean by Linker? For modular...

Q. What do you mean by Linker? For modularity of your programs it is better to break your program in numerous sub routines. It's even better to put common routine such as read

How does the computer execute a program, Let's attempt to answer a fundamen...

Let's attempt to answer a fundamental question: 'How does the Computer execute a Program?' Let's describe this with the help of an example from higher level language domain. Pr

Select-options and parameters statement, The fields specified by select-opt...

The fields specified by select-options and parameters statement cannot be grouped together in the selection screen.  No, It can be grouped together in the selection screen

What is hashing, What is Hashing? Hashing: Hashing gives the direct acc...

What is Hashing? Hashing: Hashing gives the direct access of record from the file no matter where the record is in the file. This is possible with the help of a hashing functio

What is the use of digital switch, What is the use of digital switch? ...

What is the use of digital switch? Digital switch: This is a device which handles digital signals generated at or passed via a telephone company’s central office further

Why stored program control gains superiority over hard wired, In what way i...

In what way is stored program control superior to hard wired control? The SPC gains superiority over hard wired because of following points: SP C Ha

A graph ''g'' with ''n'' nodes is bipartite, A graph 'G' with 'n' nodes is ...

A graph 'G' with 'n' nodes is bipartite if it have  no cycle of odd length.

Analysis of merge sort, i) The width of the sorting + merging circuit is eq...

i) The width of the sorting + merging circuit is equivalent to maximum number of devices needed in a phase is O(n/2). As in the above diagram maximum number of devices for a given

Assembly Language, Write an assembly program to simulate a microwave

Write an assembly program to simulate a microwave

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd