Discussion
Why do node counts translate to memory more painfully than to time?
Answer: B
A processor generates millions of nodes a second but a machine holds only a few tens of millions of hundred byte nodes, so the memory is exhausted in seconds while the computation could have continued for hours. That asymmetry is why linear space algorithms matter so much. Access latency, permanence and expandability are secondary. Comparing the rates at which two resources are consumed identifies which will run out first, which is the only question that matters.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development