ADVANCED TOPICS IN COMPILER DESIGN
CODE GENERATION FOR OBJECT ORIENTED LANGUAGES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
A teacher wants to arrange 32 students in groups of 4 using the following process. Each student in the class ranks the other students in order of preference. After finding all possible groups of 4, the ranking data are used to determine the average of each group member’s satisfaction with other group members to determine the best possible solution, which consists of the highest average satisfaction rating for all students. In a class of 32 students, there are approximately 5.9×1019 different possible groupings. Which of the following best describes the computational limitations of a program designed to implement this process?
|
|
Finding the best possible solution is impossible, since there are so many possibilities to consider.
|
|
|
Finding an optimal solution is impossible, since no algorithm exists that can solve the problem exactly.
|
|
|
Finding an optimal solution is difficult, since the data cannot easily be stored in a digital format.
|
|
|
Finding an acceptable solution using a heuristic approach is possible, but the solution may differ from the best possible solution.
|
Explanation:
There is 1 question to complete.