Anil and Ashish receive Rs.2000 for work of 8 days. If

Which sorting algorithm divides the array into halves recursively?

In dynamic programming, which principle ensures correctness by solving overlapping subproblems and storing results?

Which of the following operations on a data structure refers to the removal of an element from the front of a queue?

Which of the following algorithms is most appropriate for a sorting task that requires minimal auxiliary space?

In mobile computing, what is the main feature of pervasive computing?

Which of the following is true for the time complexity of binary search?

Recursive problems are implemented by

Which of the following algorithms uses a greedy approach?

The time complexity of computing the all-pairs shortest paths in a dense graph with V vertices using Floyd–Warshall is:

In dynamic programming, overlapping subproblems and _________ are key properties.