A networked scanner is a type of

// This pseudocode is intended to display // employee net pay values. All employees have a standard // $45 deduction from their

Vikki [24]

Answer:

C++ code is given below

Explanation:

#include<iostream>

#include <cstring>

using namespace std;

int housekeeping(string EOFNAME);

int mainLoop(string name,string EOFNAME);

int finish();

void main()

{

string name;

string EOFNAME = "ZZZZ";

cout << "enter the name" << endl;

cin >> name;

if (name != EOFNAME)

{

housekeeping(EOFNAME);

}

if (name != EOFNAME)

{

mainLoop(name , EOFNAME);

}

if (name != EOFNAME)

{

finish();

}

system("pause");

}

int housekeeping(string EOFNAME)

{

cout << "enter first name " << EOFNAME << " to quit " << endl;

return 0;

}

int mainLoop(string name, string EOFNAME)

{

int hours;

int rate,gross;

int DEDUCTION = 45;

int net;

cout << "enter hours worked for " << name << endl;

cin >> hours;

cout << "enter hourly rate for " << name << endl;

cin >> rate;

gross = hours*rate;

net = gross - DEDUCTION;

if (net > 0)

{

cout << "net pay for " << name << " is " << net << endl;

}

else

{

cout << "dedections not covered.net is 0.";

}

cout << "enter next name or " << EOFNAME << " to quit" << endl;

cin >> name;

return 0;

}

int finish()

{

cout << "end of job"<<endl;

return 0;

}

3 0

2 years ago

If you're found to be at fault in _____, your driver license will be canceled within 90 days unless you complete a 12-hour Advan

Viktor [21]

Answer:

D. three crashes within three years.

Explanation:

Rules differ from Country to Country. In United States Of America, the traffic rules are so strict and the process of License is followed strictly and people who are violating rules gets a penalty or punishment in such a way that it changes their mindset to follow the traffic rules strictly.

All these are done to safe guard people, avoid injuries and sudden loss of death due to accidents.

So if a driver has done three crashes within 36 months of time, then the driver license is likely to get cancelled within 90 days.

In order to avoid this it is necessary for the driver to appear for improvement course of driving and appear for the test once again.

5 0

2 years ago

Read 2 more answers

Most injury crashes in Florida happen in __________ conditions.

ivolga24 [154]

Answer:

Most injury crashes in Florida happen in dusk conditions

Explanation:

Dusk is the time of the day when the sun is setting. At this time of the day, the visibility on the roads is less. This time of the day, the number of cars on the roads is also significantly greater. This indirectly means that the possibility of most injury crashes in Florida in dusk conditions considerably increases.

The amount of tourism happening in the state is also a condition that takes part in injury crashes due to increased traffic on the roads.

7 0

2 years ago

Create a class Student and another called StudentClub. StudentClub should have the fields President, Vice-President, Secretary,

salantis [7]

Answer:

See explaination

Explanation:

StudentClub.h

#ifndef STUDENTCLUB_H_INCLUDED

#define STUDENTCLUB_H_INCLUDED

//#include <vector>

//class student

class Student

{

public:

std::string name;

Student(){}

Student(std::string name)

{

this->name=name;

}

};

//studentclub class

class StudentClub

{

Student* President=new Student();

Student* VicePresident=new Student();

Student* Secretary=new Student();

Student* Treasurer=new Student();

std::vector<Student> clubMember;

public:

StudentClub(Student* p, Student* v, Student* s, Student* t, std::vector<Student> m);

Student* get_president() const;

Student* get_vice_president() const;

Student* get_secretary() const;

Student* get_treasurer() const;

std::vector<Student> get_members() const;

void add_member(Student* s);

int number_members();

};

#endif // STUDENTCLUB_H_INCLUDED

StudentClub.cpp

#include <iostream>

#include <vector>

#include "StudentClub.h"

using namespace std;

//constructor with parameter

StudentClub::StudentClub(Student* p, Student* v, Student* s, Student* t, vector<Student> m)

{

President =p;

VicePresident=v;

this->Secretary =s;

this->Treasurer =t;

this->clubMember=m;

}

//return president

Student* StudentClub::get_president() const

{

return this->President;

}

//return vice president

Student* StudentClub::get_vice_president() const

{

return this->VicePresident;

}

//return secretary

Student* StudentClub::get_secretary() const

{

return this->Secretary;

}

//return treasurer

Student* StudentClub::get_treasurer() const

{

return this->Treasurer;

}

//return memeber

vector<Student> StudentClub::get_members() const

{

return clubMember;

}

//add member

void StudentClub::add_member(Student* s)

{

for(int i = 0; i < clubMember.size(); i++)

{

if(clubMember[i].name == s->name)

return ;

}

this->clubMember.push_back(*s);

}

//return memeber count

int StudentClub::number_members()

{

return clubMember.size();

}

main.cpp

#include <iostream>

#include <vector>

#include "StudentClub.h"

using namespace std;

int main()

{

//declarations

Student p,s,v,t,m;

//get names

cout<<"President: ";

cin>>p.name;

cout<<"VicePresident: ";

cin>>v.name;

cout<<"Secretary: ";

cin>>s.name;

cout<<"Treasurer: ";

cin>>t.name;

vector<Student> cl;

//get members

do{

cout<<"\nNew member (Q to quit): ";

cin>>m.name;

if(m.name!="Q")

cl.push_back(m);

}while(m.name!="Q");

//add to club

StudentClub club(&p,&v,&s,&t,cl);

club.add_member(&p);

club.add_member(&v);

club.add_member(&s);

club.add_member(&t);

//print details

cout<<"\n\nPresident: "<<club.get_president()->name;

cout<<"\nVicePresident: "<<club.get_vice_president()->name;

cout<<"\nSecretary: "<<club.get_secretary()->name;

cout<<"\nTreasurer: "<<club.get_treasurer()->name;

cout<<"\nTotal Members: "<<club.number_members();

return 0;

}

3 0

2 years ago

Given a sorted array of integer, A, with possible duplicate elements. Implement an efficient (sublinear running time complexity)

allsm [11]

Answer:

The java program is as follows.

import java.util.*;

import java.lang.*;

public class SearchProgram

{

// sorted array may or may not containing duplicate elements

static int A[] = {-1, 2, 3, 5, 6, 6, 6, 9, 10};

// variable to keep track of number of occurrences, declared and initialized to 0

static int times=0;

// variable to hold value to be searched in the array

static int key;

static int search(int[] art, int n)

{

// enhanced for loop used to find how many times n occurs in array, arr

for(int j:arr)

{

if(n == j)

times = times+1;

}

return times;

}

public static void main(String[] args)

{

// scanner object to allow user input

Scanner sc = new Scanner(System.in);

// user prompted to enter key to be searched

System.out.print("Enter the element to be searched: ");

key = sc.nextInt();

// message displayed to the user on how many times the element is present in the array

System.out.println("The element " + key + " is present " + search(A, key) + " times in the array.");

}

OUTPUT

Enter the element to be searched: 3

The element 3 is present 1 times in the array.

Explanation:

The steps of program execution are shown below.

1. An integer array, A, is declared and initialized.

2. An integer variable, times, is declared and initialized to 0.

3. A method, search(), is created which takes 2 parameters, array A and user entered value for the element to be searched in A.

4. The search() method has return type of integer and returns the value of variable, times.

5. Inside the search() method, an enhanced for loop is used to compute the value of the variable, times.

6. In the main() method, user is prompted to enter the value of key.

7. The search() is called and value of the variable, times, displayed to the user.

8. All the methods and variables are declared as static.

7 0

2 years ago