3. [15] The abstract data type (ADT) Set(Elm) represent sets. Accordingly, the following is a possible set of operators: new: Set set: Elm Set in: Set x Elm→ Bool empty: Set →Bool count: SetInteger delete: Set x Elm Set create a new, empty set create a singleton set true iff a value is in a set true iff the set is empty returns the number of values in the set removes a value from a set intersect: Set x Set Set returns the intersection of two sets union: Set x Set Set returns the union of two sets with no duplicate values (a) [5] Identify between the operators enumerated above a minimal set of constructors and justify your choice. (b) [10] Provide axioms for the operators empty, count, and delete.
3. [15] The abstract data type (ADT) Set(Elm) represent sets. Accordingly, the following is a possible set of operators: new: Set set: Elm Set in: Set x Elm→ Bool empty: Set →Bool count: SetInteger delete: Set x Elm Set create a new, empty set create a singleton set true iff a value is in a set true iff the set is empty returns the number of values in the set removes a value from a set intersect: Set x Set Set returns the intersection of two sets union: Set x Set Set returns the union of two sets with no duplicate values (a) [5] Identify between the operators enumerated above a minimal set of constructors and justify your choice. (b) [10] Provide axioms for the operators empty, count, and delete.
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter13: Overloading And Templates
Section: Chapter Questions
Problem 15PE
Related questions
Question
100%
![3. [15] The abstract data type (ADT) Set(Elm) represent sets. Accordingly, the following is a
possible set of operators:
new: Set
set: Elm Set
in: Set x Elm→ Bool
empty: Set →Bool
count: SetInteger
delete: Set x Elm Set
create a new, empty set
create a singleton set
true iff a value is in a set
true iff the set is empty
returns the number of values in the set
removes a value from a set
intersect: Set x Set
Set
returns the intersection of two sets
union: Set x Set
Set
returns the union of two sets with no duplicate values
(a) [5] Identify between the operators enumerated above a minimal set of constructors and
justify your choice.
(b) [10] Provide axioms for the operators empty, count, and delete.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F4fdf3cae-9238-4496-a0e6-492129671272%2F594c6856-a1c9-4352-a946-ab9d8f18d2f8%2F5nnexae_processed.png&w=3840&q=75)
Transcribed Image Text:3. [15] The abstract data type (ADT) Set(Elm) represent sets. Accordingly, the following is a
possible set of operators:
new: Set
set: Elm Set
in: Set x Elm→ Bool
empty: Set →Bool
count: SetInteger
delete: Set x Elm Set
create a new, empty set
create a singleton set
true iff a value is in a set
true iff the set is empty
returns the number of values in the set
removes a value from a set
intersect: Set x Set
Set
returns the intersection of two sets
union: Set x Set
Set
returns the union of two sets with no duplicate values
(a) [5] Identify between the operators enumerated above a minimal set of constructors and
justify your choice.
(b) [10] Provide axioms for the operators empty, count, and delete.
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning

C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr

Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,

C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning

C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr

Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,

Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning

New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:
9781305503922
Author:
Patrick M. Carey
Publisher:
Cengage Learning
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage