Question
If O sits third to the right of F then how many persons
are sitting between O and J? Answer the questions based on the information given below. A certain number of persons are sitting in row facing north. H sits fifth to the left of L. Only three persons are sitting between K and H. G sits sixth to the left of K. Only one person sits between G and F, who sits at one of the extreme ends of the row. L sits second to the right of J, who sits fourth from one of the extreme ends of the row. Not more than 12 people sit in the row.Solution
Only one person sits between G and F, who sits at one of the extreme ends of the row. G sits sixth to the left of K. F ___ G ____Â _____Â _____Â ____Â Â ____ K H sits fifth to the left of L. Only three persons are sitting between K and H. F ___ G ____Â H ______Â ____Â Â ____ K L L sits second to the right of J, who sits fourth from one of the extreme ends of the row. Not more than 12 people sit in the row. F ___ G ____Â H ____Â ____Â Â J K L ___
Which algorithm finds the shortest paths between all pairs of vertices in a weighted graph?
Which sorting algorithm is not stable by default?
The recurrence relation T(n) = 2T(n/2) + O(n) corresponds to which algorithm’s time complexity?
What is the default replication factor in HDFS?
What is the time complexity of searching in a balanced binary search tree?
With either equal or proportional algorithm, a high priority process is treated ___________ a low priority process.
In which case is QuickSort’s performance worst?
The minimum number of edges in a connected graph with n vertices is:
Which of the following algorithms is most appropriate for a sorting task that requires minimal auxiliary space?
Which of the following is considered the strongest type of encryption method in modern cyber security practices?   Â