Aiming high means???

How do you copy and paste a screenshot on an hd computer

ICE Princess25 [194]

Answer:

Ctrl shift s, i believe

6 0

3 years ago

Read 2 more answers

Which of the following correctly describes the reason for quality customer service?

Alexandra [31]

The correct answer is C. Keep existing customers and clients

Explanation:

Customer service refers to the interaction with customers and support employees in a company provide to customer to guarantee he or she has the best experience when buying one product or service. A high-quality customer service implies providing complete information to customers, and helping them before, during, and even after their process in buying or looking for information in a company. The main purpose of this is that customers feel the support from employees, and are loyal to the company which means they will go back if they need the same service or products. Thus, the reason for quality customer service is "Keep existing customers and clients".

3 0

3 years ago

Read 2 more answers

A user wants to make sure he can quickly restore his computer after a drive failure to the state it was in when Windows and all

disa [49]

Answer:

System image backup

Explanation:

A System Image Backup creates a backup image of your disk volume, including the Windows system files (C:\Windows), your system settings, programs, along with any personal files or documents stored on the disk volume. You can restore your computer from the backup image.

Therefore if a user wants to make sure he can quickly restore his computer after a drive failure to the state it was in when Windows and all its apps were initially installed, then she needs to have a system image backup

8 0

3 years ago

In C++ please (read the image below for instructions)

FromTheMoon [43]

Using the knowledge in computational language in C code it is possible to write a code that print the month name along with their rainfall inches. Then we have to calculate the total rainfall.

<h3>Writting the code:</h3>

#include <bits/stdc++.h>

using namespace std;

// function to print the rainfall of each month

void rainfallStatistics(string month[], double rainfall[]){

double sum = 0; // variable to store the total sum of rainfall

string maxMonth = month[0]; // variable to return month with maximum rainfall

double maxRainfall = INT_MIN; // variable to store the maximum rainfall

// running the loop till the last month

for(int i=0; i<12; i++){

// printing the month and rainfall

cout<< month[i] << " " << fixed << setprecision(2) << rainfall[i] << " inches" << endl;

// storing the sum

sum = sum + rainfall[i];

// checking the month with highest rainfall

if(rainfall[i] > maxRainfall){

maxRainfall = rainfall[i];

maxMonth = month[i];

}

// calculating the average of the rainfall

double average = sum / double(12);

cout << endl;

cout << "Total for the year " << sum << " inches" << endl;

cout << "Average rainfall per month " << average << " inches" << endl;

cout << "Month with the greatest rainfall was " << maxMonth << " with rainfall of " << maxRainfall << " inches" << endl;

}

// driver program

int main()

{

// array to store the nonth name

string month[12] = {"Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"};

// array to store the rainfall

double rainfall1[12] = { 4.50, 4.25, 3.26, 1.35, 0.80, 0.20, 0.10, 0.00, 0.40, 1.20, 2.96, 4.71 };

double rainfall2[12] = { 3.50, 1.25, 7.26, 8.35, 2.80, 0.00, 1.10, 4.00, 9.40, 2.20, 3.96, 4.71 };

cout << "Hayward Statistics" << endl;

cout << endl;

cout<< "Month" << " " << "Rainfall" << endl;

// calling the function for Hayward

rainfallStatistics(month, rainfall1);

cout << endl;

cout << "Houston Statistics" << endl;

cout << endl;

cout<< "Month" << " " << "Rainfall" << endl;

// calling the function for Houston

rainfallStatistics(month, rainfall2);

return 0;

}

See more about c code at brainly.com/question/19705654

#SPJ1

8 0

1 year ago

In your own words, describe the structure and function of both the stack and queue data structure and discuss how they are diffe

Kobotan [32]

Answer:

Following are the answer to this question:

Explanation:

Stack:

The stack data structure is used to create method, parsing, analysis of expression, and tracking. This data type uses the LIFO system, which stands from the Last In First Out. This data structure operates on the top side. In this data structure, it performs two methods, that are "push() and pop()" method and the time complexity of the stack data structure O(1).

Example of Stack:

import java.util.*;//import package

public class Main //defining class Main

{

public static void main (String[] ag)//defining main method

{

ArrayDeque<Character> stack = new ArrayDeque<Character>();//creating Character array ArrayDeque

stack.push('A'); //add value in stack

stack.push('B');//add value in stack

stack.push('B'); //add value in stack

System.out.println("First Insert:"+stack); //print value stack.pop();//remove value from stack

System.out.println("After removing element: "+stack); //print value stack.push('B'); //add value in stack

stack.pop();//remove value from stack

System.out.println("final value: "+stack); //print value

}

Output:

First Insert:[B, B, A]

After removing element: [B, A]

final value: [B, A]

Queue:

The queue data structure is an abstract type, it is similar to the stacks data structure. It is open at both ends when opposed to lines. It follows the FIFO method, which stands for the First-In-First-Out method, At one end data is inserted and at the other end, it deletes the data and the time complexity of the queue data structure O(1).

Example of Queue:

import java.util.*;//import package

public class Main//defining a class queue

{

public static void main(String[] ars)//defining main method

{

LinkedList<Integer> que= new LinkedList<Integer>();//defining integer array LinkedList

for (int i = 0; i < 5; i++)//defining fo loop to add value in queue

{

que.add(i); //use add method to insert value

}

System.out.println("Queue value: "+ que); //print queue value

int remove= que.remove(); //remove value from the queue System.out.println("after removing value from queue: "+ remove);//removing element from queue

System.out.println(que); //after removing the element print value

}

Output:

Queue value: [0, 1, 2, 3, 4]

after removing value from queue: 0

[1, 2, 3, 4]

6 0

3 years ago