Binary Search Steps

Defne power set and write

P(A), if A = {1,5,7,9} (2 marks )

The power set of a set A is the set of all possible subsets of A, including the empty set and A itself. If a set A has n elements, then its
power set P (A) will have 2n elements.

Given A = {1, 5, 7, 9}, we have four elements in A, so the power set P (A) will contain 24 = 16 subsets.

Power Set P (A):

P (A) = { ∅, {1}, {5}, {7}, {9}, {1, 5}, {1, 7}, {1, 9}, {5, 7}, {5, 9}, {7, 9}, {1, 5, 7}, {1, 5, 9}, {1, 7, 9}, {5, 7, 9}, {1, 5, 7, 9} }

Write the truth table for conjuction and disjunction. (2 marks )

Truth Table for Conjunction (AND)

In conjunction, the result is true only if both statements are true.

P Q P ∧Q
T T T

T F F

F T F

F F F

Truth Table for Disjunction (OR)

In disjunction, the result is true if at least one of the statements is true.

P Q P ∨Q
T T T

T F T

F T T

F F F

Define one – one and onto function and also give an example. (2 marks )

One-to-One Function (Injective)

A function f : A → B is called one-to-one or injective if each element of set A maps to a unique element in set B . In other words, if
f (a1 ) = f (a2 ), then a1 = a2 .
​ ​ ​ ​

Example: Let f (x) = 2x where f : R → R. This function is one-to-one because each input x maps to a unique output 2x, and no two
different x-values produce the same f (x)-value.

Onto Function (Surjective)

A function f : A → B is called onto or surjective if every element in set B has a preimage in set A. In other words, for every b ∈ B ,
there exists at least one a ∈ A such that f (a) = b.

Example: Let f (x) = x + 1 where f : R → R. This function is onto because, for any y ∈ R, we can find an x = y − 1 such that
f (x) = y .

If A = {1,3,5,6}, B = {9,0,8}. Find A x B (2 marks )

The Cartesian product A × B of two sets A and B is the set of all ordered pairs (a, b) where a ∈ A and b ∈ B .

1/4
Given:

A = {1, 3, 5, 6} and B = {9, 0, 8}

Cartesian Product A × B :

A × B = {(1, 9), (1, 0), (1, 8), (3, 9), (3, 0), (3, 8), (5, 9), (5, 0), (5, 8), (6, 9), (6, 0), (6, 8)}

This Cartesian product has 4 × 3 = 12 elements, as each element in A pairs with each element in B .

5. Show that the statement is a tautology using truth table,

[(p -> q) conjunction (q -> r)] -> (p -> r) (6 marks)

To show that the statement [(p → q) ∧ (q → r)] → (p → r) is a tautology, we will use a truth table. A tautology is a statement that
is true for all possible truth values of its variables.

Statement

[(p → q) ∧ (q → r)] → (p → r)

Truth Table
We'll start by calculating each component in the expression:

1. p→q
2. q→r
3. (p → q) ∧ (q → r)
4. p→r
5. [(p → q) ∧ (q → r)] → (p → r)

p q r p→q q→r (p → q) ∧ (q → r) p→r [(p → q) ∧ (q → r)] → (p → r)

T T T T T T T T

T T F T F F F T

T F T F T F T T

T F F F T F F T

F T T T T T T T

F T F T F F T T

F F T T T T T T

F F F T T T T T

Explanation
In the final column, we see that [(p → q) ∧ (q → r)] → (p → r) is true in all cases.

Conclusion
Since the statement is true for all possible truth values of p, q , and r , it is a tautology.

Construct the truth table for

[(p <-> q) <-> (r <-> s)] (14 marks)

To construct the truth table for the statement [(p ↔ q) ↔ (r ↔ s)], we need to evaluate each component:
1. p↔q
2. r↔s
3. (p ↔ q) ↔ (r ↔ s)

2/4
The biconditional p↔ q is true if p and q have the same truth value (both true or both false). Similarly, (p ↔ q) ↔ (r ↔ s) is true if
both p ↔ q and r ↔ s have the same truth value.

Let's set up the truth table with all possible truth values for p, q , r , and s:

p q r s p↔q r↔s (p ↔ q) ↔ (r ↔ s)
T T T T T T T

T T T F T F F

T T F T T F F

T T F F T T T

T F T T F T F

T F T F F F T

T F F T F T F

T F F F F T T

F T T T F T F

F T T F F F T

F T F T F T F

F T F F F T T

F F T T T T T

F F T F T F F

F F F T T F F

F F F F T T T

Explanation
Each row shows the truth values for p, q , r , and s along with the values of p ↔ q , r ↔ s, and the final expression (p ↔ q) ↔ (r ↔
s).

Darken the area in the ven diagram for

E – A , A intersection B intersection C (2 marks)

To represent the regions E − A and A ∩ B ∩ C on a Venn diagram, let's clarify each region:
1. E − A:
This is the area in the universal set E but outside the set A.

In a Venn diagram, this would be the entire region of E excluding the area occupied by A.

2. A ∩ B ∩ C:
This is the intersection of sets A, B , and C , meaning the area where all three sets overlap.

In a Venn diagram, this is typically the central overlapping region where A, B , and C all meet.

Instructions for Darkening the Areas:

1. Darken the region outside A within E to represent E − A.
2. Darken the central overlap between A, B , and C to show A ∩ B ∩ C.

Visual Representation
The Venn diagram would have three overlapping circles labeled A, B , and C within a rectangle representing the universal set E .
Follow these steps:

Shade the area outside circle A in E for E − A.

Shade the central overlapping region where all three circles A, B , and C intersect for A ∩ B ∩ C.

3/4
This shading will clearly display the regions E − A and A ∩ B ∩ C on the Venn diagram.

give me a diagram

Here is the Venn diagram showing the regions E − A (outside A but within E ) and A ∩ B ∩ C (the central overlap of A, B , and C ).

4/4