Question
Which algorithm is used to detect cycles in a directed graph?
More Algorithms Questions
- What is the worst-case time complexity of a linear search algorithm on an array of 'N' elements?
- The Master Theorem gives time complexity for recurrences of the form:
- In dynamic programming, overlapping subproblems and _________ are key properties.
- The time complexity of building a heap from an unsorted array of n elements is:
- Which of the following SQL commands is used to retrieve data from a database?
- Which of the following sorting algorithms has the BEST average-case time complexity?
- Which sorting algorithm divides the array into halves recursively?
- Which graph traversal algorithm explores all neighbouring nodes at the current depth level before moving on to nodes at the next depth level?
- Which data structure supports extraction of both min and max in O(1) time and insertion in O(log n)?
- What is the worst-case time complexity of QuickSort with a random pivot for sorting n distinct elements?
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)