πŸŽ“ Computer Science & Engineering Portal

Master Engineering Disciplines with Structured Notes

Comprehensive academic lecture notes, exam-oriented unit summaries, laboratory manuals, and previous year question papers designed strictly for university students.

πŸ“‘

University Syllabi

AKTU & AICTE aligned semester guidelines.

πŸ“

Exam Question Papers

Previous 5 years solved university papers.

πŸ’‘

Lab Manuals & Viva

Practical codes with outputs & interview Qs.

Core Subjects & Units Hub

Click on any specific unit to immediately view its lecture notes below

Viewing All Lectures

Multisets

A multiset is an unordered collection of elements, in which the multiplicity of an element may be one or more than one or zero. The multiplicity of an element is the number of times the element repeated in the multiset. In other words, we can say that an element can appear any number of times in a set.

Example:

  1. A = {l, l, m, m, n, n, n, n}  
  2. B = {a, a, a, a, a, c}  

Operations on Multisets

1. Union of Multisets: The Union of two multisets A and B is a multiset such that the multiplicity of an element is equal to the maximum of the multiplicity of an element in A and B and is denoted by A βˆͺ B.

Example:

  1. Let A = {l, l, m, m, n, n, n, n}  
  2.     B = {l, m, m, m, n},   
  3. A βˆͺ B = {l, l, m, m, m, n, n, n, n}  

2. Intersections of Multisets: The intersection of two multisets A and B, is a multiset such that the multiplicity of an element is equal to the minimum of the multiplicity of an element in A and B and is denoted by A ∩ B.

Example:

  1. Let A = {l, l, m, n, p, q, q, r}  
  2.     B = {l, m, m, p, q, r, r, r, r}  
  3. A βˆ© B = {l, m, p, q, r}.  

3. Difference of Multisets: The difference of two multisets A and B, is a multiset such that the multiplicity of an element is equal to the multiplicity of the element in A minus the multiplicity of the element in B if the difference is +ve, and is equal to 0 if the difference is 0 or negative

Example:

  1. Let A = {l, m, m, m, n, n, n, p, p, p}  
  2.     B = {l, m, m, m, n, r, r, r}  
  3. A - B = {n, n, p, p, p}  

4. Sum of Multisets: The sum of two multisets A and B, is a multiset such that the multiplicity of an element is equal to the sum of the multiplicity of an element in A and B

Example:

  1. Let A = {l, m, n, p, r}  
  2.     B = {l, l, m, n, n, n, p, r, r}  
  3. A + B = {l, l, l, m, m, n, n, n, n, p, p, r, r, r}  

5. Cardinality of Sets: The cardinality of a multiset is the number of distinct elements in a multiset without considering the multiplicity of an element

Example:

  1. A = {l, l, m, m, n, n, n, p, p, p, p, q, q, q}  

The cardinality of the multiset A is 5.

Ordered Set

It is defined as the ordered collection of distinct objects.

Example:

  1. Roll no {3, 6, 7, 8, 9}  
  2. Week Days {S, M, T, W, W, TH, F, S, S}  

Ordered Pairs

An Ordered Pair consists of two elements such that one of them is designated as the first member and other as the second member.

(a, b) and (b, a) are two different ordered pair. An ordered triple can also be written regarding an ordered pair as {(a, b) c}

An ordered Quadrable is an ordered pair {(((a, b), c) d)} with the first element as ordered triple.

An ordered n-tuple is an ordered pair where the first component is an ordered (n - 1) tuples, and the nth element is the second component.

  1. {(n -1), n}  

Example:

Multisets

Labels: ,

Discussion & Queries (<$I18NNumComments$>):

<$CommentPager$>
<$I18NAtCommentTimeWithPermalink$>, <$I18NCommentAuthorSaid$>

<$BlogCommentBody$>

<$BlogCommentDeleteIcon$>
<$CommentPager$>