Discussion
Assertion (A): Raising a function's memory can sometimes reduce its total cost.
Reason (R): The function completes proportionately faster because processor share rises with memory.
Answer: B
Both are true and the reason gives the mechanism, and the outcome depends on whether the work is actually processor bound. A function waiting on a network call gains nothing from the extra capacity and simply costs more.
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