Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Characters (name, type): assume characters have distinctive names name type Bob A Jon Emma B Appearances (name, season, num) name season num Bob Ivia Bob
Characters (name, type): assume characters have distinctive names name type Bob A Jon Emma B Appearances (name, season, num) name season num Bob Ivia Bob Jon Episodes(season, num, title, viewers) Jon 2 season numtitle viewers Emma 1 Emma 1 Emma 2 Winter2.5 M King 2.5 M Notes 4.0 M Lands3.2 M 2 2 2 Bob 2 2 Olivia 2 Problem 2: [30 pt] Elementary SQL: write SQL queries using previous tables a)[5 pt] Find good episodes: find the episodes that have more than 3.0M viewers. Sort by viewers in descending order, then by season in ascending order, and finally by number in ascending order. Format of each output row: (season, number, title, viewers) b)[5 pt] Find lucky characters: List names (remove duplicate) who appear in some episode with viewers>-3.0M. Format of each output row: (name). c)[5 pt] Find the number of unique characters for each episode. Format of each output row: (season, num, number_characters). d)[5 pt] Find the number of unique characters for each episode, such that there are at least two unique characters in that episode. Format of each output row: (season, num, number_characters) e)[5 pt] For each episode, find the number of unique characters whose type is A. Format of each output row: (season, num, number_characters) f) [5pt] Find seasons (remove duplicate) in which Type A characters have NEVER appeared. Format of each output row: (season)
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started