Question
How many boxes are placed between Box A and Box B?
Study the following information carefully and answer the question given below: Seven boxes namely A, Z, B, D, E, F and G are placed one above the other in the rack but not necessarily in the same order. The lowermost rack is numbered as one and above is two and so on. Box Z is placed immediately below Box E. Only one box is placed between the Box G and Box D. Box E is placed in even numbered rack above the rack three. Box F is placed immediately above Box D. Box B is not placed above Box A. Neither Box A nor Box B is placed in lowermost rack. Only three boxes are placed between Box Z and Box G.Solution
Box E is placed in even numbered rack above the rack three. Box Z is placed immediately below Box E. Only three boxes are placed between Box Z and Box G. Only one box is placed between the Box G and Box D. Box F is placed immediately above Box D. Box B is not placed above Box A. Neither Box A nor Box B is placed in lowermost rack. From above statements, Box E is placed either in 4th or 6th rack (two possibilities) Remaining statements are given directly; by using we get the completed table in Case-2 Case-1 gets eliminated, as it violates the last reference point
Which design pattern is most suitable for controlling access to a resource by limiting the number of clients that can use it concurrently?
The time complexity of binary search is:
In a binary tree, what is the maximum number of children a node can have?
Which type of AI is primarily used for adaptive mobile applications like virtual assistants?
Which of the following techniques is primarily used to address overfitting in machine learning models?
A data analysis algorithm requires processing data in a Last-In, First-Out (LIFO) manner. Which operation is used to get the most recently added element...
What type of relationship is represented by Aggregation in Object-Oriented Programming?
Consider the following sequence of stack operations:
PUSH(10) β PUSH(20) β PUSH(30) β POP() β PUSH(40) β POP() β POP()
What is...
Which of the following is true about triggers in a relational database?
Union-Find with path compression achieves nearly constant time because its complexity is: