Question
Whose income is the second
highest? 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.
Running time T(n) where 'n' is the input size of the recursive algorithm given as : T(n) = c + T(n-1), if n > 1 ; T(n) = d if n < 1. The order of the a...
With what command you can see your user name?
The attributes that do not exist in the physical database
In Go, what is the purpose of a goroutine?
State true/false
Trojan works in background and steal data which is sensitive
What is an identifier in C language?
Frames are related to which layer of OSI model
What is the purpose of the delete operator in C++?
Which of the following best describes a transistor?
Consider a B+-tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any non-root node?Â