Question
1. Once upon a time, there lived a Swan near a lake in a
forest. P. He praised the Swan and soon, the two became friends. Q. The Owl soon got bored of the place. R. They met near the lake for many days. S. One night, an Owl saw the Swan gliding on the lake in the moonlight. 6. He told the Swan that he was going back to the forest and asked the Swan to visit him whenever he liked. In the following question the 1st and the last part of the sentence/passage are numbered 1 and 6. The rest of the sentence/ passage is split into four parts and named P, Q, R and S. These four parts are not given in their proper order. Read the sentence/ passage and find out which of the four combinations is correct.Solution
Here, S is the second sentence, after 1. It introduces the owl, by mentioning 'an owl'. P is the third sentence. It says what the owl did when he saw the swan. R is the fourth sentence. It mentions what they did after becoming friends. Q is the fifth sentence. After the routine of meeting for many days, the owl got bored. 6 is the last sentence.
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.
