Complete the sentence: Despite his _____ circumstances, he remained optimistic.
Answer: B
'Adverse' is an adjective meaning unfavorable. It correctly modifies 'circumstances'.
Q.22Medium
What is the synonym of 'Meticulous'?
Answer: D
Meticulous means very careful and precise. Both 'Careful' and 'Systematic' are synonyms.
Q.23Easy
How many times does the letter 'e' appear in the word 'independence'?
Answer: B
i-n-d-e-p-e-n-d-e-n-c-e. The letter 'e' appears at positions 4, 6, 9, and 12 = 4 times
Q.24Easy
Fill in the blank: The _____ of the novel was unexpected and thrilling.
Answer: A
'Climax' is the turning point or the most exciting part of a story. 'Climate' refers to weather patterns.
Q.25Easy
What does the prefix 'un-' typically mean in English?
Answer: B
'Un-' is a prefix meaning 'not' or the opposite of something (unhappy = not happy).
Advertisement
Q.26Medium
Which of the following is a programming paradigm Google emphasizes for systems design?
Answer: D
Google uses both functional and OOP paradigms depending on requirements. Go language (created by Google) supports both paradigms.
Q.27Medium
In a hash table with 10 slots, if 15 elements are inserted with a good hash function, what is the expected average chain length?
Answer: A
Load factor = n/m = 1015 = 1.5. Average chain length in hash table = load factor = 1.5
Q.28Medium
What is the space complexity of QuickSort?
Answer: B
QuickSort uses O(log n) space for the recursion call stack in the average case.
Q.29Easy
In a BFS (Breadth-First Search), what data structure is used?
Answer: B
BFS uses a Queue (FIFO) to explore nodes level by level. DFS uses a Stack (LIFO).
Q.30Hard
What is the correct way to check if a number is a power of 2?
Answer: A
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.
Q.31Medium
Which sorting algorithm is stable and has O(n log n) worst-case complexity?
Answer: B
MergeSort has O(n log n) worst-case and is stable. QuickSort is O(n²) worst-case, HeapSort is not stable.
Q.32Easy
What is the result of 1 XOR 1?
Answer: A
XOR (exclusive OR) returns 1 only when bits are different. 1 XOR 1 = 0 because both bits are the same.
Q.33Medium
In dynamic programming, what is memoization?
Answer: B
Memoization is an optimization technique where results of expensive function calls are cached and returned when same inputs occur again.
Q.34Easy
What is the time complexity of finding the median in a sorted array?
Answer: A
In a sorted array, median is at index n/2, which is accessed in constant time O(1).
Q.35Hard
What is the space complexity of DFS using recursion?
Answer: D
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).
Q.36Medium
What is the correct output of: print(2 3 2) in Python?
Answer: B
Exponentiation is right-associative in Python. 32 = 9, then 29 = 512
Q.37Medium
In microservices architecture, what is an API Gateway?
Answer: B
API Gateway is a server that acts as an intermediary between clients and microservices, handling routing, authentication, and load balancing.
Q.38Medium
What principle is followed when designing Google's systems?
Answer: B
Google designs distributed systems that can scale horizontally across many machines to handle billions of requests.
Q.39Hard
What is eventual consistency in distributed systems?
Answer: B
Eventual consistency means that if no new updates are made, all nodes will eventually see the same data, though there may be temporary inconsistencies.
Q.40Hard
What is the CAP theorem in distributed systems?
Answer: B
CAP theorem states that distributed systems can guarantee at most two of: Consistency, Availability, and Partition tolerance.
