Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
16 views2 pages

ACSE0306 Discrete Structures Assignment 1

This document is an assignment from NOIDA Institute of Engineering and Technology for the subject Discrete Structures. It contains 10 questions mapped to the course outcome of applying basic principles of sets, relations, and functions. The questions cover topics like sets, relations, functions, equivalence relations, recurrence relations, and mathematical induction. Students are asked to solve problems related to sets, relations, functions and apply mathematical induction to prove divisibility.

Uploaded by

Aditya Narayan Singh
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
16 views2 pages

ACSE0306 Discrete Structures Assignment 1

This document is an assignment from NOIDA Institute of Engineering and Technology for the subject Discrete Structures. It contains 10 questions mapped to the course outcome of applying basic principles of sets, relations, and functions. The questions cover topics like sets, relations, functions, equivalence relations, recurrence relations, and mathematical induction. Students are asked to solve problems related to sets, relations, functions and apply mathematical induction to prove divisibility.

Uploaded by

Aditya Narayan Singh
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/ 2

NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY,

GREATER NOIDA (An Autonomous Institute)

Course & Branch-B.TECH / CSE Semester/Section: III/B+C


Subject Name: Discrete Structures Subject Code: ACSE0306
Faculty Name: Aditya Narayan Singh
Assignment Given Date: 25 Sep 2023
Assignment Submission Date: 30 Sep 2023
Assignment-1
CO-1: Apply the basic principles of sets, relations & functions, and mathematical
induction in computer science & engineering related problems.

Mark Mapped
S. No. Questions
s with CO
Q. 1 Differentiate between equal and equivalent sets with an (1) CO1
example.
Q. 2 Let A ={w, x, y, z}, B ={x, y, z}, C={x,y} and D={y,z} (1) CO1
R is a relation from A to B
R = {(w,y),(x,x),(x,y),(y,z)}
S is a relation from C to D.
S = {(x,y),(y,z)}
Find Rc, R ∪ S, R ∩ S and R – S.
(Complement, Union, Intersection and Difference
respectively)
Q. 3 Apply matrix method to find Transitive closure. (1) CO1
A = {4, 6, 8, 10}
R = {(4, 4),(4, 10),(6, 6),(6, 8),(8, 10)}
Q. 4 Explain Equivalence relation with a suitable example. (1) CO1
Q. 5 Consider f,g,h on all functions on integers. (1) CO1
F(n) = n², g(n) = n+1, h(n) = n-1
Find a) hofog b) gofoh c) fogoh
Q. 6 Let A = {2, 3, 4} B = {3, 4, 5} . List the elements of (1) CO1
each relation R defined below and the domain and range.
a) a ∈ A is related to b ∈ B, that is aRb if and only if a <
b.
b) a ∈ A is related to b ∈ B , that is aRb if a and b are
both odd numbers.

Page 1 of 2
Q. 7 A drawer contains 12 red and 12 blue socks, all (1) CO1
unmatched. A person takes socks out at random in the
dark. How many socks must he take out to be sure that he
has at least two blue socks?
a) 18
b) 35
c) 28
d) 14
Q. 8 There are 38 different time periods during which classes (1) CO1
at a university can be scheduled. If there are 677 different
classes, what is the minimum number of
different rooms that will be needed?
Q. 9 Using the principle of mathematical induction, prove that (1) CO1
72n + 23n-3. 3n-1 is divisible by 25 for all n ∈ N.
Q. 10 Find the solution of given recurrence relation, (1) CO1
an - 6 an-1 + 8 an-2 = 3n where a0 =3, a1 =7.

Page 2 of 2

You might also like