Blog

Coursehelp
February 6, 2019
QUESTION : No Comments

Mary Brown has read an article about performance management and is

Mary Brown has read an article about performance management and is wondering whether CRB should implement such a system. Please answer her questions based on your understanding of this small business. Critically assess whether a performance management system would work for such a small business. Discuss benefits that such a system would provide for us as owners and for our employees. Explain any dangers our company faces if we don’t have a performance management system. What could be a problem if we go with a poorly implemented system? What 10 characteristics, at a minimum, should we include in a performance management system? Explain your answer with one to three sentences for each characteristic you recommend. Explain how we could tie our current reward system to a performance management system.

Expert Answer

. . .

OR
OR

Have a Comment on this Question?

Questions viewed by other students


  • QUESTION : (Solved) : Coded Matlab Task Find Minimum Cost Shipping Sets Items Also Positioning Allocation Items Q31219193 . . .

    To be coded in Matlab.

    The task is to find the minimum cost of shipping sets of items,and also the positioning and allocation of items on craft for eachof these sets. Determine the optimal solution for the Sample Mixeslisted in Table 2, but also give consideration to your solutionbeing applied to generic, and larger problems (such as more items,different item types, and different craft sizes.

    Assume there are 4 different types of item (Table 1), and themixes of these items needing to be shipped are in Table 2.

    Item Width Length 2 欠 13 3 TABLE 1. Items types and sizes.

    A standard craft is width 3 units and length 7 units, where thenumber of craft will be limited cost is expensive so this needs tobe minimised also.

    Formulate the problem as an ILP (Integer Linear Program)
    (a) Solving the relaxed problem, what (if anything) does this tellyou about the actual solution? How does the running time changewhen the sample Mix is changed?
    (b) Solve the exact problem. Consider the running time as youchange the Sample Mix. Compare to your results from (a).
    (c) Consider re-formulating so some items might be rotatable.

    Reformulate the problem where a priority is given to certainitems (there may be a benefit from some items arriving beforeothers)
    (d) Formulate your problem as an ILP where item Ii has priorityvalue vi associated; discuss the priority value and number of craftused trade-off when determining an objective function.
    (e) Let vi = i for i = 1, . . . , 4. Solve the ILP. How does thissolution change from parts a, b and c?
    (f) To find an approximate (or exact) solution to the generalproblem, propose a heuristic method and implement and compare withprevious results.

    Item Width Length 2 欠 13 3 TABLE 1. Items types and sizes. Show transcribed image text

    Expert Answer


    . . .


    view full answer
  • QUESTION : (Solved) : Coded Java Doubly Linked List Class Public Class Dllist Private Dnode Head Public Dllist H Q36282856 . . .

    a) Write additional member method for Linked List class called buildFromTexFile(String filename), then the method creates a lIt should coded with java.

    //Doubly Linked List class
    public class DLList {
       private DNode head;
       public DLList(){
           head=null;
       }
       private DNode findeNode(int pos){
           int cnt=1;
           DNode walk=head;
           while(walk!=null){
              
              if(pos==cnt)
                  break;
              walk=walk.getNext();
               cnt++;
           }
           return walk;
          
       }
       public void deleteAt(int pos){
           if(head==null)
               return;
           if(pos==1){
              if(head.getNext()==null){ //if there is only one node
                  head=null;
               }else{
                  head=head.getNext();
                  head.setPrev(null);
               }
           }
           else if(pos>1){
               DNodedeletionNode=findeNode(pos);
              if(deletionNode==null)
                  return;
               elseif(deletionNode.getNext()==null){
                 
                  deletionNode.getPrev().setNext(null);
               }
               else {
                 deletionNode.getPrev().setNext(deletionNode.getNext());
                 deletionNode.getNext().setPrev(deletionNode.getPrev());
               }
           }
       }
      
       public void insertFront(int data){
           DNode newNode=newDNode(data);
           if(head==null)
              head=newNode;
           else{
              newNode.setNext(head);
              head.setPrev(newNode);
              head=newNode;
           }
       }
       //this method will reutrn null reference if pos is notvalid
       private DNode locateNode(int pos){
           int cnt=0;
           DNode walk=head;
           pos–;
           while(walk!=null){
               cnt++;
              if(pos==cnt)
                  break;
              walk=walk.getNext();
           }
           return walk;
          
       }
       public void insertAt(int pos,int data)throwsInvalidPosException{
           if(pos==1){//pos 1 means insertfront
               DNodenewNode=new DNode(data);
              if(head==null)
                  head=newNode;
               else{
                  newNode.setNext(head);
                  head.setPrev(newNode);
                  head=newNode;
               }
           }
           else {
               DNodeinsertionPoint=locateNode(pos);//insertion will be performed afterthis point
              if(insertionPoint==null)
                  throw new InvalidPosException(“InvalidPostion”);
               else{
                  DNode newNode=new DNode(data);
                  if(insertionPoint.getNext()==null){
                     insertionPoint.setNext(newNode);
                     newNode.setPrev(insertionPoint);
                  }
                  else{
                     newNode.setNext(insertionPoint.getNext());
                     insertionPoint.getNext().setPrev(newNode);
                     newNode.setPrev(insertionPoint);
                     insertionPoint.setNext(newNode);
                  }
               }
           }
          
       }
       public void append(int data){
           DNode newNode=newDNode(data);
           DNode walk=head;
           DNode prev=null;//at the end ofwhile loop this ref will be pointing to the last node
           if(head==null){
              head=newNode;
           }else{
              while(walk!=null){
                  prev=walk;
                  walk=walk.getNext();
               }
              prev.setNext(newNode);
              newNode.setPrev(prev);
           }
       }
       @Override
       public String toString(){
           String str=”head->”;
           DNode walk=head;
           while(walk!=null){
              str+=walk.getData()+”->”;
              walk=walk.getNext();
           }
           return str+”null”;
       }
       public static void main(String []s){
           DLList l1=new DLList();
           l1.append(33);
           l1.insertFront(12);
           l1.insertFront(22);
           l1.append(55);
           System.out.println(l1);
           l1.insertAt(1, 42);
           System.out.println(“after insert at1 ,42 :”+l1);
           l1.insertAt(6, 666);
           System.out.println(“after insert at6 ,66 :”+l1);
           l1.insertAt(4, 444);
           System.out.println(“after insert at4 ,444 :”+l1);
          //head->42->22->12->444->33->55->666->null
           l1.deleteAt(3);//delete node 3(value of node is 12)
           System.out.println(l1);//head->42->22->444->33->55->666->null
           l1.deleteAt(6);
          System.out.println(l1);//head->42->22->444->33->55->null
           l1.deleteAt(1);
          System.out.println(l1);//head->22->444->33->55->null
       }

    }

    public class InvalidPosException extends RuntimeException {
       public InvalidPosException(String str){
           super(str);
       }

    }

    a) Write additional member method for Linked List class called buildFromTexFile(String filename), then the method creates a linked list by reading double values from a text file called filename Your program must create a linked list in a way that the first number in the text file must be the first node and the second number will be the second node and so forth, the rest of the numbers will be placed accordingly b) Write a member method that will count and return negative numbers in the linked list c) In older personal computers, the largest integer is 32,767 and the largest long integer is 2,147,483,647. Some applications, such as cryptography and security algorithms, may require an unbounded integer. One way to store and manipulate integers of unlimited size is by using a linked list. Each digit is stored in a node of the list. Following figure shows how we could store a five-digit number in a list. Although the list in Figure is represented as moving from right to left, there is no physical direction in a list. (We represent it in this way to clarify the problem.) carry 0 carry 0carry1 carry0 h1 4 3 3 4 3 3 0 To add two numbers, we simply add the corresponding digit in the same location in their respective lists with the carry from the previous addition. Write a static method for adding two numbers (in the form of linked list) that will take two linked lists as input and returns new linked list which is the result of sum. LinkedList add(LinkedList 11, LinkedList 12) Show transcribed image text a) Write additional member method for Linked List class called buildFromTexFile(String filename), then the method creates a linked list by reading double values from a text file called filename Your program must create a linked list in a way that the first number in the text file must be the first node and the second number will be the second node and so forth, the rest of the numbers will be placed accordingly b) Write a member method that will count and return negative numbers in the linked list c) In older personal computers, the largest integer is 32,767 and the largest long integer is 2,147,483,647. Some applications, such as cryptography and security algorithms, may require an unbounded integer. One way to store and manipulate integers of unlimited size is by using a linked list. Each digit is stored in a node of the list. Following figure shows how we could store a five-digit number in a list. Although the list in Figure is represented as moving from right to left, there is no physical direction in a list. (We represent it in this way to clarify the problem.) carry 0 carry 0carry1 carry0 h1 4 3 3 4 3 3 0 To add two numbers, we simply add the corresponding digit in the same location in their respective lists with the carry from the previous addition. Write a static method for adding two numbers (in the form of linked list) that will take two linked lists as input and returns new linked list which is the result of sum. LinkedList add(LinkedList 11, LinkedList 12)

    Expert Answer


    . . .


    view full answer
  • QUESTION : (Solved) : Coded Following Line 26 Program Called Testjava Int 6 2 7 8 9 11 16 Line 26 Compile Get Fo Q30683814 . . .

    You coded the following on line 26 of a program calledTest.java:

    int a[6] = {2,7,8,9,11,16); //line26

    When you compile, you get thefollowing messages:

    Test.java:26: ‘]’ expected

        int a[6] ={2,7,8,9,11,16}; //line 26

                ^

    Test.java:26: illegal start ofexpression

          inta[6] = {2,7,8,9,11,16}; //line 26

                   ^

               Test.java:26: illegal start of expression

                    int a[6] = {2,7,8,9,11,16};//line 26

                                    ^

               Test.java:26: not a statement

                    int a[6] = {2,7,8,9,11,16}; //line 26

                                      ^

               Test.java: 26: “;” expected

                    int a[6] = {2,7,8,9,11,16}; //line 26

                                        ^

               Test.java: 26: class, interface, or enum expected

               }

               ^

               6 errors

    Identify the error and give the correct statement

    Expert Answer


    . . .


    view full answer
  • QUESTION : (Solved) : Code Written User Play Round Game Player S Reach 55 Got Work Roll Dice N Times However Ins Q31764463 . . .

    Below is the code which I have written for the user to play around in a game until any of the player(s) reach 55. I have got itwork and roll the dice n times. However, instead of displaying anew dice value in the next round, I want the new dice value to beadded to the dice value from previous round and then display thenew value in next round.

    using System;
    using System.Collections.Generic;
    using System.Linq;
    using System.Text;

    namespace Space_Race
    {
    class Program
    {
      
    public static void Main()
    {
    double players = 0.0;
    string[] numbers = new string[] { “One”, “Two”, “Three”, “Four”,”Five”, “Six” };
    int square;

    Console.Write(“Welcome to the Space Race.”);
    Console.Write(“nnThis game is for 2 to 6 players.”);
    Console.Write(“nHow many players (2-6): “);
    players = int.Parse(Console.ReadLine());

    Console.WriteLine(“nnPress Enter to play a round …”);
    Console.ReadLine();

    Console.WriteLine(“First Round”);
    Console.Write(“n”);
      
    bool gameFinish = false;
      

    while (!gameFinish)
    {   
    Random random = new Random();
    int dice_1, dice_2;
    int diceValue;

    square = 0;
    for (int i = 0; i < players; i++)
    {
    diceValue = 0;   
    dice_1 = random.Next(1, 7);
    dice_2 = random.Next(1, 7);
    diceValue = diceValue + dice_1 + dice_2;

    System.Console.WriteLine(numbers[i] + ” on square ” +diceValue);
      
    }
    diceValue = square;
    dice_1 = random.Next(1, 7);
    dice_2 = random.Next(1, 7);
    diceValue = diceValue + dice_1 + dice_2;

    Console.WriteLine(“Press Enter to play a round …”);
    Console.ReadLine();
    Console.WriteLine(“Next Round”);
      

    }

    }

    }
    }

    Expert Answer


    . . .


    view full answer
  • QUESTION : (Solved) : Coding C Additional Files Complexinputtxt 3 4i 5 6i Complexoutputtxt 39 2i Complexinputwro Q30868455 . . .

    Coding in C++

    Additional files are:-

    complexInput.txt   (3+4i) * (5-6i)

    complexOutput.txt 39+2i

    complexInputWrong.txt (3+4i) – dummy

    USE COMPLEXNUMBER.H, MAIN.CPP

    Use the declaration and implementation of complex number incomplex.h

    What you will learn . Implementing templates Improve grasp on file I/O Coding exercise This exercise extends Lab 2, so make sure you start this after you finish Lab 2 before starting this assignment 1. Create a new C++ project with the same complexNumber as lab 2 implemented as a template. Create a class called complexNumber that stores a complex number of the form a+bi. a is the real and b is the imaginary part of the number. The type of the numbers a and b should be generic. Implement the ability to add, subtract, and multiply two complexNumber objects to create another complexNumber object by overloading operators ,, and * a. b. c. Overload the operatorsand <<to input and output string of the form a+bi to/from the complexNumber object respectively. Read a complexNumber expression from a file called complexInput.txt (sample input file attached) containing numbers of the form as follows: a+bi 2. c+di Perform the operations on the numbers you read and store the result in a new complexNumber. Output the number in a new output file called complexOutput.txt (sample output file included) [Bonus-optional] Implement error checking on the input. A sample wrong input file called complexInputwrong.txt is attached. 3. 4. What to turn in A zip file containing the files стре 126-a1 . cpp, and complexNumber. h files. Include your declaration and implementation of the complexNumber class in complexNumber.h

    What you will learn . Implementing templates Improve grasp on file I/O Coding exercise This exercise extends Lab 2, so make sure you start this after you finish Lab 2 before starting this assignment 1. Create a new C++ project with the same complexNumber as lab 2 implemented as a template. Create a class called complexNumber that stores a complex number of the form a+bi. a is the real and b is the imaginary part of the number. The type of the numbers a and b should be generic. Implement the ability to add, subtract, and multiply two complexNumber objects to create another complexNumber object by overloading operators ,, and * a. b. c. Overload the operatorsand Show transcribed image text

    Expert Answer


    . . .


    view full answer