A new airlines company is planning to start operations in a country. The company has identified ten different cities which they plan to connect through their network to start with. The flight duration between any pair of cities will be less than one hour. To start operations, the company has to decide on a daily schedule.
The underlying principle that they are working on is the following:
Any person staying in any of these 10 cities should be able to make a trip to any other city in the morning and should be able to return by the evening of the same day.
Suppose three of the ten cities are to be developed as hubs. A hub is a city which is connected with every other city by direct flights each way, both in the morning as well as in the evening. The only direct flights which will be scheduled are originating and/or terminating in one of the hubs. Then the minimum number of direct flights that need to be scheduled so that the underlying principle of the airline to serve all the ten cities is met without visiting more than one hub during one trip is:
Solution :
The correct option is C.
Let the total number of cities be 10, out of which 3 cities are developed as hubs, and the remaining 7 cities are non-hubs.
Let the hubs be denoted as and the non-hubs as .
We analyze the two required types of travel routes:
1. Hub to Hub flights:
Since there are 3 hubs, each hub must be connected to every other hub. For any pair of hubs, say and :
• There must be a direct flight from to in the morning and from to in the evening.
• Conversely, there must be a direct flight from to in the morning and from to in the evening.
Thus, each pair of hubs requires 4 direct flights. With 3 hubs, the number of pairs is pairs.
Total flights between hubs = flights.
2. Non-hub to Hub flights:
For any non-hub city to reach any other non-hub city without visiting more than one hub during the trip, the route must be:
• In the morning:
• In the evening:
where and are hubs (which could be the same hub or different hubs).
For this to work for any pair of non-hubs, every non-hub city must have a morning flight to all hubs and an evening flight from all hubs, and also a morning flight from all hubs and an evening flight to all hubs.
Specifically, for each non-hub city and each hub , we need:
• Morning: and
• Evening: and
This means we need 4 flights for every (non-hub, hub) pair.
With 7 non-hubs and 3 hubs, there are pairs.
Total flights between non-hubs and hubs = flights.
3. Total scheduled flights:
Summing the two types of flights gives:
Total = flights.
Completely free for students. Educators & coaching institutes get 2 months free Pro trial to create tests.
Access unlimited practice questions, detailed step-by-step solutions, and exam study materials — completely free for students.
Create and conduct professional online assessments with AI question generation, tab proctoring, and comprehensive batch management.
Practice the complete CLAT 2015 UG Question Paper to improve your preparation for the Common Law Admission Test. This previous year paper covers the key sections of CLAT UG, including English, General Knowledge & Current Affairs, Elementary Mathematics, Legal Aptitude, and Logical Reasoning. Solve CLAT 2015 UG questions to understand the previous year exam pattern, practice important concepts, improve accuracy and speed, and prepare effectively for law entrance examinations.
Prepare for CLAT 2019 UG with the complete question paper and solutions. This paper covers all major sections of the Common Law Admission Test (CLAT) Undergraduate exam, including English Language, Current Affairs & General Knowledge, Legal Reasoning, Logical Reasoning, and Quantitative Techniques.Use the CLAT 2019 UG question paper to practice exam-level questions, understand the question pattern, improve time management, and strengthen your preparation for law entrance examinations.
Copyright © 2026 Combe Labs Private Limited. All Rights Reserved.