Miscellaneous - Previous Year CAT/MBA Questions
The best way to prepare for Miscellaneous is by going through the previous year Miscellaneous CAT questions. Here we bring you all previous year Miscellaneous CAT questions along with detailed solutions.
Click here for previous year questions of other topics.
It would be best if you clear your concepts before you practice previous year Miscellaneous CAT questions.
If the storage cost is reduced to Re 0.80 per cubic feet per day, then on which day(s), should the truck be hired?
- (a)
4th
- (b)
7th
- (c)
4th and 7th
- (d)
None of these
Answer: Option B
Text Explanation :
If the storage cost is reduced to Re 0.8 per cubic feet, then the cost pattern is as given in the following table.
** In spite of the fact that storing is cheaper than hiring truck on the last day, we have to do with the latter option because everything that is manufactured has to be sent to the market.
Hence, the most cost-effective scheme would be sending the entire production on the 7th day.
Workspace:
Find the value of
- (a)
- (b)
- (c)
- (d)
Answer: Option B
Text Explanation :
Workspace:
A, B, C and D are four towns, any three of which are non-collinear. Then the number of ways to construct three roads each joining a pair of towns so that the roads do not form a triangle is
- (a)
7
- (b)
8
- (c)
9
- (d)
24
Answer: Option D
Text Explanation :
Let us choose a town, say A.
If I were to consider this as the base town and construct two roads such that I connect any pair of towns, I get
the following combinations:
1. AB – BC, 2. AB – BD, 3. AC – CB, 4. AC – CD,
5. AD – DB and 6. AD – DC.
From any of these combinations, if I were to construct a road such that it again comes back to A, then it would form a triangle.
To avoid a triangle, the third road that I construct should not be connected to A but to the third town.
Hence, the combination would be:
1. AB – BC – CD, 2. AB – BD – DC, 3. AC – CB – BD,
4. AC – CD – DB, 5. AD – DB – BC and 6. AD – DC – CB.
Thus, from each town, we can construct 6 such combinations.
Hence, total number of combinations that we can have from four towns = (6 × 4) = 24.
Workspace:
139 persons have signed up for an elimination tournament. All players are to be paired up for the first round, but because 139 is an odd number one player gets a bye, which promotes him to the second round, without actually playing in the first round. The pairing continues on the next round, with a bye to any player left over. If the schedule is planned so that a minimum number of matches is required to determine the champion, the number of matches which must be played is
- (a)
136
- (b)
137
- (c)
138
- (d)
139
Answer: Option C
Text Explanation :
This can be logically done in the following manner.
There are 139 players in all. We want to determine 1 champion among them. So all except the Champion should lose. A player can lose only once and since any match produces only one loser, to produce 138 losers, there should be 138 matches that should be played.
Hence, option (c).
Workspace:
There are ten 50 paise coins placed on a table. Six of these show tails, four show heads. A coin is chosen at random and flipped over (not tossed). This operation is performed seven times. One of the coins is then covered. Of the remaining nine coins, five show tails and four show heads. The covered coin shows
- (a)
a head
- (b)
a tail
- (c)
more likely a head
- (d)
more likely a tail
Answer: Option A
Text Explanation :
The initial reading for 10 coins is : 6 Tails and 4 Heads After repeating the process of flipping one coin at random for 7 times, the final reading for 9 coins is: 5 Tails and 4 Heads.
Therefore, possible final reading for 10 coins is: 6 Tails and 4 Heads or 5 Tails and 5 Heads. If the final reading is 6T and 4H, it is same as the initial one. However, this is not possible as the process of flipping a coin has taken place an odd number of times, so there has to be atleast one change in the final reading.
Therefore, the final reading is 5T and 5H.
So the covered coin will certainly be a Head.
Hence, option (a).
Workspace:
The following functions have been defined for three numbers A, B and C:
@ (A, B) = average of A and B
*(A, B) = product of A and B
/(A, B) = A divided by B
Answer these questions with the above data.
If A = 2 and B = 4, the value of @(/(*(A, B), B), A) would be
- (a)
2
- (b)
4
- (c)
6
- (d)
16
Answer: Option A
Text Explanation :
@(/(*(2, 4), 4), 2) = @(/(8, 4), 2) = @(2, 2) = 2.
Hence, option (a).
Workspace:
The sum of A and B is given by
- (a)
*(@(A, B), 2)
- (b)
/(@(A, B), 2)
- (c)
@(*(A, B), 2)
- (d)
@(/(A, B), 2)
Answer: Option A
Text Explanation :
A + B = 2((A + B)/2) = 2(@(A, B)) = *(@(A, B), 2).
Hence, option (a).
Workspace:
The sum of A, B, and C is given by
- (a)
*(@(*(@(B, A), 2), C), 3)
- (b)
/(@(*(@(B, A), 3), C), 2)
- (c)
/(*(@(*(B, A), 2), C), 3)
- (d)
None of these
Answer: Option D
Text Explanation :
(HINT : the best way is to simplify the answer choices and work backwards.)
Hence, option (d).
Workspace:
A calculator has two memory buttons, A and B. Value 1 is initially stored in both memory locations.
The following sequence of steps is carried out five times:
- add 1 to B
- multiply A to B
- store the result in A
What is the value stored in memory location A after this procedure?
- (a)
120
- (b)
450
- (c)
720
- (d)
250
Answer: Option C
Text Explanation :
A | B | Step I (B + 1) |
Step II (A × B) |
Step III A |
Step III B |
|
---|---|---|---|---|---|---|
Beginning | 1 | 1 | ||||
1st time | 1 | 1 | B = 2 | (1 × 2) = 2 | 2 | 2 |
2nd time | 2 | 2 | B = 3 | (2 × 3) = 6 | 6 | 3 |
3rd time | 6 | 3 | B = 4 | (6 × 4) = 24 | 24 | 4 |
4th time | 24 | 4 | B = 5 | (24 × 5) = 120 | 120 | 5 |
5th time | 120 | 5 | B = 6 | (120 × 6) = 720 | 720 | 6 |
Hence, option (c).
Workspace:
In a six-node network, two nodes are connected to all the other nodes. Of the remaining four, each is connected to four nodes. What is the total number of links in the network?
- (a)
13
- (b)
15
- (c)
7
- (d)
26
Answer: Option A
Text Explanation :
Nodes 1 & 2 will be connected with 5 links each hence, we get 10 links
Nodes 3, 4, 5, and 6 will be connected witih 4 links each hence, we get 16 links.
Total links = 10 + 16 = 26.
Now since each link connects 2 nodes, unique number of links = 26/2 = 13.
Alternately,
(Note : In the diagram given below, the top two nodes are connected to all the other nodes, while the remaining four are connected to only four other nodes).
You find that the total number of links in the network is 13.
Hence, option (a).
Workspace:
Feedback
Help us build a Free and Comprehensive Preparation portal for various competitive exams by providing us your valuable feedback about Apti4All and how it can be improved.