S.D.

COLLEGE OF ENGINEERING & TECHNOLOGY, MUZAFFARNAGAR

Department of Computer Science and Engineering

ASSIGNMENT/TUTORIAL
Session:2024-25 Semester:III

Program: B.Tech Branch: CS

Course: Discrete Structures & Theory of Logic Code: BCS 303

Date of Assignment: __________________ Date of submission: ______________

Course outcomes:
At the end of this course students will demonstrate the ability to:
1. Acquire Knowledge of sets and relations for solving the problems of POSET and lattices.
2. Apply fundamental concepts of functions and Boolean algebra for solving the problems of logical abilities.
3. Employ the rules of propositions and predicate logic to solve the complex and logical problems.
4. Explore the concepts of group theory and their applications for solving the advance technological problems.
5. Illustrate the principles and concepts of graph theory for solving problems related to computer
science.

Assignments-I
LONG ANSWER QUESTIONS

1. Draw the Hasse’s diagram of the POSET (L,), where L = {S0, S1, S2, S3, S4, S5, S6,
S7}, where the sets are given by S0 = {a,b,c,d,e,f}, S1 = {a,b,c,d,e} , S2 = {a,b,c,e,f},
S3 = {a,b,c,e}, S4 = {a,b,c} , S5 = {a,b} , S6 = {a,c} , S7 = {a}
2. Identify whether the each of the following relations defined on the set X = {1,2,3,4} are reflexive,
symmetric, transitive and/or antisymmetric?
(i) R1 = { (1,1), (1,2), (2,1) }
(ii) R2 = { (1,1), (1,2), (1,4), (2,1), (2,2), (3,3), (4,1), (4,4) }
(iii) R3 = { (2,1), (3,1), (3,2), (4,1), (4,2), (4,3) }
3. Justify that for any sets A, B, and C:
i) (A – (A ∩ B)) = A – B
ii) (A – (B ∩ C)) = (A – B) ᴜ (A – C)
4. i) Justify that (D36,\) is lattice.
ii) Let L1 be the lattice defined as D6 and L2 be the lattice (P(S), ≤), where P(S) be the
power set defined on set S= {a, b}. Justify that the two lattices are isomorphic
5. Define complemented lattice and then show that in a distributive lattice, if an element has a
complement then this complement is unique.

____________________
Name & Sign of Faculty
 S.D.COLLEGE OF ENGINEERING & TECHNOLOGY, MUZAFFARNAGAR

Department
Department
Electronics
of Computer
& Communication
Science and Engineering
Engineering

ASSIGNMENT/TUTORIAL
Session: 2024-25 Semester: III

Program: B.Tech Branch: CS

Course: Discrete Structures & Theory of Logic Code: BCS 303

Date of Assignment: __________________ Date of submission: ______________

Course outcomes:
At the end of this course students will demonstrate the ability to:
1. Acquire Knowledge of sets and relations for solving the problems of POSET and lattices.
2. Apply fundamental concepts of functions and Boolean algebra for solving the problems of logical abilities.
3. Employ the rules of propositions and predicate logic to solve the complex and logical problems.
4. Explore the concepts of group theory and their applications for solving the advance technological problems.
5. Illustrate the principles and concepts of graph theory for solving problems related to computer
science.

Assignments-II
LONG ANSWER QUESTIONS

1. State De Morgan’s law and Absorption Law.

2. Justify that “If f: A→B and g: B→C be one-to-one onto functions, then gof is also one to one
onto and (gof)-1= f -1o g -1”
3. Show that a’.[(b’+c)’+ b.c] + [(a+b’)’.c] = a’.b using rules of Boolean Algebra. Where a’ is the
complement of an element a.
4. Let a function is defined as f: R-{3}→ R-{1}, f(x) = (x-1)/(x-3) , then show that f is a bijective
function and also compute the inverse of f. Where R is a set of real numbers.
5. Solve the following Boolean functions using K-map:
(i) F(A,B,C,D) = ∑( m0, m1, m2, m4, m5, m6, m8, m9, m12, m13, m14 )
(ii) F(A,B,C,D)=∑(0,2,5,7,8,10,13,15)

____________________
Name & Sign of Faculty
 S.D.COLLEGE OF ENGINEERING & TECHNOLOGY, MUZAFFARNAGAR

Department of Computer Science and Engineering

ASSIGNMENT/TUTORIAL
Session: 2024-25 Semester: III

Program: B.Tech Branch: CS

Course: Discrete Structures & Theory of Logic Code: BCS 303

Date of Assignment: __________________ Date of submission: ______________

Course outcomes:
At the end of this course students will demonstrate the ability to:
1. Acquire Knowledge of sets and relations for solving the problems of POSET and lattices.
2. Apply fundamental concepts of functions and Boolean algebra for solving the problems of logical abilities.
3. Employ the rules of propositions and predicate logic to solve the complex and logical problems.
4. Explore the concepts of group theory and their applications for solving the advance technological problems.
5. Illustrate the principles and concepts of graph theory for solving problems related to computer
science.

Assignments-III
LONG ANSWER QUESTIONS

1. Identify whether (p Λ q) → (p V q) is tautology or contradiction with using Truth table.

2. Show that the statements P↔Q and (P ⋀ Q) V(⏋P ⋀ ⏋Q) are equivalent.

3. Prove the validity of the following argument.

If Mary runs for office, She will be elected. If Mary attends the meeting, she will run for office.
Either Mary will attend the meeting or she will go to India. But Mary cannot go to India. “Thus
Mary will be elected”.
4. Justify that the following premises are inconsistent.
(i) If Nirmala misses many classes through illness then he fails high school.
(ii) If Nirmala fails high school, then he is uneducated.
(iii) If Nirmala reads a lot of books then he is not uneducated.
(iv) Nirmala misses many classes through illness and reads a lot of books.
5. Construct the truth table for the following statements: i) (P→Q’)→P’ ii) P↔(P’˅Q’).

____________________
Name & Sign of Faculty
 S.D.COLLEGE OF ENGINEERING & TECHNOLOGY, MUZAFFARNAGAR

Department of Computer Science and Engineering

ASSIGNMENT/TUTORIAL
Session: 2024-25 Semester: III

Program: B.Tech Branch: CS

Course: Discrete Structures & Theory of Logic Code: BCS 303

Date of Assignment: __________________ Date of submission: ______________

Course outcomes:
At the end of this course students will demonstrate the ability to:
1. Acquire Knowledge of sets and relations for solving the problems of POSET and lattices.
2. Apply fundamental concepts of functions and Boolean algebra for solving the problems of logical abilities.
3. Employ the rules of propositions and predicate logic to solve the complex and logical problems.
4. Explore the concepts of group theory and their applications for solving the advance technological problems.
5. Illustrate the principles and concepts of graph theory for solving problems related to computer
science.

Assignments-IV
LONG ANSWER QUESTIONS

1. Define the binary operation * on Z by x*y=x + y + 1 for all x,y belongs to set of integers. Verify
that (Z,*) is abelian group? Discuss the properties of abelian group.
2. i) Justify that “The intersection of any two subgroup of a group (G,*) is again a subgroup of
(G,*)”.
3. Let G = {1,-1, 𝑖,-𝑖} with the operation of ordinary multiplication on G be an algebraic structure,
where 𝑖=√-1.
(i) Determine whether G is abelian.
(ii) Determine the order of each element in G.
(iii) Determine whether G is a cyclic group, if G is a cyclic group, then determine the
generator/generators of the group G.
(iv) Determine a subgroup of the group G.
4. Define the binary operation * on Z by x*y=x + y + 1 for all x,y belongs to set of integers. Verify
that (Z,*) is abelian group? Discuss the properties of abelian group.
5. Justify that “If a,b are the arbitrary elements of a group G then (ab)2 = a2b2 if and only if G is
abelian.

____________________
Name & Sign of Faculty
 S.D.COLLEGE OF ENGINEERING & TECHNOLOGY, MUZAFFARNAGAR

Department of Computer Science and Engineering

ASSIGNMENT/TUTORIAL
Session: 2024-25 Semester: III

Program: B.Tech Branch: CS

Course: Discrete Structures & Theory of Logic Code: BCS 303

Date of Assignment: __________________ Date of submission: ______________

Course outcomes:
At the end of this course students will demonstrate the ability to:
1. Acquire Knowledge of sets and relations for solving the problems of POSET and lattices.
2. Apply fundamental concepts of functions and Boolean algebra for solving the problems of logical abilities.
3. Employ the rules of propositions and predicate logic to solve the complex and logical problems.
4. Explore the concepts of group theory and their applications for solving the advance technological problems.
5. Illustrate the principles and concepts of graph theory for solving problems related to computer
science.

Assignments-V
LONG ANSWER QUESTIONS

1. Express the following (i) Euler graph and Hamiltonian graph

(ii) Chromatic number of a graph (iii) Walk and path (iv) Bipartite graph
2. Describe Planar Graph and express Euler’s formula for Planar Graph.

3. Explain Euler’s formula. Determine number of regions if a planar graph has 30 vertices of
degree 3 each.
4. (i) Justify that “In a undirected graph the total number of odd degree vertices is even”.
(ii) Justify that “The maximum number of edges in a simple graph is n(n-1)/2”.
5. Using Pigeonhole principle find the minimum number n of integers to be selected from
S={1,2,3,4,5,6,7,8,9} so that (i) the sum of two of the integers is even (ii) the difference of two
of the n integers is 5

____________________
Name & Sign of Faculty