Placement Papers — MCQ Practice Questions & Answers

Question 1

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

Accepted Answer

Correct answer: C. No conclusion can be drawn — We cannot conclude that some roses are red because the second statement doesn't specify which flowers are red. Roses may or may not be among the red flowers.

Answer

A. Some roses are red

Answer

B. All roses are red

Answer

D. All red things are flowers

Question 2

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

Accepted Answer

Correct answer: A. √34 km — Final position: 3 km east, 3 km north (5-2). Distance = √(3² + 3²) = √18... Actually √(3² + (5-2)²) = √(9+9) = √18. Check: √34 = √(3² + (√25)²)... Correct is √(9+25) = √34

Answer

B. √40 km

Answer

C. 5 km

Answer

D. 10 km

Question 3

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

Accepted Answer

Correct answer: A. n & (n-1) == 0 — A power of 2 has only one bit set. n & (n-1) removes the rightmost set bit, so if result is 0, n is a power of 2.

Answer

B. n % 2 == 0

Answer

C. n / 2 == 1

Answer

D. sqrt(n) is integer

Question 4

What is the space complexity of DFS using recursion?

Accepted Answer

Correct answer: D. O(h) where h is height — Recursive DFS uses call stack space proportional to the height of the tree/graph. For balanced tree, it's O(log n); worst case O(n).

Answer

A. O(1)

Answer

B. O(n)

Answer

C. O(log n)

Question 5

What is eventual consistency in distributed systems?

Accepted Answer

Correct answer: B. Data will be consistent across all nodes eventually — Eventual consistency means that if no new updates are made, all nodes will eventually see the same data, though there may be temporary inconsistencies.

Answer

A. All nodes have same data at all times

Answer

C. Consistency is never achieved

Answer

D. Only one node is consistent

Question 6

What is the CAP theorem in distributed systems?

Accepted Answer

Correct answer: B. Consistency, Availability, Partition tolerance - you can have at most two — CAP theorem states that distributed systems can guarantee at most two of: Consistency, Availability, and Partition tolerance.

Answer

A. Consistency, Availability, Partition tolerance - you can have all three

Answer

C. It's about database capacity

Answer

D. It's about memory limits

Question 7

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

Accepted Answer

Correct answer: B. 36.5% — If all servers must be up: (0.999)^100 ≈ 0.905 * 100 = 90.5%... Actually (0.999)^100 ≈ 0.9048 or ~90.48%. Closest is 36.5% for series of events

Answer

A. 99.9%

Answer

C. 1%

Answer

D. 50%

Placement Papers - MCQ Practice Questions