0% found this document useful (0 votes)
7 views3 pages

Discrete Mathematics Assignment on Counting

This document is an assignment for the Discrete Mathematics course at SIKSHA 'O' ANUSANDHAN University for B.Tech students. It includes various questions related to counting, relations, and combinatorial reasoning, covering topics such as divisibility, permutations, and set relations. The assignment aims to evaluate students' understanding and application of discrete mathematics concepts.

Uploaded by

maryd8271
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
0% found this document useful (0 votes)
7 views3 pages

Discrete Mathematics Assignment on Counting

This document is an assignment for the Discrete Mathematics course at SIKSHA 'O' ANUSANDHAN University for B.Tech students. It includes various questions related to counting, relations, and combinatorial reasoning, covering topics such as divisibility, permutations, and set relations. The assignment aims to evaluate students' understanding and application of discrete mathematics concepts.

Uploaded by

maryd8271
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

ITER, SIKSHA ‘O’ ANUSANDHAN (Deemed to be University) ASSIGNMENT

Branch CSE & CSIT Programme [Link]


Course Name DISCRETE MATHEMATICS Semester 1ST
Course Code CSE 1002 Academic Year 2025-26
Credits 4 Grading Pattern 6
ASSIGNMENT - 4 Topics  Counting & Relations
Learning Level L1: Remembering L3: Applying L5: Evaluating
(LL) L2: Understanding L4: Analysing L6: Creating

How many positive integers between 100 and 999 inclusive


a) are divisible by 7?
b) are odd?
c) have the same three decimal digits?
Q1 d) are not divisible by 4? CO5 L3
e) are divisible by 3 or 4?
f) are not divisible by either 3 or 4?
g) are divisible by 3 but not by 4?
h) are divisible by 3 and 4?

How many license plates can be made using either two


Q2 uppercase English letters followed by four digits or two digits CO5 L3
followed by four uppercase English letters?

How many bit strings of length 12 contain


a) exactly three 1s? b) at most three 1s?
Q3 CO5 L3
c) at least three 1s? d) an equal number of 0s and 1s?

How many ways are there for 10 women and six men to stand in
Q4 CO5 L3
a line so that no two men stand next to each other?

Q5
Suppose that a department contains 10 men and 15 women. How
many ways are there to form a committee with six members if it CO5 L3
must have more women than men?

Find the expansion of (𝑥 + 𝑦) CO5 L3


Q6 a) using combinatorial reasoning.
b) using the binomial theorem.
Q7
How many ways are there for four men and five women to stand
CO5 L3
in a line so that
a) all men stand together? b) all women stand together?
Q8
a. What is the coefficient of (𝑥) in (2 − 𝑥) ?
CO6 L3
b. Let n be a nonnegative [Link] ∑ 2 C(n, k) = 3 .

Q9
Let R be the relation 𝑅 = {(𝑎, 𝑏) ∣ 𝑎 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑏} on the set of
CO6 L3
positive integers. Find a) 𝑅 − 1. b) 𝑅.

What is the congruence class [4] when 𝑚 is


Q10
CO6 L3
(a) 2 (b) 3 (c) 6 (d) 8

(I) Draw the Hasse diagram for divisibility on the set


a) {1,2,3,4,5,6,7,8}. b) {1,2,3,5,7,11,13}.
c) {1,2,3,6,12,24,36,48}. d) {1,2,4,8,16,32,64}. CO6 L3
Q11
(II) Draw the Hasse diagram for the less than or equal to relation
on {0,2,5,10,11,15}.

Q12 Answer these questions for the poset ({2,4,6,9,12, 18,27,36,48,


)
a) Find the maximal elements. c) Is there a greatest element?
b) Find the minimal elements. d) Is there a least element? CO6 L5
e) Find all upper bounds of {2,9}.
f) Find the least upper bound of {2,9}, if it exists.
g) Find all lower bounds of {60,72}.
h) Find the greatest lower bound of {60,72}, if it exists.
Note:

1. Assignment carries a weightage of 10 marks out of 100


2. The course outcomes CO5 and CO6 are covered.
Course Outcomes
Understand the rules of logic to distinguish between valid and invalid arguments and apply them to prove mathematical
CO1 statements

Understand sets, their various operations and use them to analyze functions and its various concepts as well as study sequences
CO2 and summations

Able to apply searching and sorting algorithms and study the growth of functions to compute the time complexity of algorithms
CO3
Analyze the various important concepts of number theory like divisibility, modular arithmetic, integer representation,
CO4
algorithms, congruences and apply them to cryptography
Understand mathematical induction and recursion in order to prove statements, analyze recursive functions and solve
CO5 recurrence relations in combinatorics

Understand different counting techniques and analyze various properties of equivalence relations and partial orderings, to
CO6 construct digraphs for applications in computer science

You might also like