Scribd
Upload
9 views2 pages

Module 4 - Tutorial Sheet

Uploaded by

Abhinav v
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views2 pages

Module 4 - Tutorial Sheet

Uploaded by

Abhinav v
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Module 4 – Tutorial Sheet

Level: Easy

1. Let 𝐷120 denote the set of all divisors of 120. Let R be the relation defined by 𝑎𝑅𝑏 iff a divides b.
Draw the Hasse diagram for the relation. Prove that (𝐷120 , ≤) where ≤ denotes divisibility is a
lattice.
2. Determine whether the POSET with the Hasse diagram is a lattice.

3. Find the sum of product canonical form and product of sum canonical forms of the Boolean
function 𝐹(𝑥, 𝑦, 𝑧, 𝑤) = 𝑥𝑦 + 𝑦𝑧′ + 𝑧𝑤 without using the truth table.
4. Let S be the set of all strings of English letters. Determine whether the relation given by R={(a,b)|
a and b have no letters in common} is reflexive, symmetric, antisymmetric and/or transitive.
5. Write the relation shown in the directed graph and check whether it is a lattice

6. Let 𝐷128 denote the set of all divisors of 128. Let R be the relation defined by 𝑎𝑅𝑏 iff a divides b.
Draw the Hasse diagram for the relation. Check whether (𝐷128 , ≤) where ≤ denotes divisibility is
totally ordered.

Level: Moderate

1. Let 𝑍 denotes the set of all positive integers and 𝑅 be a relation on 𝑍 × 𝑍 defined by (𝑎, 𝑏)𝑅(𝑐, 𝑑)
if and only if 𝑎𝑏 is a perfect square, verify the following properties on the relation 𝑅: (a) Reflexive
(b) Symmetric (c) Antisymmetric (d) Transitive
2. A relation 𝑅 on the set 𝐴 = {1,2,3,4,5} is defined by 𝑅 = {(𝑎, 𝑏)|𝑎, 𝑏 ∈ 𝐴 𝑎𝑛𝑑 𝑥 < 𝑦}. Determine
whether 𝑅 is a partial order relation or not.
3. If 𝑍 + is the set of all positive integers and 𝐷 denotes the relation of division in 𝑍 + such that for any
𝑎, 𝑏 ∈ 𝑍 + , 𝑎𝐷𝑏 if and only if 𝑎 divides 𝑏, show that {𝑍 + , 𝐷} is a Lattice.
70
4. If 𝑎, 𝑏 ∈ 𝑆70 , the divisors of 70 and 𝑎 + 𝑏 = 𝐿𝐶𝑀(𝑎, 𝑏); 𝑎. 𝑏 = 𝐺𝐶𝐷(𝑎, 𝑏) and 𝑎′ = , Show that
𝑎
{𝑆70 , +, . ,′ , 1, 70} is a Boolean Algebra.
5. Find the Sum of Products and Product of Sums for the following Boolean Expressions
(a) 𝑓(𝑥, 𝑦, 𝑧) = (𝑦𝑧 + 𝑥𝑧 ′ )(𝑥𝑦 ′ + 𝑧)′ (𝑏)𝑓(𝑥, 𝑦, 𝑧) = (𝑥 + 𝑧)𝑦
Level: Hard

1. Consider the set 𝑆42 of all divisors of 42 and let 𝑅 = {(𝑎, 𝑏): 𝑏 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑎} be a relation. Verify if
(𝑆42 , 𝑅) is a poset. If it is a poset then draw the Hasse diagram for (𝑆42 , 𝑅).
2. Consider the following sets: 𝑆0 = {𝑎}, 𝑆1 = {𝑎, 𝑏}, 𝑆2 = {𝑎, 𝑐}, 𝑆3 = {𝑎, 𝑏, 𝑐},
𝑆4 = {𝑎, 𝑏, 𝑐, 𝑒}, 𝑆5 = {𝑎, 𝑏, 𝑐, 𝑑, 𝑒}, 𝑆6 = {𝑎, 𝑏, 𝑐, 𝑒, 𝑓}, 𝑎𝑛𝑑 𝑆7 = {𝑎, 𝑏, 𝑐, 𝑑, 𝑒, 𝑓}.
Find whether (𝐿, 𝑅) is a lattice or not, where 𝐿 = {𝑆0 , 𝑆1 , 𝑆2 , 𝑆3 , 𝑆4 , 𝑆5 , 𝑆6 , 𝑆7 } and
𝑅 = {(𝐴, 𝐵): 𝐵 𝑖𝑠 𝑎 𝑠𝑢𝑏𝑠𝑒𝑡 𝑜𝑓 𝐴}. If it is a Lattice then find the GLB and LUB for {𝑆0 , 𝑆1 , 𝑆6 } and
{𝑆0 , 𝑆5 }.
3. Consider the process of building a house, where each task must be completed in a specific order.
The relationships between the tasks are represented in a Hasse diagram, which shows the
dependencies between tasks (i.e., a task can only begin when all tasks below it in the diagram are
complete). Based on the given Hasse diagram do the followings:
a. Schedule the tasks in the correct order, starting with the tasks that can be done first and progressing
to those that depend on prior tasks.
b. List all the unrelated task pairs from the Hasse diagram. These are pairs of tasks where neither task
depends on the other (𝑖. 𝑒., there is no direct or indirect order between them).

4. Find the output of the combinational circuit given in the following figure and design a simpler circuit
having the same output.

5. Find the PDNF and PCNF for the Boolean expression 𝑓(𝑥, 𝑦, 𝑧) = (𝑦𝑧 + 𝑥𝑧′)(𝑥𝑦 ′ + 𝑧)′ using
logical laws.

You might also like