Scribd
Upload
5 views2 pages

Assignmnt1

The document outlines the assignment plan for the 4th semester CSE course on Discrete Structures at Guru Nanak Dev Engineering College, Ludhiana. It details the course content, including fundamentals of sets, relations, functions, logic, and combinatorial mathematics, along with specific assignment questions. Additionally, it includes a mapping of the assignment questions to course outcomes.

Uploaded by

ekamjottoper.cse
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
5 views2 pages

Assignmnt1

The document outlines the assignment plan for the 4th semester CSE course on Discrete Structures at Guru Nanak Dev Engineering College, Ludhiana. It details the course content, including fundamentals of sets, relations, functions, logic, and combinatorial mathematics, along with specific assignment questions. Additionally, it includes a mapping of the assignment questions to course outcomes.

Uploaded by

ekamjottoper.cse
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

GURU NANAK DEV ENGINEERING COLLEGE, LUDHIANA

Department of CSE

ASSIGNMENT PLAN

Name of the Course-Coordinator: Dr. Manpreet Kaur Mand , Prof. Shailja, Dr. Amit Jain,
Dr. Preet Kamal Singh

Branch Semester Subject Code Session

CSE 4th Discrete Structures PCCS-103 Jan 25– May 25

Assignment No. 1

Course-Content Covered:
1. Fundamentals of Sets, Relations and Functions: Sets – Operations on sets,
Subsets, Types of sets, ordered pairs, Proofs of general identities of sets, Classes
of sets and partitions, Countable and uncountable sets. Relations –
Representations of relations, Types of relations, Composition of relations,
Closure properties of relations, Equivalence relations, Compatibility relations,
Partial order relations. Functions – Introduction and types of functions, Sum and
product of functions, Hashing functions, recursively defined functions.
2. Prepositional and Predicate Logic: Prepositions and compound prepositions,
Logical connectives, Truth tables, Logical implication and logical equivalence,
Normal forms– Conjunctive and Disjunctive, Validity of well-formed formula,
Propositional inference rules–Modus ponens and modus tollens. Predicate logic,
Universal and existential quantification, Limitations of propositional and
predicate logic.
3. Combinatorial Mathematics: Basic counting principles, Permutations and
combinations, Pigeonhole principle, Inclusion and exclusion principle,
Recurrence relations – Solving homogeneous and non- homogeneous
recurrence relations, Sequences, Generating function.

Q 1: a) Prove That A×(B∩C) = (A×B) ∩ (A×C).


b) Let N denote the set of natural numbers and R be relation on N×N defined by:
(a,b) R(c,d) ↔ ad(b+c) =bc(a+d)
Check whether R is an equivalence relation on N×N.
c) Let R be relation on set a={a,b,c,d} defined by
R={(a,b),(b,c),(d,c),(d,a),(a,d),(d,d)}
Determine i) Reflexive Closure(R)
ii) Symmetric Closure(R)
iii) Transitive Closure(R)
d) f: R→R is defined by f(x)= ax+b where a,b,x ϵ R and a ≠0 Show that f is invertible and
find f-1.
e) Find the domain and range of following:
i) f(x) = x2. ii)f(x) = √ (9-x2) iii) |x-3|/x-3
Q 2: a) Solve An=3An-1 +2, n>=1 with initial conditions A0 =1 using generating function.
b) Solve the recurrence relation
an=3an-1+2n with initial condition, a1=3.
c) Solve the recurrence relation
an+2-3an+1+2an=0
by the generating function method with initial conditions, a0=2 and a1=3.
d) A woman has 11 colleagues in her office of whom 8 are men. She would like to invite
some of her colleagues to dinner.
Find the number of her choices if she decides to invite:
i. Atleast 9 of them
ii. all her women colleagues and sufficient men colleagues to make the number
of women and men equal.
e) A library has two kinds of employees. A person from the first kind always tells truth
while the other kind of person always lies. When you visit library to find whether
Discrete Mathematics book is available (on shelf), person of library at counter Mr. X
answers as The Discrete Mathematics book is available if and only if I always tell
truth! How will you confirm whether the book is available or not?

MAPPING OF 1st ASSIGNMENT WITH COs AND POs

Course Q1 Q2
Outcomes

1. ✓

2. ✓

3. ✓

4. ✓

5.

6.

You might also like