1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Anna007 [38]
3 years ago
5

Write a function called PayLevel that returns a level given an Ssn as input. The level are: "Above Average" if the employee mak

es more than the average for their department "Average" if the employee makes the average for their department "Below Average" if the employee makes less than the average for their department
Computers and Technology
1 answer:
kotykmax [81]3 years ago
7 0

Answer:

Explanation:

Since no further information was provided I created the PayLevel function as requested. It takes the Ssn as input and checks it with a premade dictionary of Ssn numbers with their according salaries. Then it checks that salary against the average of all the salaries and prints out whether it is Above, Below, or Average. The output can be seen in the attached picture below.

employeeDict = {162564298: 40000, 131485785: 120000, 161524444: 65000, 333221845: 48000}

average = 68250

def PayLevel(Ssn):

   pay = employeeDict[Ssn]

   print("Employee " + str(Ssn) + " is:", end=" "),

   if pay > average:

       print("Above Average")

   elif pay < average:

       print("Below Average")

   else:

       print("Average")

PayLevel(161524444)

PayLevel(131485785)

You might be interested in
All ofthe following are correct EXCEPT one option when it comes towriting disappointing news letters. Identify theexception.
Nikolay [14]

Answer: d) Avoid a neutral or buffered opening

Explanation: A newsletter is a piece of a report that is having knowledge about the activities of the business ,organizations,their members and owner etc.When the news letter contains contains a disappointing news it should not not have a buffered or neutral opening .The start of the news letter should not be impartial or prejudiced to make bad opening. Therefore, option(d)is the correct option.

3 0
3 years ago
Question #2
Bezzdna [24]
Computational thinking inclines invokes the techniques of decomposition, latter reconstruction, abstraction & algorithms development
3 0
3 years ago
Read 2 more answers
1. The trucks hauling asphalt have a maximum capacity of 5 US tons (10,000 lbs) 2. The standard road lane is 12 feet wide. 3. As
ivolga24 [154]

Answer:

please write in a better way, and make it easy for us to read.

5 0
4 years ago
Write a program that takes paragraph from the user and prints all unique words in that paragraph using strings in c++
Bezzdna [24]

Answer:

void printUniquedWords(char filename[])

void printUniquedWords(char filename[]) {

void printUniquedWords(char filename[]) {     // Whatever your t.text file is

    fstream fs(filename);

    fstream fs(filename);   

    fstream fs(filename);       

    fstream fs(filename);           map<string, int> mp;

    fstream fs(filename);           map<string, int> mp;   

    fstream fs(filename);           map<string, int> mp;       // This serves to keep a record of the words

    string word;

    string word;     while (fs >> word)

    string word;     while (fs >> word)     {

    string word;     while (fs >> word)     {         // Verifies if this is the first time the word appears hence "unique word"

        if (!mp.count(word))

        if (!mp.count(word))             mp.insert(make_pair(word, 1));

        if (!mp.count(word))             mp.insert(make_pair(word, 1));         else

        if (!mp.count(word))             mp.insert(make_pair(word, 1));         else             mp[word]++;

        if (!mp.count(word))             mp.insert(make_pair(word, 1));         else             mp[word]++;     }

        if (!mp.count(word))             mp.insert(make_pair(word, 1));         else             mp[word]++;     }   

        if (!mp.count(word))             mp.insert(make_pair(word, 1));         else             mp[word]++;     }       fs.close();

        if (!mp.count(word))             mp.insert(make_pair(word, 1));         else             mp[word]++;     }       fs.close();   

        if (!mp.count(word))             mp.insert(make_pair(word, 1));         else             mp[word]++;     }       fs.close();       // Traverse map and print all words whose count

        if (!mp.count(word))             mp.insert(make_pair(word, 1));         else             mp[word]++;     }       fs.close();       // Traverse map and print all words whose count     //is 1

        if (!mp.count(word))             mp.insert(make_pair(word, 1));         else             mp[word]++;     }       fs.close();       // Traverse map and print all words whose count     //is 1     for (map<string, int> :: iterator p = mp.begin();

        if (!mp.count(word))             mp.insert(make_pair(word, 1));         else             mp[word]++;     }       fs.close();       // Traverse map and print all words whose count     //is 1     for (map<string, int> :: iterator p = mp.begin();          p != mp.end(); p++)

        if (!mp.count(word))             mp.insert(make_pair(word, 1));         else             mp[word]++;     }       fs.close();       // Traverse map and print all words whose count     //is 1     for (map<string, int> :: iterator p = mp.begin();          p != mp.end(); p++)     {

        if (!mp.count(word))             mp.insert(make_pair(word, 1));         else             mp[word]++;     }       fs.close();       // Traverse map and print all words whose count     //is 1     for (map<string, int> :: iterator p = mp.begin();          p != mp.end(); p++)     {         if (p->second == 1)

        if (!mp.count(word))             mp.insert(make_pair(word, 1));         else             mp[word]++;     }       fs.close();       // Traverse map and print all words whose count     //is 1     for (map<string, int> :: iterator p = mp.begin();          p != mp.end(); p++)     {         if (p->second == 1)             cout << p->first << endl;

        if (!mp.count(word))             mp.insert(make_pair(word, 1));         else             mp[word]++;     }       fs.close();       // Traverse map and print all words whose count     //is 1     for (map<string, int> :: iterator p = mp.begin();          p != mp.end(); p++)     {         if (p->second == 1)             cout << p->first << endl;     }

        if (!mp.count(word))             mp.insert(make_pair(word, 1));         else             mp[word]++;     }       fs.close();       // Traverse map and print all words whose count     //is 1     for (map<string, int> :: iterator p = mp.begin();          p != mp.end(); p++)     {         if (p->second == 1)             cout << p->first << endl;     } }

5 0
3 years ago
16235 to the nearest ten thousand
masha68 [24]
16235 to the nearest ten thousand would be 20,000.

Hope this helps :)
~ Davinia.
7 0
4 years ago
Read 2 more answers
Other questions:
  • What type of operating system runs a dedicated electronic device such as a smart thermostat?
    5·1 answer
  • We have a combinatorial logic function that can be decomposed into three steps each with the indicated delay with a resulting cl
    15·1 answer
  • Visual-verbal synergy has nothing to do with text, but solely with images used in a design.
    9·1 answer
  • Windows 8 has a built-in antivirus program called
    10·1 answer
  • What is an a free open source content management system for publishing web content​
    8·1 answer
  • Question #2
    8·2 answers
  • A penetration tester is experimenting with Network Mapper (Nmap) on a test network as a privileged user. The tester would like t
    11·1 answer
  • Different the policies and protocols in the industry
    13·1 answer
  • Online banking is a convenience that mostly affects which area of your life?
    15·1 answer
  • Write getfirstroot and getsecondroot to return the first and second roots. return a domain_error is there is no first or second
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!