Question
In the following question, select the related word from
the given alternatives. Cow : Shed : : Horse : ?Solution
Cow lives in Shed in the same way Horse lives in Stable.
A directed acyclic graph (DAG) has 10 vertices and 15 edges. What is the maximum possible number of topological orderings?
What is the worst-case time complexity of Bubble Sort?
A unique piece of information that is used in encryption.
Which algorithm uses a “divide and conquer” strategy?
Which of the following sorting algorithms has the best worst-case time complexity?
Which traversal method in a binary search tree retrieves nodes in sorted order?
Which data structure supports extraction of both min and max in O(1) time and insertion in O(log n)?
Which of the following algorithms uses a greedy approach?
The Bellman-Ford algorithm executes relaxation steps how many times for a graph with V vertices?
The time complexity of searching in a hash table with chaining is:
