Showing 631–640 of 654 questions
How many times does the letter 'e' appear in the word 'independence'?
Explanation:
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
Fill in the blank: The _____ of the novel was unexpected and thrilling.
A
climax
B
climate
C
climb
D
clamor
Correct Answer:
A. climax
Explanation:
'Climax' is the turning point or the most exciting part of a story. 'Climate' refers to weather patterns.
What does the prefix 'un-' typically mean in English?
A
Before
B
Not or opposite of
C
Above
D
With
Correct Answer:
B. Not or opposite of
Explanation:
'Un-' is a prefix meaning 'not' or the opposite of something (unhappy = not happy).
Which of the following is a programming paradigm Google emphasizes for systems design?
A
Functional Programming
B
Object-Oriented Programming
C
Procedural Programming
D
Both A and B
Correct Answer:
D. Both A and B
Explanation:
Google uses both functional and OOP paradigms depending on requirements. Go language (created by Google) supports both paradigms.
In a hash table with 10 slots, if 15 elements are inserted with a good hash function, what is the expected average chain length?
Explanation:
Load factor = n/m = 15/10 = 1.5. Average chain length in hash table = load factor = 1.5
What is the space complexity of QuickSort?
A
O(1)
B
O(log n)
C
O(n)
D
O(n log n)
Correct Answer:
B. O(log n)
Explanation:
QuickSort uses O(log n) space for the recursion call stack in the average case.
In a BFS (Breadth-First Search), what data structure is used?
A
Stack
B
Queue
C
Priority Queue
D
Deque
Explanation:
BFS uses a Queue (FIFO) to explore nodes level by level. DFS uses a Stack (LIFO).
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.
Which sorting algorithm is stable and has O(n log n) worst-case complexity?
A
QuickSort
B
MergeSort
C
HeapSort
D
Selection Sort
Correct Answer:
B. MergeSort
Explanation:
MergeSort has O(n log n) worst-case and is stable. QuickSort is O(n²) worst-case, HeapSort is not stable.
What is the result of 1 XOR 1?
Explanation:
XOR (exclusive OR) returns 1 only when bits are different. 1 XOR 1 = 0 because both bits are the same.
