Q91. What is the diamond problem and how do languages solve it?
The diamond problem occurs when a class inherits from two classes that share a common ancestor, so the same base members are inherited along two paths. Ambiguity arises o...
Technical Question Bank · Peer-Reviewed
Search and filter frequently asked interview questions across technical, programming, and behavioral domains. Tailor your interview preparation by difficulty for freshers or experienced developers (182 available).
The diamond problem occurs when a class inherits from two classes that share a common ancestor, so the same base members are inherited along two paths. Ambiguity arises o...
When you run many hypothesis tests, the chance of at least one false positive grows quickly. With 20 independent tests at alpha 0.05, the probability of a false positive ...
Data leakage is when information unavailable at prediction time seeps into training, producing optimistic validation scores that collapse in production. Common sources: -...
A hot key is accessed so frequently that a single cache node or partition becomes a bottleneck. Keys are distributed by consistent hashing, but one key always maps to one...
A stateless JWT cannot be un-issued, so revocation needs supporting state. Options: - Denylist: store revoked token identifiers (`jti`) until their `exp`, and check on ea...
Kafka combines two features: - Idempotent producer: each producer gets a producer id and sequence numbers. The broker deduplicates retries within a session, so a network ...
CAP states that during a network partition a distributed system must choose between consistency (every read sees the latest write) and availability (every request gets a ...
REST excels at resource-oriented CRUD with cacheable, uniform interfaces and a broad tool ecosystem. It becomes awkward when: - The domain is action-oriented or RPC-like,...
Testing a distributed system needs a layered strategy, because full end-to-end coverage does not scale. - Unit tests per service for domain logic, run on every commit. - ...
Scaling relational databases follows a progression, because a single node eventually hits CPU, memory or I/O limits. 1. Optimise first: fix queries, add indexes, tune the...
HireXTech uses essential storage to remember your study preferences and third-party advertising cookies via Google AdSense in compliance with GDPR. You can choose to enable essential cookies only or accept all cookies. Read our Privacy Policy.