Approximate Solution questions are basically coding questions. The solutions to these problems tend to find approximate solutions to optimization problems. These questions are particularly useful for domains of software development where there is no single correct answer, such as image processing or computer vision.
You can create a custom checker to score these questions because these questions have more than one acceptable answer. For example, The list of 5 prime numbers is less than 100. There are 25 prime numbers less than 100. So, candidates can list any combination of 5 prime numbers from the list of 25 prime numbers, and they will all be correct answers. In the custom checker, you can also choose to give a partial score to a candidate who lists 3 prime and 2 composite numbers. The candidate, in this case, will receive 3 points for the question if the total score for this question is 5 points.
Therefore, unlike the binary pass and fail strategy that works well for coding questions, a custom checker can use the logic you determine and give partial credit to make more optimum scoring decisions.
Refer to the following topics for more information:
- Creating an Approximate Solution Type Question
- Scoring an Approximate Solution Type Question
- Creating a Custom Checker