# NPTEL Design and analysis of algorithms Assignment 7 Answer

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

NPTEL Design and analysis of algorithms Assignment 7 Answer – 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 7 Answer? If Yes You are in Our Great Place to Getting Your Solution, This Post Should be help you with the Assignment answer to the National Programme on Technology Enhanced Learning (NPTEL) Course “NPTEL Design and analysis of algorithms Assignment 7 Answer”

## NPTEL Design and analysis of algorithms Assignment

This course will cover basic concepts in the design and analysis of algorithms.
• 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
INTENDED AUDIENCE: Students in BE/BTech Computer Science, 2nd/3rd year.
PRE-REQUISITES: Exposure to introductory courses on programming and data structures.
INDUSTRY SUPPORT: This course should be of value to any company working in the area of software services and products.

NPTEL Design and analysis of algorithms Assignment 5 Answer

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.

Final score = Assignment score + Unproctored programming exam score + Proctored Exam 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.

## BELOW YOU CAN GET YOUR NPTEL Design and analysis of algorithms Assignment 7 Answer 2022? :

All questions carry equal weightage. You may submit as many times as you like within the deadline. Your final submission will be graded.
Assignment not submitted

An alignment between two strings w1 and w2 (over the alphabet {a,b,c,...,z}) is obtained by inserting hyphens in the two strings such that the modified strings align (i.e., the modified strings are of equal length, and at each position, either both strings have the same letter or one of the strings has a hyphen).

Here are three examples of alignments. The first is between ocurrance and occurrence and the second and third are between ctatg and ttaagc.

 (1) oc-urr-ance (2) ct-at-g- (3) ctat---g- occurre-nce -tta-agc ---ttaagc

mismatch in an alignment is a position where one of modified strings has a hyphen and the other does not. There are three mismatches in the first alignment given above, five mismatches in the second, and seven mismatches in the third.

All questions carry equal weightage. You may submit as many times as you like within the deadline. Your final submission will be graded.
2 points

Let s[1..m] and t[1..n] be the two strings to be matched. Let M(i,j) be the number of mismatches in the best alignment of s[1..i] and t[1..j]. Which of the following is a correct recursive formulation of M(i,j) for i,j > 0?

Note: By convention s[1..0] and t[1..0] are taken to be the empty string, so M (i, 0) = i for i ∈ {1,2,…,m} and M(0,j) = j for j ∈ {1,2,…,n}.

 M(i,j) = 1+M(i-1,j-1), if s[i] = t[j] min(M(i-1,j),M(i,j-1)), otherwise

 M(i,j) = M(i-1,j-1), if s[i] = t[j] min(M(i-1,j),M(i,j-1)), otherwise

 M(i,j) = 1+M(i-1,j-1), if s[i] = t[j] 1+min(M(i-1,j),M(i,j-1)), otherwise

 M(i,j) = M(i-1,j-1), if s[i] = t[j] 1+min(M(i-1,j),M(i,j-1)), otherwise

Ans – C

2 points
What kind of table would we use to evaluate this using dynamic programming?

Ans – c
2 points
In what order would we fill in the entries in the tables?

Ans – B
2 points
How much time will it take to evaluate this recursive definition using dynamic programming?

Ans – d

Compute the number of mismatches in the best alignment of the strings mandrake and magician.
Ans – 13
`Yhaa You have done it but next? if YOU Want to your Others NPTEL Design and analysis of algorithms Assignment 7 Answer`