Scribd
Upload
3 views1 page

Mastering Recurrence Relations & Logic Circuits

The document outlines an assignment for Dr. Akhilesh Das Gupta Institute of Professional Studies, consisting of seven questions related to recurrence relations, distributive lattices, logic circuit design, function composition, generating functions, divide and conquer methods, and definitions of functions and their types. Each question requires detailed explanations and problem-solving steps. The assignment covers various topics in computer science and mathematics.

Uploaded by

sahiplayz
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
3 views1 page

Mastering Recurrence Relations & Logic Circuits

The document outlines an assignment for Dr. Akhilesh Das Gupta Institute of Professional Studies, consisting of seven questions related to recurrence relations, distributive lattices, logic circuit design, function composition, generating functions, divide and conquer methods, and definitions of functions and their types. Each question requires detailed explanations and problem-solving steps. The assignment covers various topics in computer science and mathematics.

Uploaded by

sahiplayz
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

Dr.

Akhilesh Das Gupta Institute of Professional Studies


FC-26, Shastri Park, New Delhi-110053

UNIT 2 ASSIGNMENT

Q1. Solve the following recurrence relation using master theorem. T(n) = 2T(n/2)
+ nlogn

Q2. Show that every finite distributive lattice can be represented as a lattice of
sets, using the lattice formed by the subset of the set {a,b,c} As an example.
Provide a detailed explanation.

Q3. Design a logic circuit for the Boolean expression ((A+B')C)’+ (AC)’ and
simplify it using Karnaugh maps. Include a step by step process for the circuit
and detailed explanation of the Karnaugh map simplification.

[Link] f(x)=2x-1 and g(x) = x/2 + 1 .find the composition f(g(x)) and g(f(x)) and
determine their domain.

Q5. Demonstrate how generating function can be used to solve the recurrence
relation

An = An-1 + n with A0=1, providing a specific example. Illustrate your solution


with clear explanation.

Q6. Explanation solution method for a divide and conquer recurrence relation.

Q7. Define function and it’s types.

You might also like