# NPTEL Design and analysis of algorithms Assignment 8 Answer

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

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

Which of the following is a linear constraint?

Ā
Ā
Ā
Ā
AnsĀ  – C
2 points

The President is arriving to inaugurate a stadium. He will go directly from the airport to the stadium. Security considerations require two routes to be available for the President that do not overlap on any section of road, though the routes can cross each other at intersections.

This can be modelled as a network ļ¬ow problem where the source and target are the airport and the stadium, road intersections are nodes and each road segment is an edge. The actual ļ¬ow problem to be solved is to:

Ā
Ā
Ā
Ā
AnsĀ  – B
2 points

City authorities are concerned about traļ¬c accidents on major roads. They would like to have ambulances stationed at road intersections to quickly reach the scene of any accident along these roads. To minimize response time, ambulances are to be located at intersections with traļ¬c lights so that any segment of road can be reached by at least one ambulance that does not have to pass through a traļ¬c light to reach the scene of the accident. If we model the road network as a graph, where intersections with traļ¬c lights are vertices and edges represent road segments between traļ¬c lights, the graph theoretic question to be answered is:

Ā
Ā
Ā
Ā
AnsĀ  – C
2 points

We have an exponential time algorithm for problem A, and problem A reduces in polynomial time to problem B. From this we can conclude that:

Ā
Ā
Ā
Ā
AnsĀ  – C
2 points

Suppose SAT reduces to a problem C. To claim that C is NP-complete, we additionally need to show that:

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