So I will introduce about the difficulty level of SBMPTN question.

If we compare
with National Examination and National science olympiad question, the question of
SBMPTN is more difficult than National Examination but it is easier than the question of
National science olympiad. For example, linear programming question in National
Examination is only ask for intersection at a point, while linear programming question in
SBMPTN begin to be applied into wide calculations using integral, and linear
programming in National science olympiad also to be applied into wide calculations using
integral and asked the point from the line intersection. from the example we know that the
difficulty level is between National Examination and National science Olympiad. In
addition the question of SBMPTN is made according to the capacity of university, so that
the university can get the desired student according to department that have been
selected..
This is one example of the competitiveness sbmptn in ITS. From the data that I got
from official website ITS, it was explained that the department that has a low capacity but
the demand is very much then the level of tightness is tighter or smaller entry opportunities
such as the example of the department of architecture, where the architecture department
has the capacity 40 children but the demand reaches 1623. Conversely, if the department
has a lot of capacity and demand a little then the level of tightness is still low and a great
opportunity to enter.
So, SBMPTN is considered as a fair selection because the results show the ability
of the students and according to department that have been selected