• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

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

Which of the following option is True?


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.


Time complexity to find Longest Common Subsequence is O(2^(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(K).


Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments