Question
How many of them earn more than
Lalit? Study the following information carefully and answer the given questions. Chetan, Deepak, Farhan, Gaurav, Harish, Jai and Lalit are seven friends who studied in three management institutes A, B and C. They have opted for one out of three specialisation, viz. Marketing, Finance and Production with at least two of them in each specialisation. No two person have the same combination of institute and specialisation. The Marketing specialised from B earns the maximum. Deepak studied in institute C with Production specialisation and earn more than only Chetan and Gaurav. Farhan study in institute A with Marketing and earns less than only Harish and Lalit. Jai studied in institute C with Finance and earns more than Deepak but less than Farhan. Lalit studied in institute A with Finance specialisation. Gaurav, a Productionspecialised , studied in institute B and is not the least earner among them. Chetan is a Finance specialised.Solution
(i) The Marketing specialised from B earns the maximum. Deepak studied in institute C with Production specialisation and earn more than only Chetan and Gaurav. (ii) Farhan study in institute A with Marketing and earns less than only Harish and Lalit. Jai studied in institute C with Finance and earns more than Deepak but less than Farhan. (iii) Lalit studied in institute A with Finance specialisation. Gaurav, a Production specialised, studied in institute B and is not the least earner among them. Chetan is a Finance specialised.
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:
