1 DESCRIPTION Suppose you're working as a developer in a big company and human resources specialist ask you to develop a software which helps them hire the best com- puter engineer amongst applicants. Human resources specialist gave the the requirements of the job as a check list and using that software, he expects to hire employees as fast as possible. The check list for the job is below: Score for C++ development capability of the candidate (between 1-10) Score for operating system administration capability of the candidate (be- tween 1-10) Score of experience in software development (score in years. ex: for a 5 year experience, score will be 5.) Score of agile software development (between 1-10) Bachelor GPA of candidate (between 1-4) . Whether if candidate has bachelors, masters or doctorate degree.(if bach- elors:1, if masters:2, if doctorate:3) HINT: You can create a class named candidate for further use. For comparing applicants, the software will calculate a weighted average of the scores which HR specialists can evaluate candidates using them. 1 HINT: Consider creating a method named AverigeScore which takes weights of each requirement from the check list as a parameter so that HR specialist can change them in need. HR specialist can search for an applicant, print the CV (CV:name, surname, all scores listed above.), change the weights of the requirements in need. However the application itself will find the best match at the end. HINT: Consider creating a method printCV in the class candidate. Keep in mind that average score calculation is independent from class candidate. After the end of the job application process, HR representative wants to see the applicants on the order of first in-first out (HINT: queue.). Then he wants to enter the weights of the averaging function and wants the ordered printed CVs. First applicant will be the accepted one. Moreover, the IT director wants the software to use less possible computa- tional resources of the company. To this end, he wants you to try binary search tree, sorting and other searching algorithms (sce chapter 10.) Besides binary search tree, he asks you to use bubble sort and merge sort. Print the computa tional time of each search methods, and pick the best one. This will be named as "testing phrase". Plus, IT director wants the printing process recursive. After you pick the most efficient algorithm, you'll make the software live to the HR representative; let him enter the applicants and find the best one for him. HINT: for printing the execution time of a function (or an algorithm), you can use this code snippet: #include int main(void) { clock_t tStart - clock(); 7.Write the function of the sorting here./ printf("Time taken: *.218 ", (double) (clock) - Start)/CLOCKS_PER_SEC); return 0; ) Keep in mind that you should downlond some additional libraries for using the code snippet above. Feel free to use another way of computational time calculation 2 EXECUTION EXAMPLE Note 1: For ench phase testing and live), plewe enter much more appli- cant (at least 7). For the sake of rondability, there is only two applicants to be processed Note 2: On the execution example below, on the testing phase, algorithm names are not specified. On your execution, we would like to see algoritm names (binnry search, toerige sort...) Note 3 Feel free to make it more rendable! -TESTING PHASE- Hello, developer. First, please enter weights of each score score 1: 2 score 2: 5 score 3: 5 score 4: 3 score 5: 8 score 6: 9 Thank you! Do you like to enter an applicant? (y) y Please enter applicant name: John Enter C++ development score: 3 Enter OS capability score: 2 Enter experience in software development in years: 4 Enter agile software development score: 3 Enter bachelor GPA: Enter education status: (1-bachelor, 2-masters, 3-doctorate) 2 Do you like to enter more applicanta? (y): Please enter applicant name: Jane Enter C++ development score: 3.1 Enter is capability score: 8 Enter experience in software development in years: 7 Enter agile software development score ! 6 Enter bachelor GPA: 3 Enter education status: (1-bachelor, 2-masters, 3-doctorate) 3 Do you like to enter more applicants? (y): Best Applicant: Jane Computational time of algorithm 1: 5 ms. Computational time of algorithm 2: 3 ms. Computational time of algorithm 3: 1 ms. You should pick algorithm 3! Make the application live with algorithm 3! LIVE PHASE Hello, HR representative. First, please enter weights of each score score 1: 2 score 2: 5 score 3: 5 score 4: 3 score 5: 8 score 6: 9 Thank you! Do you like to enter an applicant? (y) y Please enter applicant name: Phoebe Enter C++ development score! 4 Enter OS capability score: 6 Enter experience in software development in years: 7 Enter agile software development score: 2 Enter bachelor GPA Enter education status: (1-bachelor, 2-nasters, 3-doctorate) 1 Do you like to enter more applicanta? (y): 53% + Please enter applicant name: Taylor Ester C++ development score: 9 Enter os capability score: 8 Enter experience in software development in years: Enter agile software development score: 6 Enter bachelor GPA: 3.5 Enter education status: (1-bachelor, 2-sasters, 3-doctorate) Do you like to enter more applicanta? (/s): n Applicants lint: 1- Taylor, 9, 8, 7, 6, 3.5, 3. Average score: 6.125 2- Phoebe. 4. 6. 7. 2. 2.5. 1. Average score: 3.375 Best Applicant: Taylor