Answer conceptual true/false and caching questions
Company: Imc
Role: Software Engineer
Category: Software Engineering Fundamentals
Difficulty: medium
Interview Round: HR Screen
You are asked several quick technical screening questions. Answer each with **Yes/No** and provide a brief justification.
1. **(Integer representation)** “64-bit can represent integers two times more than 32-bit.”
2. **(Caching/eviction policies + communication)** Give an example workload where **LFU (Least Frequently Used)** is a better eviction policy than **LRU (Least Recently Used)**. Then explain LFU vs LRU using a **non-technical analogy** understandable to a 3-year-old.
3. **(Asymptotic complexity)** “Binary search on a linked list has time complexity \(O(n\log n)\).”
4. **(Graphs)** “Given \(N\) nodes, an acyclic graph has at most \(N-1\) edges.”
State any assumptions you need (e.g., directed vs. undirected graph, signed vs. unsigned integers).
Quick Answer: This question evaluates understanding of integer representation, caching eviction policies and trade-offs (LFU vs LRU) including communication of analogies, asymptotic algorithmic complexity, and basic graph properties while requiring explicit assumptions about signedness and graph direction.