Assignment Task

 

# Problem 1

Use dplyr functions to query for a list of artists in descending order by popularity in the database (e.g., the artist with the most tracks at the top)
 
Start by filting for rows that have an artist listed (use `is.na()`), then group rows by the artist and count them. Finally, `arrange` the results.

Use pipes to do this all as one statement without collecting the data into memory!
 
Remember you may need to create references to the tables using `tbl()

 

# Problem 2

Use dplyr functions to query for the most popular _genre_ in the library. You will need to count the number of occurrences of each genre, and join the two tables together in order to also access the genre name.
 
 Collect the resulting data into memory in order to access the specific row of interest

 

# Bonus: 

Query for a list of the most popular artist for each genre in the library (a "representative" artist for each).

Consider using multiple grouping operations. Note that you can only filter for a `max()` value if you've collected the data into memory. (and you can pipe to collect!)

 

 

This Computer Science Assignment has been solved by our Computer Science experts at UniLearnO. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.
Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.

Eureka! You've stumped our genius minds (for now)! This exciting new question has our experts buzzing with curiosity. We can't wait to craft a fresh solution just for you!

  • Uploaded By : William
  • Posted on : April 01st, 2019

Whatsapp Tap to ChatGet instant assistance