# GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 17

Which of the following option is True?**(A)** Time complexity to detect cycle in an directed graph is O(V^2), where V is number of virties and E is number of edges.**(B)** Time complexity to find Longest Common Subsequence is O(2^(m+n)), where m, n are sizes of given strings.**(C)** Time complexity of Job Sequencing Problem is O(n^2), where n is number of jobs.**(D)** Time complexity to find K-th element of two sorted arrays is O(K).**Answer:** **(C)****Explanation:** Time complexity to detect cycle in an directed graph is O(V^2), where V is number of virties and E is number of edges.

Time complexity to find Longest Common Subsequence is O(m*n), where m, n are sizes of given strings.

Attention reader! Don’t stop learning now. Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in **GATE Test Series Course**.

Learn all **GATE CS concepts with Free Live Classes** on our youtube channel.

Time complexity of Job Sequencing Problem is O(n^2), where n is number of jobs.

Time complexity to find K-th element of two sorted arrays is O(log(K)).

Option (C) is true.

Quiz of this Question