Question
If C is related to 2015 and F is related to 2019 in a
certain way, then G is related to which of the following year? Study the following information carefully and answer the questions given below. Eight persons A, B, C, D, E, F, G and H completed Army training in eight different years viz. 2012 to 2019, but not necessarily in the same order. D completed the training three years after F. Only three persons completed the training between C and F. C doesn’t complete on an odd numbered year. The number of persons completed before D is one more than the number of persons completed after B. Only one person completed the training between B and A. The difference between the years in which G and E completed is three years. Both H and E completed the training in consecutive years.Solution
We have, D completed the training three years after F. Only three persons completed the training between C and F. C doesn’t complete on an odd numbered year. From the above condition, there are three possibilities
Again we have, The number of persons completed before D is one more than the number of persons completed after B. Only one person completed the training between B and A.
Again we have, The difference between the years in which G and E completed is three years. Both H and E completed the training in consecutive years. So Case2 and 3 get eliminated, hence the final arrangement becomes 
Which of the following statements best describes a mesh topology in network design?
Which of the following is a key characteristic of cloud computing?Â
What is the main reason to use a try-catch block in programming?
In the context of algorithm analysis, what does "Big O notation" primarily describe?
Huffman Coding uses a greedy approach to achieve what?
What is the best case time complexity of merge sort?
Which of the following network topologies is most resilient to node failures?Â
Complete the Python code snippet to initialize an array arr of size N with all zeros, and then iterate through it from the second element (index 1) up t...
Dijkstra's algorithm, used for finding the shortest paths from a single source to all other vertices in a graph with non-negative edge weights, is an ex...
Which I/O scheduling algorithm is designed to reduce the average response time for disk operations by prioritizing requests based on proximity to the cu...