Job application Program plan: In a file “JobApplicant.java”, create a class “JobApplicant”, Declare the necessary variables. Define the constructor, Assign the initial values for the job applicant. Define the method “get_Name()”, Return the name. Define the method “get_Phone()”, Return the phone number. Define the method “get_HasWordSkill()”, Return the Boolean value. Define the method “get_HasSpreadsheetSkill()”, Return the Boolean value. Define the method “get_HasDatabaseSkill()”, Return the Boolean value. Define the method “get_HasGraphicsSkill()”, Return the Boolean value. In a file “TestJobApplicants.java”, create a class “TestJobApplicants”, Define the method “main ()”, Call the constructor “JobApplicant()” that instantiates several job applicant objects. Assign the text messages. Execute for “true” statement for the first applicant. Call the method “display1()” with qualified message. Otherwise, call the method “display1()” with non-qualified message. Execute for “true” statement for the second applicant. Call the method “display1()” with qualified message. Otherwise, call the method “display1()” with non-qualified message. Execute for “true” statement for the third applicant. Call the method “display1()” with qualified message. Otherwise, call the method “display1()” with non-qualified message. Execute for “true” statement for the fourth applicant. Call the method “display1()” with qualified message. Otherwise, call the method “display1()” with non-qualified message. Define the method “is_Qualified()” that accepts each job applicant properties, Set the count to “0”. Declare Boolean variable. Declare the final variable. Execute for the Boolean value at “word”, Increment the count by “1”. Execute for the Boolean value at “sp”, Increment the count by “1”. Execute for the Boolean value at “db”, Increment the count by “1”. Execute for the Boolean value at “gr”, Increment the count by “1”. Check whether the count is greater than or equal to minimum number of skills, If it is true, set the Boolean value to “true”. Otherwise, set the Boolean value to “false”. Return the Boolean value. Define the method “display1()”, Print the output.

Question

Exercise 1 Function and Structure [30 pts] Please debug the following program and answer the following questions. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. #include typedef struct node { int value; struct node *next; } node; int 11_has_cycle (node *first) if (first == node *head = { NULL) return 0; first; while (head->next != NULL) { } if (head first) { return 1; } head = head->next; return 0; void test ll_has_cycle () { int i; node nodes [6]; for (i = 0; i < 6; i++) { nodes [i] .next = NULL; nodes [i].value = i; } nodes [0] .next = &nodes [1]; nodes [1] .next = &nodes [2]; nodes [2] .next = &nodes [3]; nodes [3] .next nodes [4] .next &nodes [4]; NULL; nodes [5] .next = &nodes [0]; printf("1. Checking first list for cycles. \n Function 11_has_cycle says it has s cycle\n\n", 11_has_cycle (&nodes [0])?"a":"no"); printf("2. Checking length-zero list for cycles. \n Function 11_has_cycle says it has %s…

Answer 1

Question

Chapter 5, Problem 7PE

Program Plan Intro

Job application

Program plan:

In a file “JobApplicant.java”, create a class “JobApplicant”,

Declare the necessary variables.

Define the constructor,

Assign the initial values for the job applicant.

Define the method “get_Name()”,

Return the name.

Define the method “get_Phone()”,

Return the phone number.

Define the method “get_HasWordSkill()”,

Return the Boolean value.

Define the method “get_HasSpreadsheetSkill()”,

Return the Boolean value.

Define the method “get_HasDatabaseSkill()”,

Return the Boolean value.

Define the method “get_HasGraphicsSkill()”,

Return the Boolean value.

In a file “TestJobApplicants.java”, create a class “TestJobApplicants”,

Define the method “main ()”,

Call the constructor “JobApplicant()” that instantiates several job applicant objects.

Assign the text messages.

Execute for “true” statement for the first applicant.

Call the method “display1()” with qualified message.

Otherwise, call the method “display1()” with non-qualified message.

Execute for “true” statement for the second applicant.

Call the method “display1()” with qualified message.

Otherwise, call the method “display1()” with non-qualified message.

Execute for “true” statement for the third applicant.

Call the method “display1()” with qualified message.

Otherwise, call the method “display1()” with non-qualified message.

Execute for “true” statement for the fourth applicant.

Call the method “display1()” with qualified message.

Otherwise, call the method “display1()” with non-qualified message.

Define the method “is_Qualified()” that accepts each job applicant properties,

Set the count to “0”.

Declare Boolean variable.

Declare the final variable.

Execute for the Boolean value at “word”,

Increment the count by “1”.

Execute for the Boolean value at “sp”,

Increment the count by “1”.

Execute for the Boolean value at “db”,

Increment the count by “1”.

Execute for the Boolean value at “gr”,

Increment the count by “1”.

Check whether the count is greater than or equal to minimum number of skills,

If it is true, set the Boolean value to “true”.

Otherwise, set the Boolean value to “false”.

Return the Boolean value.

Define the method “display1()”,

Print the output.

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

Exercise 1 Function and Structure [30 pts] Please debug the following program and answer the following questions. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. #include typedef struct node { int value; struct node *next; } node; int 11_has_cycle (node *first) if (first == node *head = { NULL) return 0; first; while (head->next != NULL) { } if (head first) { return 1; } head = head->next; return 0; void test ll_has_cycle () { int i; node nodes [6]; for (i = 0; i < 6; i++) { nodes [i] .next = NULL; nodes [i].value = i; } nodes [0] .next = &nodes [1]; nodes [1] .next = &nodes [2]; nodes [2] .next = &nodes [3]; nodes [3] .next nodes [4] .next &nodes [4]; NULL; nodes [5] .next = &nodes [0]; printf("1. Checking first list for cycles. \n Function 11_has_cycle says it has s cycle\n\n", 11_has_cycle (&nodes [0])?"a":"no"); printf("2. Checking length-zero list for cycles. \n Function 11_has_cycle says it has %s…

how to read log logs

Discrete Mathematics for Computer Engineering