irst: make a menu list as you find suitable, three main options for the question ake suboptions for each one to perform the requirements. econd: you must add option to read from a file at the beginning rather than mal ter the values to save time. (the file format/order is up to you). hird: submit compressed folder (the code, input file, and PDF for screenshots) 1. Find the number of of injections (one to one) and surjections (onto function) ontaining n elements to a set B containing m elements. 2. Implement The Chinese Remainder Theorem. Print the intermediate steps of

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

 

 

Write a C++ program to implement the following with the specified input and output:
First: make a menu list as you find suitable, three main options for the questions, and then
make suboptions for each one to perform the requirements.
Second: you must add option to read from a file at the beginning rather than make the user to
enter the values to save time. (the file format/order is up to you).
Third: submit compressed folder (the code, input file, and PDF for screenshots).
Q1. Find the number of of injections (one to one) and surjections (onto function) from a set A
containing n elements to a set B containing m elements.
Q2. Implement The Chinese Remainder Theorem. Print the intermediate steps of the Theorem
before printing the result of it.
Q3. Fuzzy sets are used in artificial intelligence. Each element in the universal set U has a
degree of membership, which is a real number between 0 and 1 (including 0 and 1), in a fuzzy
set S. The fuzzy set S is denoted by listing the elements with their degrees of membership
(elements with 0 degree of membership are not listed).
For example:
A = {0.2a, 0.4b, 0.3c, 0.9d, 0.7e}
B = {0. 9a, 0. 6b, 0.5c, 0. 8d, 0.9e}
Assume the size of each set is 10 variables(a-j).
For the set A, a has a 0.2 degree of membership in A, b has a 0.4 degree of membership in A, c
has a 0.3 degree of membership in A, d has 0.9 degree
of membership in A, and e has a 0.7 degree of membership in A.
• The complement of a fuzzy set S is the set S, with the degree of the membership of an
element in S equal to 1 minus the degree of membership of this element in S.
• The intersection of two fuzzy sets S and T is the fuzzy set SnT, where the degree of
membership of an element in SnT is the minimum of the degrees of membership of
this element in S and in T.
• The difference between two fuzzy sets S and T' is the fuzzy set S-T, where the degree
of membership of an element in S-T is the minimum of the degrees of membership of
this element in S and 1 minus the degree of membership of this element in T.
• The union of two fuzzy sets S and T is the fuzzy set S UT, where the degree of
membership of an element in S U T is the maximum of the degrees of membership of
this element in S and in T.
Find the following:
1) AUB
2) B- A
Transcribed Image Text:Write a C++ program to implement the following with the specified input and output: First: make a menu list as you find suitable, three main options for the questions, and then make suboptions for each one to perform the requirements. Second: you must add option to read from a file at the beginning rather than make the user to enter the values to save time. (the file format/order is up to you). Third: submit compressed folder (the code, input file, and PDF for screenshots). Q1. Find the number of of injections (one to one) and surjections (onto function) from a set A containing n elements to a set B containing m elements. Q2. Implement The Chinese Remainder Theorem. Print the intermediate steps of the Theorem before printing the result of it. Q3. Fuzzy sets are used in artificial intelligence. Each element in the universal set U has a degree of membership, which is a real number between 0 and 1 (including 0 and 1), in a fuzzy set S. The fuzzy set S is denoted by listing the elements with their degrees of membership (elements with 0 degree of membership are not listed). For example: A = {0.2a, 0.4b, 0.3c, 0.9d, 0.7e} B = {0. 9a, 0. 6b, 0.5c, 0. 8d, 0.9e} Assume the size of each set is 10 variables(a-j). For the set A, a has a 0.2 degree of membership in A, b has a 0.4 degree of membership in A, c has a 0.3 degree of membership in A, d has 0.9 degree of membership in A, and e has a 0.7 degree of membership in A. • The complement of a fuzzy set S is the set S, with the degree of the membership of an element in S equal to 1 minus the degree of membership of this element in S. • The intersection of two fuzzy sets S and T is the fuzzy set SnT, where the degree of membership of an element in SnT is the minimum of the degrees of membership of this element in S and in T. • The difference between two fuzzy sets S and T' is the fuzzy set S-T, where the degree of membership of an element in S-T is the minimum of the degrees of membership of this element in S and 1 minus the degree of membership of this element in T. • The union of two fuzzy sets S and T is the fuzzy set S UT, where the degree of membership of an element in S U T is the maximum of the degrees of membership of this element in S and in T. Find the following: 1) AUB 2) B- A
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Database connectivity
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education