Question
Which of the following statements is/are
true? Study the following information carefully to answer the given questions: There are eight persons i.e. Dinesh, Vipin, Danish, Vimal, Deepa, Vikrant, Vinish and Diwakar who lives in a building having three floors such that ground floor is numbered as 1 and above it is 2 and so on up to top floor numbered as 3. Each of the floor consist of 3 flats as flat-1, flat-2, flat-3. Flat-1 of floor-2 is immediately above flat-1 of floor-1 and immediately below flat-1 of floor-3 and in the same way flat-2 of floor-2 is immediately above flat-2 of floor-1 and immediately below flat-2 of floor-3 and so on. Flat-2 is in east of flat-1, flat-3 is in east of flat-2. Note: If A lives above (or below) B, then there are living in same flat unless stated otherwise. Left and right are taken as per north direction. Dinesh lives in flat-1 and to the immediate left of Vipin who lives below of Vikrant. Vimal lives on the same flat and floor number. Vikrant lives in flat-2 of one of the floors. Vinish lives to the left of Deepa who lives on floor-3. Diwakar lives below of Vimal in the same flat as of Vimal. Danish lives to the left of Diwakar. Flat towards east of Vipin is empty.Solution
Vikrant lives in flat-2 of one of the floors. Dinesh lives in flat-1 and to the immediate left of Vipin who lives below of Vikrant. Flat towards east of Vipin is empty. 
Which of the following is true about the Round Robin (RR) CPU scheduling algorithm?
Which of the following is NOT a characteristic of the Internet of Things (IoT)?
The amortized time for inserting into a dynamic array (like C++ vector) is:
In a binary tree, if the number of leaf nodes is L, what is the number of nodes with two children?
A directed acyclic graph (DAG) has 10 vertices and 15 edges. What is the maximum possible number of topological orderings?
Which algorithm guarantees the shortest path in a graph with negative weights but no negative cycles?
Which sorting algorithm has an average-case time complexity of O(n log n) and is known for its efficiency, often using a divide-and-conquer approach?
Which algorithm guarantees minimum spanning tree and will produce a different tree depending on tie-breaking?
Which of the following is substring of “IXAMBEE”?
Which of the following is considered the strongest type of encryption method in modern cyber security practices?
