C Programming Language

 To write a proposal, you need to attention to the following points: Generally, start with an overview or a background about the problem that you want to solve. But before writing a background, you need to understand the problem then try to find an answer or a solution for that. Background: Security issues in eCommerce are causing a lot of damage to businesses such as financial and their reputation. the attacks on e-commerce website are gowning gradually for more that 30% of the total e-commerce websites from small to large businesses. So, the first step would be:  Step-1: Finding a problem (what is the function of the writing the proposal)We need to have a problem then we can suggest various ways to answers it or suggest a method to resolve the issue. In this case, you need to answer, that means for example, we have a security problem on client-server architecture based on E-commerce structure, such as the security and privacy of online transactions, including

• Denial of Service, (DoS) 
• Unauthorized access,
• Malicious Alterations to websites,
• Theft of customer information, 
• Damage to computer networks,
• Creation of counterfeit sites. 

Step-2: Method and SolutionWe need to focus on the problem and find a solution or a way to answer to the problem, that means for example, my method is to design a secure client and server architecture, so we can create or use an exiting model then find a solution for the above problems and how to minimize the vulnerability of this structure. That means to find a solution for each part of the problem.for example, in terms of DoS, the attackers stop authorized users from accessing a website, resulting in reduced functioning of the website.How the attackers doing DoS, or what’s the type of DoS attacks? the DoS attacks are based on Network, Protocol, Storage, Processor,…. We can consider using a password management, password encryption techniques, using multi-factor authentication, using security questions, creating a uniquid accessing for each device.In case of secure network, all we want to stop or to access or make a requests to a service. then, we need to think about each DoS simulation and the method (for example in the network layer) that we want to work on it. Step-3: Result and Analysis and outcome expectationAt this stage, we want to know , and ? So I expect to see your proposal that can present a problem and be able to write the answer to above questions and above steps in any format. You can write or make a flowchart and/or demonstrate step-by-step work actions, also creating a job duties for each member (optional). 

Part 1: Write the proposal

Part 2: Write the code for the above proposal

Part 3: Execution 

CHAPTER 10: MEDIANS AND ORDER STATISTICS

The ith order statistic of a set of n elements is the ith smallest element. For example, the minimum of a set of elements is the first order statistic (i = 1), and the maximum is the nth order statistic (i = n). A median, informally, is the “halfway point” of the set. When n is odd, the median is unique, occurring at i = (n + 1)/2. When n is even, there are two medians, occurring at i = n/2 and i = n/2 + 1. Thus, regardless of the parity of n, medians occur at i = (n + 1)/2 and i = (n + 1)/2.

This chapter addresses the problem of selecting the ith order statistic from a set of n distinct numbers. We assume for convenience that the set contains distinct numbers, although virtually everything that we do extends to the situation in which a set contains repeated values. The selection problem can be specified formally as follows:

Input: A set A of n (distinct) numbers and a number i, with 1 i n.

Output: The element x A that is larger than exactly i -1 other elements of A.

The selection problem can be solved in O(n lg n) time, since we can sort the numbers using heapsort or merge sort and then simply index the ith element in the output array. There are faster algorithms, however.

In Section 10.1, we examine the problem of selecting the minimum and maximum of a set of elements. More interesting is the general selection problem, which is investigated in the subsequent two sections. Section 10.2 analyzes a practical algorithm that achieves an O(n) bound on the running time in the average case. Section 10.3 contains an algorithm of more theoretical interest that achieves the O(n) running time in the worst case.

10.1 Minimum and maximum

How many comparisons are necessary to determine the minimum of a set of n elements? We can easily obtain an upper bound of n – 1 comparisons: examine each element of the set in turn and keep track of the smallest element seen so far. In the following procedure, we assume that the set resides in array A, where length[A] = n.

MINIMUM (A)

1  min  A[1]

2  for i  2 to length[A]

3        do if min > A[i]

4              then min  A[i]

5  return min

Finding the maximum can, of course, be accomplished with n – 1 comparisons as well.

Is this the best we can do? Yes, since we can obtain a lower bound of n – 1 comparisons for the problem of determining the minimum. Think of any algorithm that determines the minimum as a tournament among the elements. Each comparison is a match in the tournament in which the smaller of the two elements wins. The key observation is that every element except the winner must lose at least one match. Hence, n – 1 comparisons are necessary to determine the minimum, and the algorithm MINIMUM is optimal with respect to the number of comparisons performed.

An interesting fine point of the analysis is the determination of the expected number of times that line 4 is executed. Problem 6-2 asks you to show that this expectation is (lg n).

Simultaneous minimum and maximum

In some applications, we must find both the minimum and the maximum of a set of n elements. For example, a graphics program may need to scale a set of (x, y) data to fit onto a rectangular display screen or other graphical output device. To do so, the program must first determine the minimum and maximum of each coordinate.

It is not too difficult to devise an algorithm that can find both the minimum and the maximum of n elements using the asymptotically optimal (n) number of comparisons. Simply find the minimum and maximum independently, using n – 1 comparisons for each, for a total of 2n – 2 comparisons.

In fact, only 3n/2 comparisons are necessary to find both the minimum and the maximum. To do this, we maintain the minimum and maximum elements seen thus far. Rather than processing each element of the input by comparing it against the current minimum and maximum, however, at a cost of two comparisons per element, we process elements in pairs. We compare pairs of elements from the input first with each other, and then compare the smaller to the current minimum and the larger to the current maximum, at a cost of three comparisons for every two elements.

Exercises

10.1-1

Show that the second smallest of n elements can be found with n+ lg n – 2 comparisons in the worst case. (Hint: Also find the smallest element.)

10.1-2

Show that 3n/2 – 2 comparisons are necessary in the worst case to find both the maximum and minimum of n numbers. (Hint: Consider how many numbers are potentially either the maximum or minimum, and investigate how a comparison affects these counts.)

10.2 Selection in expected linear time

The general selection problem appears more difficult than the simple problem of finding a minimum, yet, surprisingly, the asymptotic running time for both problems is the same: (n). In this section, we present a divide-and-conquer algorithm for the selection problem. The algorithm RANDOMIZED-SELECT is modeled after the quicksort algorithm of Chapter 8. As in quicksort, the idea is to partition the input array recursively. But unlike quicksort, which recursively processes both sides of the partition, RANDOMIZED-SELECT only works on one side of the partition. This difference shows up in the analysis: whereas quicksort has an expected running time of (n lg n), the expected time of RANDOMIZED-SELECT is (n).

RANDOMIZED-SELECT uses the procedure RANDOMIZED-PARTITION introduced in Section 8.3. Thus, like RANDOMIZED-QUICKSORT, it is a randomized algorithm, since its behavior is determined in part by the output of a random-number generator. The following code for RANDOMIZED-SELECT returns the ith smallest element of the array A[p . . r].

RANDOMIZED-SELECT(A, p, r, i)

1  if p = r

2      then return A[p]

3  q  RANDOMIZED-PARTITION(A, p, r)

4  k  q - p + 1

5  if i  k

6      then return RANDOMIZED-SELECT(A, p, q, i)

7      else return RANDOMIZED-SELECT(A, q + 1, r, i - k)

After RANDOMIZED-PARTITION is executed in line 3 of the algorithm, the array A[p .. r] is partitioned into two nonempty subarrays A[p .. q] and A[q + 1 .. r] such that each element of A[p .. q] is less than each element of A[q + 1 .. r]. Line 4 of the algorithm computes the number k of elements in the subarray A[p .. q]. The algorithm now determines in which of the two subarrays A[p .. q] and A[q + 1 .. r] the ith smallest element lies. If i k, then the desired element lies on the low side of the partition, and it is recursively selected from the subarray in line 6. If i > k, however, then the desired element lies on the high side of the partition. Since we already know k values that are smaller than the ith smallest element of A[p .. r]–namely, the elements of A[p .. q]–the desired element is the (i – k)th smallest element of A[q + 1 .. r], which is found recursively in line 7.

The worst-case running time for RANDOMIZED-SELECT is (n2), even to find the minimum, because we could be extremely unlucky and always partition around the largest remaining element. The algorithm works well in the average case, though, and because it is randomized, no particular input elicits the worst-case behavior.

We can obtain an upper bound T(n) on the expected time required by RANDOMIZED-SELECT on an input array of n elements as follows. We observed in Section 8.4 that the algorithm RANDOMIZED-PARTITION produces a partition whose low side has 1 element with probability 2/n and i elements with probability 1/n for i = 2, 3, . . . , n – 1. Assuming that T(n) is monotonically increasing, in the worst case RANDOMIZED-SELECT is always unlucky in that the ith element is determined to be on the larger side of the partition. Thus, we get the recurrence

The second line follows from the first since max(1, n – 1 ) = n – 1 and

If n is odd, each term T(n/2), T(n/2 + 1), . . . ,T(n – 1) appears twice in the summation, and if n is even, each term T(n/2 + 1), T(n/2 + 2), . . . , T(n – 1) appears twice and the term T(n/2) appears once. In either case, the summation of the first line is bounded from above by the summation of the second line. The third line follows from the second since in the worst case T(n – 1) = O(n2), and thus the term can be absorbed by the term O(n).

We solve the recurrence by substitution. Assume that T(n) cn for some constant c that satisfies the initial conditions of the recurrence. Using this inductive hypothesis, we have

since we can pick c large enough so that c(n/4 + 1/2) dominates the O(n) term.

Thus, any order statistic, and in particular the median, can be determined on average in linear time.

Exercises

10.2-1

Write an iterative version of RANDOMIZED-SELECT.

10.2-2

Suppose we use RANDOMIZED-SELECT to select the minimum element of the array A = 3, 2, 9, 0, 7, 5, 4, 8, 6, 1. Describe a sequence of partitions that results in a worst-case performance of RANDOMIZED-SELECT.

10.2-3

Recall that in the presence of equal elements, the RANDOMIZED-PARTITION procedure partitions the subarray A[p . . r] into two nonempty subarrays A[p . . q] and A[q + 1 . . r] such that each element in A[p . . q] is less than or equal to every element in A[q + 1 . . r]. If equal elements are present, does the RANDOMIZED-SELECTprocedure work correctly?

10.3 Selection in worst-case linear time

We now examine a selection algorithm whose running time is O(n) in the worst case. Like RANDOMIZED-SELECT, the algorithm SELECT finds the desired element by recursively partitioning the input array. The idea behind the algorithm, however, is to guarantee a good split when the array is partitioned. SELECT uses the deterministic partitioning algorithm PARTITION from quicksort (see Section 8.1), modified to take the element to partition around as an input parameter.

Figure 10.1 Analysis of the algorithm SELECT. The n elements are represented by small circles, and each group occupies a column. The medians of the groups are whitened, and the median-of-medians x is labeled. Arrows are drawn from larger elements to smaller, from which it can be seen that 3 out of every group of 5 elements to the right of x are greater than x, and 3 out of every group of 5 elements to the left of x are less than x. The elements greater than x are shown on a shaded background.

The SELECT algorithm determines the ith smallest of an input array of n elements by executing the following steps.

1. Divide the n elements of the input array into n/5 groups of 5 elements each and at most one group made up of the remaining n mod 5 elements.

2. Find the median of each of the n/5 groups by insertion sorting the elements of each group (of which there are 5 at most) and taking its middle element. (If the group has an even number of elements, take the larger of the two medians.)

3. Use SELECT recursively to find the median x of the n/5 medians found in step 2.

4. Partition the input array around the median-of-medians x using a modified version of PARTITION. Let k be the number of elements on the low side of the partition, so that n – k is the number of elements on the high side.

5. use SELECT recursively to find the ith smallest element on the low side if i k, or the (i – k)th smallest element on the high side if i > k.

To analyze the running time of SELECT, we first determine a lower bound on the number of elements that are greater than the partitioning element x. Figure 10.1 is helpful in visualizing this bookkeeping. At least half of the medians found in step 2 are greater than or equal to the median-of-medians x. Thus, at least half of the n/5 groups contribute 3 elements that are greater than x, except for the one group that has fewer than 5 elements if 5 does not divide n exactly, and the one group containing x itself. Discounting these two groups, it follows that the number of elements greater than x is at least

Similarly, the number of elements that are less than x is at least 3n/10 – 6. Thus, in the worst case, SELECT is called recursively on at most 7n/10 + 6 elements in step 5.

We can now develop a recurrence for the worst-case running time T(n) of the algorithm SELECT. Steps 1, 2, and 4 take O(n) time. (Step 2 consists of O(n) calls of insertion sort on sets of size O(1).) Step 3 takes time T(n/5), and step 5 takes time at most T(7n / 10 + 6), assuming that T is monotonically increasing. Note that 7n / 10 + 6 < n for n > 20 and that any input of 80 or fewer elements requires O(1) time. We can therefore obtain the recurrence

We show that the running time is linear by substitution. Assume that T(n) cn for some constant c and all n 80. Substituting this inductive hypothesis into the right-hand side of the recurrence yields

T(n)  c n/5 + c(7n/10 + 6) + O(n)

 cn/5 + c + 7cn/10 + 6c + O(n)

 9cn/10 + 7c + O(n)

 cn,

since we can pick c large enough so that c(n / 10 – 7) is larger than the function described by the O(n) term for all n > 80. The worst-case running time of SELECT is therefore linear.

As in a comparison sort (see Section 9.1), SELECT and RANDOMIZED-SELECT determine information about the relative order of elements only by comparing elements. Thus, the linear-time behavior is not a result of assumptions about the input, as was the case for the sorting algorithms in Chapter 9. Sorting requires (n 1g n) time in the comparison model, even on average (see Problem 9-1), and thus the method of sorting and indexing presented in the introduction to this chapter is asymptotically inefficient.

The work for this lesson is required to be 2000-3000-words and clearly demonstrate your understanding of the prompt. Works should be 5 or more paragraphs with a clear introduction, thesis statement and conclusion, written in APA format. You must include one source from the lesson materials and one scholarly source from Cline Library’s extensive online holdings. Blog posts and websites without authors are not permitted for this work. (https://owl.english.purdue.edu/owl/). Once completed, submit your work to the Work Dropbox. You may select from one of the following prompts:

• Discuss the intersection of technology and privacy concerns in this custom writing. Have technological innovations outpaced privacy protections? For instance, you could address privacy relative to a specific social media outlet or cluster of media outlets, data privacy, digital assistants and microphone security, the proliferation of drones, search engines and tracking, etc. Your work should have a clear thesis statement, i.e., a debatable position for which you must offer support, and the body of your work should consist of a compelling argument and evidence supporting your claims.

• How does social media shape personal identity? In what sense might its role in identity development be considered problematic, and are there senses in which it might be liberating or promote personal growth? Your work should have a clear thesis statement, i.e., a debatable position for which you must offer support, and the body of your work should consist of a compelling argument and evidence supporting your claims.

• How have emerging communication technologies (e.g., smart phones and their texting and video chat features) influenced the way we relate to one another? In what ways do they foster improved human connection and in what ways do they isolate? Your work should have a clear thesis statement, i.e., a debatable position for which you must offer support, and the body of your work should consist of a compelling argument and evidence supporting your claims.

• Discuss an element of an emerging technology relative to globalization (e.g., how does China’s social credit system, censorship of search engines, or widespread use of facial recognition technology, etc.) influence the way privacy is understood or influence norms globally? What ethical dilemmas are afoot relative to the technology you have selected? Do cultural conflicts emerge? Your work should have a clear thesis statement, i.e., a debatable position for which you must offer support, and the body of your work should consist of a compelling argument and evidence supporting your claims.

Assignment Summary

For this assignment, you will use a graphic organizer to monitor and analyze multiple global news outlets across a period of time. Once you have completed your organizer, you will answer key questions about the media’s coverage of a story and how this coverage changed and developed over time.

Background Information

In today’s world, global media outlets such as websites, newsworks, and magazines give their readers up-to-the-minute coverage of breaking news and events from across the globe. 

In the 24-hour news cycle, stories are constantly unfolding with the addition of new information and perspectives. As situations develop, reporters work to keep their audience informed, and readers synthesize new information with what they already know about a news event.

Materials

• Graphic organizer

• Access to three global media outlets

• Follow-up questionnaire 

Assignment Instructions

For this assignment, you are expected to submit two things:

1. A completed graphic organizer 

2. A completed follow-up questionnaire https://smashingessays.com/tag/political-science-assignment-help/ 

Step 1: Prepare for the assignment.

a) Read through the guide before you begin so you know the expectations for this assignment. 

b) If anything is not clear to you, ask your teacher for assistance. 

Step 2: Select three global media outlets.

a) Choose media outlets that provide daily coverage. Monthly periodicals and journals are not a good choice for this assignment, but many weekly news magazines also have websites that provide more frequent reporting. 

• Some workples of reliable global news outlets include the New York Times, the Wall Street Journal, the BBC, the Associated Press, and Reuters. Discuss your sources with your teacher if you have questions.

b) If you do not have daily access to the internet, discuss alternatives with your teacher. 

Step 3: Begin monitoring coverage of one or two news events.

a) Use your graphic organizer to keep track of a news story as it unfolds across a period of time. Choose a story that is likely to have continuous coverage. For workple, a breaking news item will probably have follow-up stories over the next week, while an in-depth profile of a writer or artist will probably not be updated. 

b) Consider how the story evolves depending on the handling of new events, information, and perspectives in news articles. Consider how media outlets report the effects of the news story, and note how the sources present opinions on the story in the form of editorials and op-ed pieces. 

c) In addition to the notes you take in your graphic organizer, keep track of the titles, authors, and URLs of articles you read as the story develops.

Step 4: After a week, review your graphic organizer to analyze the evolution of the news story

a) Consider what trends and patterns you noticed, and what factors most influenced the coverage of the story. 

b) Using complete sentences, answer the questions on your follow-up questionnaire.

Step 5: Evaluate your assignment using this checklist.

If you can check each box below, you are ready to submit your assignment.

Yes No Evaluation Question

Is your name on your graphic organizer and questionnaire?

Did your organizer trace the development of one or more news stories across a period of time?

Did you monitor the coverage from at least three different sources?

Are your sources likely to be considered fair and reliable by a majority of people?

Are your sources likely to provide corrections and updates in the event of misreporting?

Are your sources unbiased?

Did you keep track of how the news story developed over time?

Did you note new and relevant information as it was reported?

Did you use complete sentences in your follow-up questionnaire?

Step 6: Revise and submit your presentation.

a) If you were unable to check off all of the requirements on the checklist, go back and make sure that your assignment is complete. Save your assignment before submitting it.

b) Turn in your graphic organizer and questionnaire to your teacher. Be sure that your name is on them.

c) Submit your graphic organizer and questionnaire through the Virtual Classroom.

d) Congratulations! You have completed your assignment. 

Part One: Complete the graphic organizer.

Use the graphic organizer to monitor the development of a news story as it is presented by three different media outlets over a period of time.

Media Outlet #1:

_______________ Media Outlet #2:

_______________ Media Outlet #3:

_______________

Day 1

Part Two: Complete the follow-up questionnaire in this online assignment help.

Use complete sentences to respond to each prompt.

1. Review your graphic organizer. What was the most important piece of information in the story, and on which day was this information first reported? Which media outlet covered this development first? 

2. Review your graphic organizer. What were the similarities and differences in how the media outlets reported the story? Which outlet provided the most information?

3. Which media outlet offered opinionated coverage in the form of editorials or op-eds? Were different opinions presented across the media outlets? Did you detect bias in how the news was reported?

4. How would you describe the development of this news story to someone who has not been following it as closely as you? How would you summarize the most important factual information? How would you convey the variety of opinions related to the news story?

Ethical Frameworks Work

Table 2.1 in Butts (below). Apply this model to a challenging situation in your nursing career that required you to consider the ethical dimensions of the patient case and the role you played in providing care. Specifically apply and address the questions within each topic area as they pertain to your situation.

In your conclusion, discuss the impact of the Four Topics process. Did applying these principles shape your decision making in any way? Does this seem like a valid process for you to apply in your practice? 

Your work should be 1-2 pages. Adhere to APA formatting throughout, and cite any outside sources you may use.

Review the rubric for further information on how your assignment will be graded.

TABLE 2-1 Four Topics Method for Analysis of Clinical Ethics Cases

Medical Indications: The Principles of Beneficence and Nonmaleficence

1. What is the patient’s medical problem? Is the problem acute? Chronic? Critical? Reversible? Emergent? Terminal?

2. What are the goals of treatment?

3. In what circumstances are medical treatments not indicated?

4. What are the probabilities of success of various treatment options?

5. In sum, how can this patient be benefited by medical and nursing care, and how can harm be avoided?

Patient Preferences: The Principle of Respect for Autonomy

1. Has the patient been informed of benefits and risks, understood this information, and given consent?

2. Is the patient mentally capable and legally competent, and is there evidence of incapacity?

3. If mentally capable, what preferences about treatment is the patient stating?

4. If incapacitated, has the patient expressed prior preferences?

5. Who is the appropriate surrogate to make decisions for the incapacitated patient?

6. Is the patient unwilling or unable to cooperate with medical treatment? If so, why?

Quality of Life: The Principles of Beneficence and Nonmaleficence and Respect for Autonomy

https://onlinecustomessaywriting.com/tag/writing-assignment-help/ 

1. What are the prospects, with or without treatment, for a return to normal life, and what physical, mental, and social deficits might the patient experience even if treatment succeeds?

2. On what grounds can anyone judge that some quality of life would be undesirable for a patient who cannot make or express such a judgment?

3. Are there biases that might prejudice the provider’s evaluation of the patient’s quality of life?

4. What ethical issues arise concerning improving or enhancing a patient’s quality of life?

5. Do quality-of-life assessments raise any questions regarding changes in treatment plans, such as forgoing life-sustaining treatment?

6. What are plans and rationale to forgo life-sustaining treatment?

7. What is the legal and ethical status of suicide? https://onlinecustomessaywriting.com/services/ 

Contextual Features: The Principles of Justice and Fairness

1. Are there professional, interprofessional, or business interests that might create conflicts of interest in the clinical treatment of patients?

2. Are there parties other than clinicians and patients, such as family members, who have an interest in clinical decisions?

3. What are the limits imposed on patient confidentiality by the legitimate interests of third parties?

4. Are there financial factors that create conflicts of interest in clinical decisions?

5. Are there problems of allocation of scarce health resources that might affect clinical decisions?

6. Are there religious issues that might influence clinical decisions?

7. What are the legal issues that might affect clinical decisions?

8. Are there considerations of clinical research and education that might affect clinical decisions history writer?

9. Are there issues of public health and safety that affect clinical decisions?

10. Are there conflicts of interest within institutions and organizations (e.g., hospitals) that may affect clinical decisions and patient welfare?

Any one can help in solving 

Note the top five decisions that leadership will have to make with the implementation of the new product

Company: Healthcare Insurance

Download The Attachment and Message Me Please for Detailed Instructions

 Directions: Open the attached document, answer all questions and double check your answers. After you feel comfortable with your answers, go to the content folder and click on HW-2_Relations to post your answers on blackboard. Make sure to submit your answers before the due date, you also need to allow yourself enough time (60 to 90 minutes) to submit your answers. When you start you must complete answering all questions. Questions and answers will be in the forms of True/False, Multiple Choice, and Matchings. This will allow you to compare the answers you have with the different options on blackboard. Notice questions on blackboard may not have matching numbers with the following questions. Some of the following questions could be broken into multiple questions.  

please answer all the question listed in the pdf file.

Define Garbage collection – in Computer Programming. Discuss the advantages and pitfalls of “Garbage collection.” 

Your first post must be between 300 and 400 words.

Chosen Topic = Ransomware 

The final paper will be a 1,250- to 1,500-word research paper discussing your chosen topic. It is expected that all sources be credible, with a minimum of five peer-reviewed articles. The final paper must include the following:

1. Abstract: Provide an overview of what the final paper is about. The abstract should be approximately 120 words in length; in-text citations should be excluded in this section.

1. The final paper should include the information required in Section 1: Topic Selection, Problem Statement, and Metrics; Section 2: Analysis; and Section 3: Possible Feasible Solution, with evidence of improvement based on feedback from the instructor.

1. In addition to the solution and the process to get there, explain what is needed to implement the solution. In particular, what resources will be needed, including materials, technology, and people (who is needed on the team to implement and what roles will they play). Explain clearly how they will work together. 

NOTE: Please use the attachment to complete the work and make sure each question is a heading