Open In App
Related Articles

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

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report

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 vertices 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. 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
Please comment below if you find anything wrong in the above post

Last Updated : 20 Jan, 2020
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads