iGET

Placement Papers - MCQ Practice Questions

Campus recruitment tests follow their own rhythm: a fixed time limit, a mix of sections, and negative marking that punishes guessing. This collection mirrors that format with quantitative aptitude, logical reasoning, verbal ability, and technical questions of the kind IT and core companies actually ask. Use it to build exam stamina, not just to check whether you know a topic.

658 questions | 100% Free

Q.501Medium

A person covers 60% of a journey by train, 30% by bus, and the remaining distance of 20 km by walk. What is the total distance?

Q.502Easy

A box contains 3 red balls, 4 blue balls, and 5 green balls. What is the probability of drawing a red ball?

Q.503Easy

If the cost price is Rs. 500 and profit percentage is 25%, what is the profit amount?

Q.504Medium

Three numbers are in the ratio 2:3:5. If their sum is 100, what is the largest number?

Q.505Easy

A worker can complete a task in 10 days. How much work will be done in 3 days?

Q.506Easy

If a < b and b < c, which of the following is true?

Q.507Medium

A number when divided by 12 leaves remainder 5. What is the remainder when the number is divided by 4?

Q.508Medium

If 5 workers can build a wall in 12 days, how many days will 10 workers take?

Q.509Easy

The average of five numbers is 30. What is their sum?

Q.510Easy

Find the missing number in the series: 2, 4, 8, 16, ?, 64

Q.511Medium

If a person buys 10 items at Rs. 50 each and sells them at Rs. 60 each, what is the profit percentage?

Q.512Easy

Complete the analogy: Dog : Bark :: Cat : ?

Q.513Medium

If all roses are flowers and some flowers are red, then which statement is true?

Q.514Easy

Find the odd one out: 12, 24, 36, 48, 58

Q.515Medium

If ROSE is coded as 4567, then PETAL is coded as?

Q.516Medium

Select the word that is most similar in meaning to 'Benign':

Q.517Medium

Antonym of 'Verbose' is:

Q.518Easy

Which data structure uses LIFO (Last In First Out)?

Q.519Easy

In OOP, what is inheritance?

Q.520Medium

Which sorting algorithm has the best average case time complexity?