EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
9th Edition
ISBN: 9781337671385
Author: FARRELL
Publisher: CENGAGE LEARNING - CONSIGNMENT
bartleby

Videos

Question
Book Icon
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.

Blurred answer
Students have asked these similar questions
Given the following Extended-BNF grammar of the basic mathematical expressions:  Show the derivation steps for the expression: ( 2 + 3 ) * 6 – 20 / ( 3 + 1 ) Draw the parsing tree of this expression. SEE IMAGE
Whentheuserenters!!,themostrecentcommandinthehistoryisexecuted.In the example above, if the user entered the command: Osh> !! The ‘ls -l’ command should be executed and echoed on user’s screen. The command should also be placed in the history buffer as the next command. Whentheuserentersasingle!followedbyanintegerN,theNthcommandin the history is executed. In the example above, if the user entered the command: Osh> ! 3 The ‘ps’ command should be executed and echoed on the user’s screen. The command should also be placed in the history buffer as the next command. Error handling: The program should also manage basic error handling. For example, if there are no commands in the history, entering !! should result in a message “No commands in history.” Also, if there is no command corresponding to the number entered with the single !, the program should output "No such command in history."
Activity No. Activity Time (weeks) Immediate Predecessors 1 Requirements collection 3 2 Requirements structuring 4 1 3 Process analysis 3 2 4 Data analysis 3 2 5 Logical design 50 3,4 6 Physical design 5 5 7 Implementation 6 6 c. Using the information from part b, prepare a network diagram. Identify the critical path.
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781305480537
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Text book image
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:9781337102124
Author:Diane Zak
Publisher:Cengage Learning
Memory Management Tutorial in Java | Java Stack vs Heap | Java Training | Edureka; Author: edureka!;https://www.youtube.com/watch?v=fM8yj93X80s;License: Standard YouTube License, CC-BY