Google Interview Questions

Google — Interview Questions

Aptitude · Reasoning · English · CS — Corporate & Campus Interview Prep

7 Questions 10 Topics Take Test

Showing 1–7 of 7 questions

Q.1 Hard Google

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

A Some roses are red

B All roses are red

C No conclusion can be drawn

D All red things are flowers

Correct Answer: C. No conclusion can be drawn

Explanation:

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.

Take Test

Q.2 Hard Google

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

A √34 km

B √40 km

C 5 km

D 10 km

Correct Answer: A. √34 km

Explanation:

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

Take Test

Q.3 Hard Google

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

A n & (n-1) == 0

B n % 2 == 0

C n / 2 == 1

D sqrt(n) is integer

Correct Answer: A. n & (n-1) == 0

Explanation:

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.

Take Test

Q.4 Hard Google

What is the space complexity of DFS using recursion?

A O(1)

B O(n)

C O(log n)

D O(h) where h is height

Correct Answer: D. O(h) where h is height

Explanation:

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).

Take Test

Q.5 Hard Google

What is eventual consistency in distributed systems?

A All nodes have same data at all times

B Data will be consistent across all nodes eventually

C Consistency is never achieved

D Only one node is consistent

Correct Answer: B. Data will be consistent across all nodes eventually

Explanation:

Eventual consistency means that if no new updates are made, all nodes will eventually see the same data, though there may be temporary inconsistencies.

Take Test

Q.6 Hard Google

What is the CAP theorem in distributed systems?

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

B Consistency, Availability, Partition tolerance - you can have at most two

C It's about database capacity

D It's about memory limits

Correct Answer: B. Consistency, Availability, Partition tolerance - you can have at most two

Explanation:

CAP theorem states that distributed systems can guarantee at most two of: Consistency, Availability, and Partition tolerance.

Take Test

Q.7 Hard Google

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

A 99.9%

B 36.5%

C 1%

D 50%

Correct Answer: B. 36.5%

Explanation:

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

Take Test

All Subjects & Topics