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

Scribd
Upload
51 views1 page

DMS Assignment-2

This document contains an assignment for a Discrete Mathematical Structures course. The assignment contains 3 questions: 1) Analyze recurrence relations and solve a given relation, 2) Analyze recurrence relations and solve a given relation, 3) Construct an optimal prefix code for the word "ENGINEERING". The assignment is due on January 5th, 2022 between 9 AM to 4:45 PM and is worth a maximum of 10 marks.

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
51 views1 page

DMS Assignment-2

This document contains an assignment for a Discrete Mathematical Structures course. The assignment contains 3 questions: 1) Analyze recurrence relations and solve a given relation, 2) Analyze recurrence relations and solve a given relation, 3) Construct an optimal prefix code for the word "ENGINEERING". The assignment is due on January 5th, 2022 between 9 AM to 4:45 PM and is worth a maximum of 10 marks.

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-2
COURSE : Discrete Mathematical Structures Submission Time : 9 AM to 4:45 PM
COURSE : 18CS36 Submission Date : 05-01-2022
CODE
SEM/SEC : 3rd Sem, A’Sec Max Marks : 10
Marks COs BTL
1. Analyze the concepts of recurrence relation and solve,
CO3
n 3
an+2+an+1-6an=2 for n 0

3
2. CO3
Analyze the concepts of recurrence relation and solve,
+ an-1 – 6an-2 = 0 for n>=2 given that a0 = -1 and a1 = 8.
L3

4
3.
Construct the optimal prefix code for the word ENGINEERING
CO3
hence deduce the code for this word

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