## 3 Proposed Hierarchy-Based Competency Structure and Its Application in E-Evaluation
### Competency Tree Application in E-Evaluation
One task might be mapped with multiple competencies in the competency tree; however, parent and child competencies will not be selected as mapping with higher-level competency means the child competencies are fully covered and need no additional mapping. Therefore, the task score \(S(T)\) for task \(T\), with a set of mapped competencies \(A\), will be calculated as the sum of scores of each competency in the set \(A\), see in Equation (5). \[S(T)=\sum_{i\in A}s(i)!K(i) \tag{5}\]where \(S(T)\) is a score for task \(T\), \(A\) is a set of mapped competencies to the task, \(K(i)\) is an integration complexity for competency \(i\) in mapped competency set \(A\). As integration complexity \(k\) is calculated according to Equation (1), the integration complexity coefficient \(K(i)\) for scored competency \(i\) should be calculated analog, however, taking into account how many sibling competencies \(m(i)\) are integrated into the same task rather than how many sibling competencies exist. \[K(i)=\left\{ \begin{array}{rl}\frac{m(i)+1}{C},&m(i)\leq C\\ 1,&m(i)>C\end{array} \right. \tag{6}\]  
where \(K(i)\) is the integration complexity coefficient for competency \(i\), \(m(i)\) is the number of mapped sibling competencies in the task, and \(C\) is the expected cognitive abilities for certain grade students. Meanwhile, the course/test score or score of multiple tasks should not be calculated as the sum of score from multiple tasks. The total score has to be calculated as one bigger task, with all competencies, achieved within all different tasks. To do the calculation, a list of competencies have to be selected to make sure child competencies of achieved competency are not included. For example, students are able to solve one task where two out of four competencies are involved and another task, where two competencies are covered, but one of them is the same as in the first task; students' cognitive ability is \(C=3\); one competency covering task score is \(s(i)=0.125\). According to this situation, the score for the first and second task with two child competencies will be equal to \(S(T)=0.42\). Meanwhile, the score for both tasks is not equal to 0.84, but 0.625 as only three competencies out of four are proved, and the student was not able to combine at least three competencies into one task, but instead combined only two competencies in one task. The proposed method will allow adaptive e-evaluation as students will be objective-oriented and will seek to prove certain competencies rather than doing separate tasks. However, to implement it--the course/test/task competency tree must be provided as well as information on the mapping between each task and the competency tree. If the student will be able to see all the information during the evaluation, he or she will be able to trace which competencies are achieved already, which tasks need to be done to prove missing competencies. In the case of e-learning systems, multiple tasks can be generated for one test. While the tasks will have different combinations of competencies, personalized e-evaluation can be implemented by allowing the student to decide which tasks have to be done to show the required competencies. The ability to choose tasks according to the student's competency level will minimize the number of tasks to be solved for students with higher competency level, while students with the lower competency level will be able to do only those tasks they are able to implement correctly, and this will identify the student's achieved competency level. At the same time, it can help to improve the self-regulated learning behavior [36] and clarify the need for planning to achieve the bigger level competency [37] as the student has a clear aim to achieve and sees what need to be achieved to achieve the main objective. In the e-learning environment, the selection/proposition of possible task could be implemented according to this schema:  
1. All tasks are arranged from the top score to lower score and stored as a list of possible tasks. 2.