Scribd
Upload
78 views1 page

DMS Assignment 3

1. The assignment is for the Discrete Mathematical Structures course and is due on March 6th, 2022 between 9 AM and 4:45 PM. It has 3 questions worth a total of 10 marks. 2. The first question asks to analyze and prove a formula for the number of ways to place n non-attacking rooks on an n x n board with forbidden positions. 3. The second question asks to discover the solution to a given recurrence relation. 4. The third question asks to analyze and prove that two graphs shown are isomorphic.

Uploaded by

Hamsa A S
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
78 views1 page

DMS Assignment 3

1. The assignment is for the Discrete Mathematical Structures course and is due on March 6th, 2022 between 9 AM and 4:45 PM. It has 3 questions worth a total of 10 marks. 2. The first question asks to analyze and prove a formula for the number of ways to place n non-attacking rooks on an n x n board with forbidden positions. 3. The second question asks to discover the solution to a given recurrence relation. 4. The third question asks to analyze and prove that two graphs shown are isomorphic.

Uploaded by

Hamsa A S
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/ 1

Department of Computer Science & Engineering

ASSIGNMENT-3
COURSE : Discrete Mathematical Structures Submission Time : 9 AM to 4:45 PM
COURSE : 18CS36 Submission Date : 06-03-2022
CODE
SEM/SEC : 3rd Sem, A’Sec Max Marks : 10
Marks COs BTL
1. Analyze and Prove that the number of ways to place n non attacking rooks
on an n × n board with forbidden positions is
3

where the numbers rk are the coefficients of the rook polynomial for the CO4
forbidden positions. 3
2.
Discover the solution for the following recurrence relation
an = 8an-2 - 16an-4 , for n>=4,
with a0=1, a1=4, a2=28 and a3=32?
L3
4
3. Analyze and Prove that the graphs given below are isomorphic.
CO5

Use propositional and predicate logic in


CO1 knowledge representation and truth verification.
Bloom’s Taxonomy Level

Apply the theory of permutations and L1 Remembering


CO2 combinations to solve counting problems.
L2 Understanding
Solve problems using recurrence relations and L3 Applying
CO3 generating functions.
L4 Analyzing
Apply different mathematical proofs techniques
CO4 in proving theorems in the courses. L5 Evaluating
L6 Creating
CO5 Compare graphs, trees and their applications.

HOD

You might also like