iGET

Placement Papers - MCQ Practice Questions

Practice free Placement Papers multiple-choice questions with detailed answers and explanations. Perfect for competitive exam preparation.

654 questions | 100% Free

Q.61Hard

What will be the output of the following code? int x = 5; int y = ++x + x++; System.out.println(y);

Q.62Hard

Which of the following is a characteristic of a good hash function?

Q.63Hard

If a HashMap has 1000 entries and the load factor is 0.75, at what capacity will it resize?

Q.64Hard

A system processes 1000 requests per second. If 8% of requests fail and need retry, and each retry takes 2 seconds, approximately how many total seconds are needed to process 10,000 requests including retries (assuming sequential processing)?

Q.65Hard

Identify the statement that best fits the pattern: All roses are flowers. Some flowers are red. Therefore:

Q.66Hard

Directions: A man walks 5 km north, then 3 km east, then 2 km south. How far is he from the starting point?

Q.67Hard

What is the correct way to check if a number is a power of 2?

Q.68Hard

What is the space complexity of DFS using recursion?

Q.69Hard

What is eventual consistency in distributed systems?

Q.70Hard

What is the CAP theorem in distributed systems?

Q.71Hard

In a system with 100 servers, if each has 99.9% uptime, what is the system's expected uptime?