SHRI G.S.

INSTITUTE OF TECHNOLOGY &SCIENCE, INDORE

Department of Information Technology

B.Tech II Year

Subject Code: IT28501

Subject Nomenclature: DISCRETE STRUCTURES

Session: 2023-2024 Semester: B

ASSIGNMENT 1

Assignment: Introduction, Sets, Relations, and Functions

Question CO Description
Define a set and provide examples of a finite set, an infinite set, and an
CO1
1 uncountable infinite set.
CO1 Given sets A = {1, 2, 3} and B = {2, 3, 4}, find the union and intersection
2 of sets A and B.
CO3 Prove the statement using mathematical induction: "For all positive
3 integers n, 1 + 2 + 3 + ... + n = n(n + 1)/2."
Apply the principle of inclusion and exclusion to find the number of
CO1 elements in the union of sets A, B, and C, where |A| = 5, |B| = 4, |C| = 6, |A
4 ∩ B| = 2, |B ∩ C| = 3, |A ∩ C| = 4, and |A ∩ B ∩ C| = 1.
CO1 Define multi-sets and provide an example with at least three elements,
5 indicating multiplicities.
CO1 Explain the relational model for databases and its significance in data
6 management.
CO1 Given the set X = {1, 2, 3} and Y = {2, 3, 4}, determine whether the
7 relation R = {(x, y) Reflexive, Symmetric, Transitive.
CO1 Define equivalence relations and partitions. Provide an example of an
8 equivalence relation and its corresponding partition.
CO1 Discuss the concept of partial ordering relations and lattices. Provide an
9 example illustrating chains and anti-chains.
Solve the job scheduling problem: You have four tasks (A, B, C, D) with
CO1 respective durations (in hours) of 5, 3, 8, and 2. Find the optimal order to
10 minimize the total completion time.

Question Answer
1 Theory:<br> - Finite set: �={1,2,3}A={1,2,3}<br> - Infinite
Question Answer
set: �={1,2,3,…}B={1,2,3,…}<br> - Uncountable infinite
set: Real numbers between 0 and 1
Numerical:<br> - Union of sets A and B:
�∪�={1,2,3,4}A∪B={1,2,3,4}<br> - Intersection of sets A
2 and B: �∩�={2,3}A∩B={2,3}
Theory:<br> - Proof by mathematical induction provided in the
3 question.
4 Numerical:<br> - (
Theory:<br> - Multi-set example:
5 �={1,2,2,3,3,3}A={1,2,2,3,3,3}
Theory:<br> - The relational model for databases is a theoretical
6 framework for managing data using tables (relations).
Numerical:<br> - Reflexive: No, Symmetric: No, Transitive: Yes
7 (explained in the question)
Theory:<br> - Equivalence relation example: �={(1,1),(2,2),
(3,3)}R={(1,1),(2,2),(3,3)}<br> - Corresponding partition:
8 {{1},{2},{3}}{{1},{2},{3}}
Theory:<br> - Partial ordering relations and lattices explained
9 with an example illustrating chains and anti-chains.
Numerical:<br> - Optimal order: D (2 hours), B (3 hours), A (5
10 hours), C (8 hours)