When the topological sort of a graph is unique?(a) When there exists a hamiltonian path in the graph(b) In the presence of multiple nodes with indegree 0(c) In the presence of single node with indegree 0(d) In the presence of single node with outdegree 0I have been asked this question during a job interview.My question comes from Topological Sort topic in portion Miscellaneous of Data Structures & Algorithms II

When the topological sort of a graph is unique?(a) When there exists a

1.	When the topological sort of a graph is unique?(a) When there exists a hamiltonian path in the graph(b) In the presence of multiple nodes with indegree 0(c) In the presence of single node with indegree 0(d) In the presence of single node with outdegree 0I have been asked this question during a job interview.My question comes from Topological Sort topic in portion Miscellaneous of Data Structures & Algorithms II
Answer» Right answer is (a) When there exists a hamiltonian PATH in the graph Easiest explanation - A hamiltonian path exists in a Directed ACYCLIC Graph when all pairs of consecutive vertices are in sorted ORDER and are connected by edges. In such a case, there exists a unique TOPOLOGICAL sorting order.

Discussion

No Comment Found

Related InterviewSolutions

What will be the time complexity of the code to find a minimum element from an array of size n and uses square root decomposition(exclude pre processing time)?(a) O(√n)(b) O(n)(c) O(1)(d) O(n^2)The question was posed to me during an interview for a job.My question comes from Miscellaneous in division Miscellaneous of Data Structures & Algorithms II
Mo’s algorithm can only be used for problems where the query can be calculated from the result of the previous query.(a) true(b) falseI had been asked this question in an interview.My doubt is from Miscellaneous in chapter Miscellaneous of Data Structures & Algorithms II
What will be the worst case time complexity of code to find sum in given query range (l,r) in an array of size n with q number of such queries when we apply MO’s algorithm?(a) O(n*q)(b) O(n)(c) O((q+n)√n)(d) O(q*√n)The question was asked in an interview for internship.This question is from Miscellaneous in portion Miscellaneous of Data Structures & Algorithms II
What will be the worst case time complexity of code to find sum in given query range (l,r) in an array of size n with q number of such queries?(a) O(n)(b) O(q)(c) O(n*q)(d) O(n+q)I have been asked this question in an online quiz.The above asked question is from Miscellaneous topic in portion Miscellaneous of Data Structures & Algorithms II
Square root decomposition technique is only applicable when the number of indices in an array is a perfect square.(a) true(b) falseThe question was asked in class test.I want to ask this question from Miscellaneous in division Miscellaneous of Data Structures & Algorithms II
What will be the time complexity of update query operation in an array of size n when we use square root optimization?(a) O(√n)(b) O(n)(c) O(1)(d) O(n^2)The question was posed to me by my school teacher while I was bunking the class.I need to ask this question from Miscellaneous in division Miscellaneous of Data Structures & Algorithms II
Total how many iterations are required to find the sum of elements in a given range of (l,r) in an array of size n when we use square root optimization?(a) √n(b) 2*√n(c) 3*√n(d) n*√nThis question was posed to me in an interview for internship.This key question is from Miscellaneous in portion Miscellaneous of Data Structures & Algorithms II
What will be the worst case time complexity of finding the sum of elements in a given range of (l,r) in an array of size n when we use square root optimization?(a) O(n)(b) O(l+r)(c) O(√n)(d) O(r-l)This question was posed to me during an interview.I need to ask this question from Miscellaneous in section Miscellaneous of Data Structures & Algorithms II
What will be the worst case time complexity of finding the sum of elements in a given range of (l,r) in an array of size n?(a) O(n)(b) O(l+r)(c) O(l-r)(d) O(r-l)This question was addressed to me during a job interview.I need to ask this question from Miscellaneous in division Miscellaneous of Data Structures & Algorithms II
By what factor time complexity is reduced when we apply square root decomposition to a code?(a) n(b) √n(c) n^2(d) n^-1/2This question was addressed to me during an online exam.Origin of the question is Miscellaneous topic in chapter Miscellaneous of Data Structures & Algorithms II

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment