# NPTEL Design and analysis of algorithms Assignment 5 Answer

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

NPTEL Design and analysis of algorithms Assignment 5 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 5 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 5 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.

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 5 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.

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

Suppose we want to extend the union-find data structure to support the operation Reset(c), which takes as input the name of a component c and then breaks up c into singleton components, like MakeUnionFind(). For instance if c = 3 and c currently consists of {1,3,7}, then Reset(c) will produce three components called 1, 3 and 7 consisting of {1}, {3} and {7}, respectively.

Which of the following is the most accurate upper bound for the cost of adding Reset(c) to the array and pointer implementations of union-find discussed in the lecture?

Ans – C
2 points
In the algorithm presented for the closest pair of points problem, we have assumed that no two points have the same x or y coordinate. Which of the following steps would become more complicated to justify without this assumption.

Ans –  D
2 points

Suppose we want to delete an arbitrary element from a max heap. (Assume we have auxiliary arrays NodeToHeap[] and HeapToNode[] required for the update() operation.)

Consider the following strategies.

• Strategy 1: Remove the element from the array, compress the array and reheapify.
• Strategy 2: Update the value of this node to the current maximum value in the heap + 1 and readjust the heap, then delete_max.

Ans –  B
2 points
Consider the max-heap [90, 77, 89, 51, 38, 64, 89, 17, 33] built by repeatedly inserting values into an empty heap. Which of the following could not have been the last element inserted into this heap?

Ans –  C
2 points
Suppose we implement merge sort with a 7-way split: divide the array into 7 equal parts, sort each part and do a 7 way merge. What would the worst-case complexity of this version be?

Ans –  A
`Yhaa You have done it but next? if YOU Want to your Others NPTEL Design and analysis of algorithms Assignment 5 Answer Then Follow US HERE and Join Telegram.`