Discussion
A search generates one million nodes per second. How long does \( 10^{12} \) nodes take?
Answer: D
Dividing the node count by the rate gives:
\[ \tfrac{10^{12}}{10^{6}} = 10^{6} \]
seconds, which is about 11.6 days. Two more levels of a tree with branching factor ten would take three years. Converting node counts into wall clock time is what turns an abstract complexity into a decision about whether a program can be run at all, and it should be done before the program is written.
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