Question
Which algorithm is used to detect cycles in a directed graph?
More Algorithms Questions
- Which of the following sorting algorithms has the BEST average-case time complexity?
- A greedy MST algorithm repeatedly selects the lightest edge that does not create a cycle. Which idea is this?
- In which case is QuickSort’s performance worst?
- In virtualization, what is the primary role of a hypervisor?
- Which SQL function is used to count the number of rows in a table?
- The time complexity of computing the all-pairs shortest paths in a dense graph with V vertices using Floyd–Warshall is:
- Consider a directed acyclic graph (DAG). The problem of finding the longest path in a DAG (with edge weights) can be solved in:
- Which of the following is shared by the thread of the same process.
- Which algorithm finds the longest common subsequence (LCS) of two sequences?
- What is the main advantage of using a linked list over an array?
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)