×
Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 3.3 - Problem 11e
Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 3.3 - Problem 11e

×

# a) Suppose we have n subsets S1. S2,…, Sn of the set {1,

ISBN: 9780073383095 37

## Solution for problem 11E Chapter 3.3

Discrete Mathematics and Its Applications | 7th Edition

• Textbook Solutions
• 2901 Step-by-step solutions solved by professors and subject experts
• Get 24/7 help from StudySoup virtual teaching assistants

Discrete Mathematics and Its Applications | 7th Edition

4 5 1 236 Reviews
26
3
Problem 11E

a) Suppose we have n subsets S1. S2,…, Sn of the set {1, 2, …, n}. Express a brute-force algorithm that determines whether there is a disjoint pair of these subsets. [Hint: The algorithm should loop through the subsets: for each subset Si, it should then loop through all other subsets: and for each of these other subsets Sj, it should loop through all elements k in Si, to determine whether k also belongs to Sj.]________________b) Give a big-O estimate for the number of times the algorithm needs to determine whether an integer is in one of the subsets.

Step-by-Step Solution:

Solution:Step 1In this problem we need to write an algorithm which finds whether there is a disjoint pair of subsets in n subsets of {1, 2, …, n}. We are also asked to find the big-O estimate for the number of times the algorithm computes if an integer is in one of the subsets.

Step 2 of 3

Step 3 of 3

##### ISBN: 9780073383095

Since the solution to 11E from 3.3 chapter was answered, more than 530 students have viewed the full step-by-step answer. The answer to “a) Suppose we have n subsets S1. S2,…, Sn of the set {1, 2, …, n}. Express a brute-force algorithm that determines whether there is a disjoint pair of these subsets. [Hint: The algorithm should loop through the subsets: for each subset Si, it should then loop through all other subsets: and for each of these other subsets Sj, it should loop through all elements k in Si, to determine whether k also belongs to Sj.]________________b) Give a big-O estimate for the number of times the algorithm needs to determine whether an integer is in one of the subsets.” is broken down into a number of easy to follow steps, and 99 words. The full step-by-step solution to problem: 11E from chapter: 3.3 was answered by , our top Math solution expert on 06/21/17, 07:45AM. This full solution covers the following key subjects: Subsets, should, Algorithm, Loop, whether. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095.

#### Related chapters

Unlock Textbook Solution