Please answer this homework related to Data Science and Big Data Analysis in APA format with References and Citations Computer Science Assignment Help

This will be a collection of four pieces that you may complete at any time during the semester. They are:

1) A formal game review targeted to an existing games journalism venue (a magazine or website). This should be written with journalistic standards. I expect you to list your potential venue with the submission, and I expect the submission to seem appropriate for that venue.

2) An informal, or personality-based, game review. This would be more like a personal blog, or a Vlog sort of response. This can be much more embedded in the culture of the scene surrounding the game in question, and unlike the formal game review, you can use slang and/or profanity here.

3) A news piece about a game event. This could be a game release, a competition, an expansion, something that happened in/to/with/because of a game.

4) An opinion piece about games as relates to culture (gender, race, social class, politics, globalism, etc.)

The specific length of each of these will depend on the audience and venue, but less than 500 words and more than 2000 are both bad ideas. So let’s say each one must be 500-2000 words.

How you’ll be graded:

If you want a D, (100 points)… all you have to do is create everything here. It can even be bad. It just has to exist.

If you want a C (115 points), you need to create everything here, and all of the pieces need to be written in such a way that they are not-repetitive and are readable.

To get up to a B (130 points), you need create everything here and at least one of the four pieces has to read as above-average quality, as on par with the sort of thing that would be considered for publication or that would draw readership online.

And for my achievement hunters, to get your 100% and kill the boss, you need do well enough with each of the pieces that I could believe they might be published somewhere.

Note: if you can get one of the four pieces published by someone (not your own blog or a friend’s blog, but by a website with some reputation online), and you have at least completed the other three, you will automatically get all 150 points.

Discussion Question 1- There are numerous reports describing the skills that project managers need to be successful. Briefly describe the project management skill that you believe is most important. Explain why you believe it is most important and whether and how it can be learned.

Your initial post comprising a minimum of 250 words should contain at least 2–3 credible/peer-reviewed references.

Discussion 2 – Web Portals

Web portals are now becoming the norm as they are mandated under the “Meaningful Use” criteria for involving the patients in their healthcare decision making. Discuss the benefits that a patient could derive from these web portals and how HIM professionals can benefit simultaneously?

Your initial post comprising a minimum of 250 words should contain at least 2–3 credible/peer-reviewed references.

Personal Essay Draft

Due Week 3 and worth 80 points

It takes practice to become an effective written communicator. In this course, you will practice writing effectively for different purposes.

Identify a topic from the list below. Each topic identifies an issue that you will investigate over the 11-week term. Throughout this course, you will discuss why you chose the topic research and then propose a way to address the issue. You will write a draft and revision for two types of essays.

Point of View: Use First Person POV, i.e. “I,” for the personal essay. Use Third Person POV, i.e. “he/she/they,” for the stance essay. Do not use the Second Person POV, “you.”

Topic list: Choose ONE topic to write about throughout the course.

1. Treating Animals Humanely
2. Finding Child Care
3. Working Remotely
4. Monitoring Toddlers and Technology
5. Examining Reality TV

THIS ESSAY SHOULD BE 2 FULL PAGES, DOUBLE-SPACED, CONTAIN NO
RESEARCH, AND BE IN FIRST PERSON POV.

CMSC 341 Homework 2

Instructions: In all cases where I ask for proof, I want drawings of examples, break down cases, and then examine each case through a picture. Only revert to equations once the picture makes sense.

1. Show that in an AVL tree, rotations fix insertion heights. Break it down into cases, draw trees and show that when their heights are imbalanced according to the AVL height rule, that a rotation will restore the height requirement at each level.

2. Show that the Red Black Tree insertion algorithm produces rebalanced trees. Remember that in a Red Black tree, the black-height of any given left subtree must be equal to the blackheight of the right subtree. Break it down into the following cases (which are the insertion cases for a RB-Tree):

(a) What if the uncle (the grandparent’s other child) is red? Then we have to recolor the parent and uncle black, and do not rotate.

(b) What if the uncle is black (or nullptr)? Then we have to ask: Do we zig? or Zig-Zag? i. If our node is just the left child of the left child, or right child of the right child of the grandparent, then zig (one rotation). ii. If our node is the left child of the right child or right child of the left child, then we need to zig-zag (two rotations).

3. Insert the following elements into an array which we will make into a min-heap in the ”canonical way.” Show where the element starts in the array, and then show (perhaps using arrows) which elements are swapped, and then rewrite the array to show what the state is after each insertion.

15, 3, 18, 19, 10, 2

4. Draw a leftist heap whose right subtree is of height is 5 but whose null path length is 1, and where the right subtree has more nodes than the left (stuff as many in there as you can). Give an example where the height of the left subtree is only 3.

• Count the root node in height (root is of height 1).

• The leftist heap does not need to be producable by the standard insertion algorithm for leftist heaps, it must simply follow the rule that the npl(current ⇒ lef t) ≥ npl(current ⇒ right) at each node.

• Calculate the NPL at each node and write it.

• Remember that a null pointer should be considered to have a npl of −1. This allows the algorithm to work.