Which of the following is not an application of topological sorting?Marks : 1Negative Marks : 0Answer hereFinding Cycle in a graphFinding the prerequisite of a taskFinding Deadlock in an Operating SystemOrdered Statistics

To determine which of the given options is not an application of topological sorting, we need to analyze each option one by one.

1. Finding Cycle in a graph: This is indeed an application of topological sorting. Topological sorting can be used to detect cycles in a directed graph by checking if a topological ordering exists. Therefore, this option is not the correct answer.

2. Finding the prerequisite of a task: This is also an application of topological sorting. Topological sorting can be used to determine the order in which tasks or activities should be executed based on their dependencies. Therefore, this option is not the correct answer.

3. Finding Deadlock in an Operating System: This is not an application of topological sorting. Deadlock detection in an operating system involves identifying circular dependencies among processes or resources. While topological sorting can be used to detect cycles, it is not specifically designed for deadlock detection. Therefore, this option could be the correct answer.

4. Ordered Statistics: This is not an application of topological sorting. Ordered statistics refers to finding the kth smallest or largest element in a set of data. Topological sorting is not directly related to this problem. Therefore, this option could also be the correct answer.

Based on the analysis, the options that are not applications of topological sorting are "Finding Deadlock in an Operating System" and "Ordered Statistics".