Scribd
Upload
68 views1 page

Assignment 3 (30april)

This document outlines an assignment for a discrete structures course. The assignment contains 3 questions. Question 1 asks students to write down set identities and De Morgan's laws. Question 2 asks students to prove set identities using 4 different techniques by providing 2 examples for each. Question 3 asks students to represent sets using bit strings and perform set operations on the binary representations.

Uploaded by

Malik Ravel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
68 views1 page

Assignment 3 (30april)

This document outlines an assignment for a discrete structures course. The assignment contains 3 questions. Question 1 asks students to write down set identities and De Morgan's laws. Question 2 asks students to prove set identities using 4 different techniques by providing 2 examples for each. Question 3 asks students to represent sets using bit strings and perform set operations on the binary representations.

Uploaded by

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

School of System and Technology

Department of Computer Science


Course Code: CC1041 Semester: 2nd
Title: Discrete Structures Total Marks: 10
Resourse Person: Dr. Muhammad Kabir Student Name:
Student ID:

Assignment-3
Q1: Write down set Identities and De Morgan’s Laws for Sets.
Q2: In order to prove set identities, we have the following four techniques given below:
1. Mutual Subsets method.
2. Set builder notation & logical equivalences method.
3. Membership table method.
4. Venn diagram method.
You need to consider two examples for each method and prove set identities with these methods.

Q3: As we know, computers can process only binary data internally. How can we
represent sets in a bit string form?
Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, and the ordering of elements of U has the elements
in increasing order, then S1 = {1, 2, 3, 4, 5} and S2 = {1, 3, 5, 7, 9}.
i. Find out B1 and B2 (B1 and B2 should be in bit string format) for S 1 and S2
respectively.
ii. Union of S1 and S2
iii. Intersection of S1 and S2
iv. Complement of S1 and S2
v. AND of B1 and B2
vi. OR of B1 and B2
vii. Complement of B1 and B2

Instructions:
1. Each expression should be clearly mentioned with its given number in your answer.
2. Make a Title page and mention your details (including Name, Registration no.
Section ID, Title of the assignment etc.).
3. Don’t copy from others.
4. Submit your assignment to the LMS in MS-word or PDF format.
5. Deadline can be checked on your LMS.

You might also like