Differentiate aggregation and containment, Computer Engineering

Aggregation is the relationship among the whole and a part. We can add/subtract some properties in the part (slave) side. It won't affect the entire part.

Best example is Car, which haves the wheels and some extra parts. Even though the parts are not there we can call it as car.

But, in the case of containment the entire part is affected when the part within that got affected. The human body is an apt example for this relationship. When the entire body dies the parts (heart etc) are died.         



Posted Date: 4/4/2013 5:27:53 AM | Location : United States

Related Discussions:- Differentiate aggregation and containment, Assignment Help, Ask Question on Differentiate aggregation and containment, Get Answer, Expert's Help, Differentiate aggregation and containment Discussions

Write discussion on Differentiate aggregation and containment
Your posts are moderated
Related Questions
what are the applications of microprogramming

HOW TO WORK IN DREAMWEAVER? How and Where to open Dreamweaver? Step 1: Click on Start Step 2: Select Program Step 3: Select Macromedia Dreamweaver Step 4: Click on

Explain briefly Loop-invariant code motion of the commonly used code optimization techniques. Loop-invariant code motion If a quantity is calculated inside a loop duri

The implementation of a (non-recursive) binary search of an array. The assumption is that a given array is sorted. We want to see if a particular value, that we'll call the target

The EFI community has formed an open source shell environment. Rather than booting directly into a full OS, on some executions, the user can boot to the EFI shell. The shell is an

Concept of Multithreading: These troubles increase in the design of large-scale multiprocessors such as MPP as discussed above. Thus, a solution for optimizing this latency should

Explain difference between Dynamic and static binding. Dynamic and static binding: Dynamic binding is a binding performed after the execution of a program has immediately beg

A* Search - artificial intelligence: A* search in the combines is the best parts of uniform cost search, namely the fact that it's optimal and complete, and the other best par

Why some languages are not decidable or even Turing - recognizable?  The  reason  that  there  are  uncountable  many  languages  yet  only  countably many  Turing  machines.

First-Order Inference Rules: Here now we have a clear definition of a first-order model is that we can define soundness for first-order inference rules in the same way such we