CAT 2023 Slot 3 β LRDI Practice Questions | Aarambh Academy
CAT 2023 Slot 1 β LRDI Practice Questions
SET 1
Faculty members in a management school can belong to one of four departments β Finance and
Accounting (F&A), Marketing and Strategy (M&S), Operations and Quants (O&Q) and Behaviour and
Human Resources (B&H). The numbers of faculty members in F&A, M&S, O&Q and B&H
departments are 9, 7, 5 and 3 respectively.
Prof. Pakrasi, Prof. Qureshi, Prof. Ramaswamy and Prof. Samuel are four members of the school’s
faculty who were candidates for the post of the Dean of the school. Only one of the candidates was
from O&Q.
Every faculty member, including the four candidates, voted for the post. In each department, all the
faculty members who were not candidates voted for the same candidate. The rules for the election
are listed below.
There cannot be more than two candidates from a single department
A candidate cannot vote for himself/herself.
Faculty members cannot vote for a candidate from their own department.
After the election, it was observed that Prof. Pakrasi received 3 votes, Prof. Qureshi received 14
votes, Prof. Ramaswamy received 6 votes and Prof. Samuel received 1 vote. Prof. Pakrasi voted for
Prof. Ramaswamy, Prof. Qureshi for Prof. Samuel, Prof. Ramaswamy for Prof. Qureshi and Prof.
Samuel for Prof. Pakrasi.
Question 1 : Which of the following can be the number of votes that Prof. Qureshi received from a
single department?
A visa processing office (VPO) accepts visa applications in four categories – US, UK, Schengen, and
Others. The applications are scheduled for processing in twenty 15-minute slots starting at 9:00 am
and ending at 2:00 pm. Ten applications are scheduled in each slot. There are ten counters in the
office, four dedicated to US applications, and two each for UK applications, Schengen applications and Others applications. Applicants are called in for processing sequentially on a first-come-first-
served basis whenever a counter gets freed for their category. The processing time for an application
is the same within each category. But it may vary across the categories. Each US and UK application
requires 10 minutes of processing time. Depending on the number of applications in a category and
time required to process an application for that category, it is possible that an applicant for a slot
may be processed later.
On a particular day, Ira, Vijay and Nandini were scheduled for Schengen visa processing in that order.
They had a 9:15 am slot but entered the VPO at 9:20 am. When they entered the office, exactly six
out of the ten counters were either processing applications, or had finished processing one and
ready to start processing the next
Mahira and Osman were scheduled in the 9:30 am slot on that day for visa processing in the Others
category.
All slots were full.
The number of US applications was the same in all the slots. The same was true for the other
three categories.
50% of the applications were US applications.
All applicants except Ira, Vijay and Nandini arrived on time.
Vijay was called to a counter at 9:25 am.
Question 1: How many UK applications were scheduled on that day?
Question 2: What is the maximum possible value of the total time (in minutes, nearest to its integer
value) required to process all applications in the Others category on that day?
The schematic diagram below shows 12 rectangular houses in a housing complex. House numbers
are mentioned in the rectangles representing the houses. The houses are located in six columns β
Column-A through Column-F, and two rows β Row-1 and Row-2. The houses are divided into two
blocks – Block XX and Block YY. The diagram also shows two roads, one passing in front of the houses
in Row-2 and another between the two blocks.
Some of the houses are occupied. The remaining ones are vacant and are the only ones available for
sale.
The road adjacency value of a house is the number of its sides adjacent to a road. For example, the
road adjacency values of C2, F2, and B1 are 2, 1, and 0, respectively. The neighbour count of a house
is the number of sides of that house adjacent to occupied houses in the same block. For example, E1
and C1 can have the maximum possible neighbour counts of 3 and 2, respectively.
The base price of a vacant house is Rs. 10 lakhs if the house does not have a parking space, and Rs.
12 lakhs if it does. The quoted price (in lakhs of Rs.) of a vacant house is calculated as (base price) + 5
Γ (road adjacency value) + 3 Γ (neighbour count).
The maximum quoted price of a house in Block XX is Rs. 24 lakhs. The minimum quoted price of a
house in block YY is Rs. 15 lakhs, and one such house is in Column-E.
Row-1 has two occupied houses, one in each block.
Both houses in Column-E are vacant. Each of Column-D and Column-F has at least one occupied
house.
There is only one house with parking space in Block YY.