Question
How many persons purchased bungalow between Babli and
Farun? Study the following information carefully and answer the question given below: Eight friends – Amit, Babli, Chand, Deepa, Ishu, Farun, Gori and Hemant purchased bungalows on same date of different years viz. 1988, 1993, 1995, 1996, 2000, 2001, 2006 and 2009 but not necessarily in same order. They all have purchased their bungalows on 1st of June of their respective years. (Note- For calculation of time period, please consider 1st June 2018 as cut-off date.) Babli purchased his bungalow immediately before Deepa. Only one person purchased his bungalow between Deepa and Ishu, who purchased in a leap year. Two people purchased bungalow between Farun and Gori who purchased it 12 years ago. Amit was neither the first nor the last person to buy a bungalow.Solution
Two people purchased bungalow between Farun and Gori who purchased it 12 years ago. On the basis of above hint we can draw the following table. Babli purchased his bungalow immediately before Deepa. Only one person purchased his bungalow between Deepa and Ishu, who purchased in a leap year. Amit was neither the first nor the last person to buy a bungalow. The only left leap year is 2000, so that's the year when Ishu purchased. Thus Amit purchased in mid i.e. in 2001.
Consider a system with 4 CPU cores. If there are 8 user-level threads in a single process, what is the maximum number of these threads that can execute ...
Which type of polymorphism in Java is achieved through method overloading?
Which of these is a key characteristic of SaaS (Software as a Service)?
In public-private key encryption , which of the following is true regarding the private key ?
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...
Which statement is FALSE regarding DRAM memory?
Which of the following is a property of an admissible heuristic in A* search?
Fill in the correct option for 28 blank space.
In a backtracking algorithm, what happens when a partial solution is found to violate a constraint?
The Naive Pattern Searching algorithm has a worst-case time complexity of O(MN), where 'M' is the length of the pattern and 'N' is the length of the tex...