The introduction should conclude with a paragraph that describes the sequence of the literature you will include and the literature analysis process. After the introduction, you should incorporate possible headings/subheadings that you plan to cover and include at least 20 scholarly references.

# Tag: Computer Science

## write C code

SPECIFICATIONS:

Write the code for a C class called “Stacker” which stores an array of

up to 100 integers (class prototyped below).

class Stacker {

int items[100], displayIndex, currentIndex;

public:

Stacker( );

Stacker(const int *list, int n);

int operator (int); // postfix operator

int addInteger(int p);

void setIndex(int si);

void show( );

};

A Stacker has the following publicly accessible characteristics:

1. When created without any data, a Stacker object sets all elements in its array to -1

and it’s displayindex and currentIndex are both set to 0 (2 marks).

2. A Stacker may also be created by accepting a constant array of integers ‘list’ to copy from

and an integer ‘n’ that indicates the total number of elements in the

array that is passed in as a parameter. All elements in the ‘list’ array (up to 100)

and no more than ‘n’ are copied into the Stacker’s array. If fewer than 100 elements are

copied, then the remaining elements in the Stacker’s array are set to -1.

The displayIndex is set to 0 and the currentIndex is set to ‘n’ but ONLY if ‘n’ is <= 100,

otherwise currentIndex is set to 100.

(4 marks).

3. The operator function increases EVERY element in the Stacker array that is not equal

to -1 by 1 and returns the sum of all changed elements (4 marks).

4. The addInteger function accepts an integer ‘p’ to ADD to the end of the Stacker’s array,

but only if the array is NOT already full.

If the integer can be added, the function increases currentIndex by 1 and returns 1,

otherwise the integer is not added, currentIndex is not changed, and the function

returns 0 (3 marks).

5. The setIndex function accepts an integer ‘si’ and updates the Stacker’s displayIndex

member, but only if ‘si’ is within the range 0 to currentIndex inclusive or -2.

If this function sets displayIndex to -2, this means that your show( ) will

display the integers in the array in reverse order (starting from the last integer

added to the aray) (3 marks).

6. The show function displays all integers (each separated by a space) in the Stacker

array that are not -1 starting at index ‘displayIndex’. The output MUST use the

C output style using cout and after all integers are displayed a newline is output.

If displayIndex is -2, then this function displays the integers in the array

in reverse order (starting from the last integer added to the array)

(4 marks).

MAIN PROGRAM:

The following main( ) program would produce the output below.

#include

using namespace std;

#define N 12

#define OVER 200

int main( ) {

int nums[N] = { 2, 5, 8, 11, 14, 17, 20, 23, 26, 29, 32, 35 };

int i, overflow[OVER], sum, rv;

for(i = 0; i < OVER; i ) {

overflow[i] = i * 2; // sets array values to 0, 2, 4, 6, 8, … 396, 398

}

Stacker x, y(nums, N), z(overflow, OVER); // z should only contain 100 values

x.addInteger(16);

x.addInteger(-8);

x.addInteger(451);

sum = x ; // increases all 3 values by 1 and returns sum

cout << "x Stacker: ";

x.show( );

cout << "Stacker x sum: " << sum << endl;

x.setIndex(-2);

cout << "x Stacker: ";

x.show( );

cout << "Stacker x sum: " << sum << endl;

y.setIndex(3);

sum = y ;

y.addInteger(39);

cout << "y Stacker: ";

y.show( );

cout << "Stacker y sum: " << sum << endl;

rv = z.addInteger(400); // should not be added (Stacker array is already full)

z.setIndex(401); // should not change displayIndex (value 401 is out of bounds)

z.setIndex(90); // changes displayIndex to 90

cout << "rv is: " << rv << endl;

cout << "z Stacker: ";

z.show( );

return 0;

}

The OUTPUT should be EXACTLY as displayed below:

x Stacker: 17 -7 452

Stacker x sum: 462

x Stacker: 452 -7 17

Stacker x sum: 462

y Stacker: 12 15 18 21 24 27 30 33 36 39

Stacker y sum: 234

rv is: 0

z Stacker: 180 182 184 186 188 190 192 194 196 198

## The correct solution is in the attached file. The solution is required to be reformulated in your own words

The correct solution is in the attached file. The solution is required to be reformulated in your own words so that plagiarism is zero

No plagiarism, no match please

You must give 100/100 correct answers’

Attached is a correct model solution for my friend who got the full score

Copying is strictly prohibited

Writing APA References

## topic 2 – 660 DQ 1

Please answer the following DQs with 200-300 words each. thank you

DQ 1:

What is the importance of understanding the minimal data set needed to achieve the purpose of the report? How do health care organizations determine if reporting needs to be static or ad hoc? What are the challenges if data does not exist in an extractable format?

DQ 2:

Describe the requirements for a reporting tool that would facilitate the tracking of a merit-based incentive payment system (MIPS) quality performance in an emergency department environment (e.g., clinical dashboard). In your responses to peers, discuss at a high level how MIPS quality measure performance is determined for one or more quality measures that may be used by an emergency department.

## Visualization

Review the attached file. Suzie has an issue. She can either move to NY or FL and needs to review some data that her agent gave her. The agent reviewed house prices and crime ratings for houses that Suzie would be interested in based on her selection criteria. She wants to live in an area with lower crime but wants to know a few things:Is it more expensive or less expensive to live in FL or NY?

Is the crime rate higher in FL or NY (Note a low score in crime means lower crime)?

Is the crime rate higher in lower or higher house price areas?

Using the R tool, show the data in the tool to answer each of the questions. Also, show the data visualization to go along with the summary.If you were Suzie, where would you move based on the questions above?

After you gave Suzie the answer above (to #4), she gave you some additional information that you need to consider:She has $100,000 to put down for the house.

If she moves to NY she will have a job earning $120,000 per year.

If she moves to FL she will have a job earning $75,000 per year.

She wants to know the following:On average what location will she be able to pay off her house first based on average housing prices and income she will receive?

Where should she move and why? Please show graphics and thoroughly explain your answer here based on the new information provided above.

Note: The screenshots should be copied and pasted and must be legible. Only upload the word document. Be sure to answer all of the questions above and number the answers. Be sure to also explain the rational for each answer and also ensure that there are visuals for each question above. Use two peer reviewed articles to support your position.

## Design and Analysis of Algorithms

Let 𝑋[1: 𝑛] be an array of real numbers, and 𝑙 a fixed positive integer ≤ 𝑛. An 𝑙-subarray of 𝑋 is

any sequence of 𝑙 consecutive elements of the array 𝑋. The trough of an 𝑙-subarray is the

minimum value in that 𝑙-subarray. Give a divide-and-conquer algorithm that takes as input an

array 𝑋[1: 𝑛] and a positive integer 𝑙 ≤ 𝑛, and returns the starting position of the 𝑙-subarray that

has the largest trough. Analyze the time complexity of your algorithm in terms of 𝑛 and 𝑙. (Your

algorithm should split the input into two halves)

2. In a given undirected graph G, an independent set of G is any subset S of nodes in G such

that there are no edges between the nodes of S. The independent set problem is the problem

of finding a maximum-size independent set in an input undirected graph G. Give a greedy

algorithm for this problem, and prove by a counter example that the Greedy solution is not

always optimal.

3. In a given undirected graph G, a vertex cover of G is any subset C of nodes in G such that

every edge in G involves at least one node in C. The vertex cover problem is the problem of

finding a minimum-size vertex cover in an input undirected graph G. Give a greedy

algorithm for this problem, and prove that the Greedy solution is not always optimal

## TCP/IP Discussion Board Question.

There are various discussions, and research being conducted to come up with an alternative to TCP/IP. In the Main Module Section of your class schedule, ModullesPublished Articles, Witepapers, and Scholarly Articles, you will find an article “Why is TCP/IP on the way out?”

The instructions are as follows: Read Opinion Article — Why is TCP/IP on the way out?

After reading the above referenced article, each student must Identify 4 published articles on if TCP/IP should be replaced and why and cite them in the thread you are to write.

After you have read the four articles which you have cited, generate a thread on replacing TCP/IP based on the articles you have read.

You must first generate a thread before you can respond to your classmates thread.

You are to respond to three (3) classmates threads each, in order to receive a grade.

You cannot cite the article referenced for you to read in these instructions or use the same cite more than once (No Duplicate Cites) in responding to classmates threads.The article is below.

## Translate a Scholarly Article in Computer Science

Please see attached for the instructions, I would like a blog post created in word or powerpoint, which ever is easiest, no need to go decorate since I will only need the text and images. From there I will use the information gathered to implement it into a html website I created myself. The article must be scholarly.

## week 7 discussion post, no format

Week 7 Discussion: Wireless Wide Area Networks

Topic 1: Title/SubjectWireless WAN is a wide area network in which separate areas of coverage or cells that are connected wirelessly to provide service to a large geographic area. Describe in more detail what WWANs are, how they are configured and how the work.

You will:Describe wireless wide area networks (WWANs) and how they are used.

Explain how cellular telephony functions.

## Wireless communication research report in LaTeX

research report topic: Wireless communication

1. the report must have a minimum length of 1000 Words,

2. the report must be in the pdf format compiled in LaTeX typesetting software. Also the original files are needed. Other formats (e.g.

pdf compiled by MS Word) are not accepted,

3. If the data used in statistical consideration is adopted from another paper

you must clearly state the source of the data

4. if the format is research proposal (or similar) the report must contain anticipated timeline (in the format of

gantt chart) and budget (in the tabular format) of the project,

5. report must contain Abstract and References (or Bibliography) sections

6. all adopted images and adopted data in the report must have clearly stated source, must have caption and

must be cross-referenced in the main text.