In ï¬g 3.8 above the function Hierarchical Diagram above shows the various modules in the recruitment management system it depicts a kind of organogram of the R.M.S showing the hiring organization, various modules that can be accessed by the hiring organization, the candidate, various modules that can be accessed by the candidate and ï¬nally modules that depend on each other for their functionality.
3.4.3 Logical Modelling of the Recruitment Management System
The knowledge discovery technique implemented in this work is an association rule mining technique the algorithm used to implement this technique is an Apriori algorithm.The algorithm is as outlined below:
STEP 1: Gather necessary data which includes candidate school and exam score
STEP 2: Create an implication by formally describing the gathered data into premise and conclusion A B where:
A is the candidate’s school and B is the exam score.
STEP 3: Add classiï¬ers such as support and conï¬dence to strengthen the rule deï¬ned above.
STEP 4: Calculate the conï¬dence of the rule; this is done by ï¬nding the percentage ratio of the number of people from a school (x) that passed the exam (y) to the number of people from school (x) that participated in the exam (y). Mathematically this is written as

STEP 5: Calculate the support of the rule deï¬ned in Step 2 by ï¬nding the ratio of the number of people from a school (x) that passed the exam (y) to the number of people from school (x) that participated in the exam (y). Mathematically this is written as

STEP 6: Determine where best candidates in a particular ï¬eld are selected from by selecting the school with the maximum support and conï¬dence.
The pseudo code of the algorithm is as written below:
DO
READ ï¬le BEGIN IF
IF candidate passes exam
THEN support EQUALS (total_passed+1/total_participated+1)
AND conï¬dence EQUALS (total_passed+1/total_participated+1*100%)
ELSE
support EQUALS (total_passed/total_participated+1)
AND conï¬dence EQUALS (total_passed/total_participated+1*100%) END IF
BEGIN IF
IF conï¬dence AND support EQUALS maximum THEN display school produces best recruits.
END IF
3.4.4 Activity Diagram
Activity diagrams are graphical representations used to describe dynamic aspects of a system with support for choice, iteration and concurrency. They show the overall flow of control in a system. The most important shapes in an activity diagram are as follows: