# NPTEL Design and analysis of algorithms Assignment 1 Answer 2023

We Discuss About That NPTEL Design and analysis of algorithms Assignment 1 Answer 2023

NPTEL Design and analysis of algorithms Assignment 1 Answer 2023– Here All The Questions and Answers Provided to Help All The Students and NPTEL Candidate as a Reference Purpose, It is Mandetory to Submit Your Weekly Assignment By Your Own Understand Level.

Are you looking for the Assignment Answers to **NPTEL Design and analysis of algorithms Assignment 1 Answer 2023? **If Yes You are in Our Great Place to Getting Your Solution, This Post Should be help you with the Assignment answer to the **Nation**** al Programme on Technology Enhanced Learning (NPTEL)** Course

**“NPTEL Design and analysis of algorithms Assignment 1 Answer 2023”**

Table of Contents

## NPTEL Design and analysis of algorithms Assignment

- Asymptotic complexity, O() notation
- Sorting and search
- Algorithms on graphs: exploration, connectivity, shortest paths, directed acyclic graphs, spanning trees
- Design techniques: divide and conquer, greedy, dynamic programming
- Data structures: heaps, union of disjoint sets, search trees
- Intractability

**Next Week Assignment Answers**

This course can have Associate in Nursing unproctored programming communication conjointly excluding the Proctored communication, please check announcement section for date and time. The programming communication can have a weightage of twenty fifth towards the ultimate score.

- Assignment score = 25% of average of best 8 assignments out of the total 12 assignments given in the course.
**( All assignments in a particular week will be counted towards final scoring – quizzes and programming assignments).**- Unproctored programming exam score = 25% of the average scores obtained as part of Unproctored programming exam – out of 100
- Proctored Exam score =50% of the proctored certification exam score out of 100

**YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF ASSIGNMENT SCORE >=10/25 AND**

**UNPROCTORED PROGRAMMING EXAM SCORE >=10/25 AND PROCTORED EXAM SCORE >= 20/50.**

**If any one of the 3 criteria is not met, you will not be eligible for the certificate even if the Final score >= 40/100.**

**CHECK HERE OTHERS NPTEL ASSIGNMENTS ANSWERS **

*BELOW YOU CAN GET YOUR NPTEL Design and analysis of algorithms Assignment 1 Answer 2023***?** :

**?**:

- What does f(2000,3) return??
python
`f(m,n) {`

ans = 1;

count = 0;

while (ans <= m) {

count = count + 1;

ans = ans * n;

}

return(count)

}

Answer: 7

- Suppose someone designs a new airline routing algorithm called MagicPath and claims that its worst-case complexity is O(n^2 log n). Which of the following statements is inconsistent with this claim.
**Answer: For every sufficiently large n, there is an input of size n for which MagicPath requires time proportional to n3.**

- You are executing an algorithm with worst-case time complexity O(n^4) on a CPU that can perform 10^8 operations per second. Which of the following is the most accurate guarantee for the time required to solve a worst-case input of size 800?
**Answer: Under 5 minutes**

- Suppose f(n) is n^2 log n. Consider the following statements. (A) f(n) is O(n √ n) (B) f(n) is O(n^2 √n) (C) f(n) is O(n^3)
**Answer: (B) is true but (A) and (C) are not true.**

- In the code fragment below, first and last are integer values and composite(x) is a function that returns true if x is not a prime number and false otherwise.
python
`i = 0; j = 0; k = 0;`

for (m = last; m >= first; m = m - 1){

k = k + m;

if (composite(m)){

i = i + m;

}else{

j = j - m;

}

}`if (…) {`

print("True");

}else{

print("False");

}

Which of the following expressions can we put in place of the missing if condition (…) to ensure that the program prints “True”?

**Answer: k == i + j**-