Discussion
Optimal instruction selection over a directed acyclic graph rather than a tree is
Answer: D
Correct answer: computationally hard, so heuristics are used in practice
A tree can be tiled optimally in linear time because each subtree has one parent and can be solved independently. A directed acyclic graph has shared subexpressions with several parents, so the choices interact and the problem becomes NP-hard - which is why the graph is usually split into trees and each tiled separately.
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