Scribd
Upload
4 views1 page

ASSIGNMENT-1

This document is an assignment sheet for the course 'Design and Analysis of Algorithm' at IIMT Engineering College for the session 2024-25. It includes questions on algorithm analysis, sorting algorithms, and recurrence relations, with a due date of October 4, 2024, and a submission date of October 10, 2024. The assignment corresponds to Unit No. I and CO-1.

Uploaded by

renu kumar
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
4 views1 page

ASSIGNMENT-1

This document is an assignment sheet for the course 'Design and Analysis of Algorithm' at IIMT Engineering College for the session 2024-25. It includes questions on algorithm analysis, sorting algorithms, and recurrence relations, with a due date of October 4, 2024, and a submission date of October 10, 2024. The assignment corresponds to Unit No. I and CO-1.

Uploaded by

renu kumar
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

IIMT ENGINEERING COLLEGE

Department of Computer Science and Engineering


COURSE FILE
Design and Analysis of Algorithm- BCS-503
Session: 2024-25 Semester: Odd

Due Date: 04-10-2024 Submission Date:10-10-2024

Assignment Sheet-I

This Assignment Corresponds to Unit No. I and CO-1

Q1. What is Analysis of Algorithms?


Q2. Describe of Master Method for recurrence problem.

Q3. Arrange the no. in increasing order using Quick sorting algorithm. 9 ,4 ,10 ,1 ,2 ,4,7.3,8

Q4. Illustrate the operation of counting sort on the following array: A= {6, 0, 2, 0, 1,3, 4, 6, 1, 3, 2}

Q5. Describe Growth of Functions/Asymptotic notations. Explain its types with suitable example.

Q6. Solve the following recurrence relation:

i) T (n) = 2T(n/2) + n if n>1, T(n)=1 if n=1.


j) T (n) = 2T(n/2) + n2 if n>1, T(n)=1 if n=1.
k) T (n) = 2T(n/3) +T (2n/3) + c n if n>1, T(n)=1 if n=1.

Signature of Faculty

Page 90 of 103

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy