Software Generalist

Sets are objects that contain other objects, called elements which may be sets themselves. This can be illustrated on the following UML static class and object diagrams:

The cardinal number (cardinality) of a set is the number of its elements in the case of finite sets.  

Here A, B, SB and SC belong to SA set, C belongs to SB set and SC set is the empty set ø. In bracketed set-theoretic notation we have:

SA = {A, B, SB, SC} = {A, B, {C}, {}}

Card(SA) = 4
Card(SB) = 1
Card(SC) = 0

Note: the empty set ø = {} is a subset of any set and this is not shown on diagrams above.

- Dmitry Vostokov @ SoftwareGeneralist.com -Â

           

Announcements

Coming Soon:

Management Bits: An Anthology from Reductionist Manager

Crash Dump Analysis: Practical Foundations (Windows Edition, Systematic Software Fault Analysis Series)

Debugging Notebook: Essential Concepts, WinDbg Commands and Tools

Crash Dump Analysis for System Administrators and Support Engineers

New Magazines:

Debugged! MZ/PE: MagaZine for/from Practicing Engineers

New Books:

Memory Dump Analysis Anthology: Color Supplement for Volumes 1-3

Memory Dump Analysis Anthology, Volume 3

First Fault Software Problem Solving: A Guide for Engineers, Managers and Users

x64 Windows Debugging: Practical Foundations

Also available:

Windows Debugging: Practical Foundations

DLL List Landscape: The Art from Computer Memory Space

Dumps, Bugs and Debugging Forensics: The Adventures of Dr. Debugalov

WinDbg: A Reference Poster and Learning Cards

Memory Dump Analysis Anthology, Volume 2

Memory Dump Analysis Anthology, Volume 1

New Children's Book:

Baby Turing

This entry was posted on Tuesday, February 10th, 2009 at 4:56 pm and is filed under Software and Mathematics, Uses of UML. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.