Part 3 You are part of a team responsible for running a successful video streaming service with millions of views daily. For marketing and research reasons, you have been asked to implement an algorithm that efficiently finds the k most viewed videos daily. You should expect k<

Part 3 You are part of a team responsible for running a successful video streaming service with millions of views daily. For marketing and research reasons, you have been asked to implement an algorithm that efficiently finds the k most viewed videos daily. You should expect k<

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

USE PYTHON. USE GREEDY ALGORITHM STRATEGY. PLEASE DO NOT GIVE THE SOLUTION ALREADY POSTED ON BARTLEBY OR ANY OTHER WEBSITES LIKE BARTLEBY. Suppose, you have N number of assignments with their time intervals- i.e. starting and ending times. As you are a student, you need to find out how you can finish the maximum number of assignments. Now, Implement a greedy algorithm to find the maximum number of assignments that can be completed by you.The following conditions must be met when writing the code: A student can only work on a single assignment at a time. The input will contain N assignments, and then N lines with the starting time and ending time in the format given below: N S₁ E₁ S₂ E₂ ……. Sn En You have to read input from a file. The output will contain the maximum number of assignments that can be completed followed by the intervals of the selected assignment. Sample input and output is given below. Name your input file “task1_input.txt”. Make sure to try out different input…
Problem Alice was given a number line containing every positive integer, x, where 1<=x<=n. She was also given m line segments, each having a left endpoint, l (1<=l<=n), a right endpoint, r (1<=r<=n), and an integer weight, w. Her task is to cover all numbers on the given number line using a subset of the line segments, such that the maximum weight among all the line segments in the chosen subset is minimal. In other words, let S=(l1,r1,w1),(l2,r2,w2),....,(lk,rk,wk), represent a set of k line segments chosen by Alice, max(w1,w2,...,wk) should be minimized. All numbers 1,2,....n should be covered by at least one of k the chosen line segments. It is okay for the chosen line segments to overlap. You program should output the minimized maximum weight in the chosen subset that covers all the numbers on the number line, or -1 if it is not possible to cover the number line. Input format The first line of the input contains an integer, n - denoting the range of numbers…
Practicing Comparing Growth Rates Exercise Current score: O out of 3 You are given this set of growth functions: n!, 2", 2n2, 5n log n, 20n, 10n For the growth function 10n, type a value (a positive integer) for which this function is the most efficient of the six. If there is no integer value for which it is most efficent, type "none".
Algorithm A and B have a worst case running time of 0 and O(log n), respectively. Therefore, algorithm B always run faster than algorithm A. Select one: O True O False
We can specify the PageRank algorithm's convergence threshold using proc networks. This figure has to be positive. Default value is 1E-9. When the difference between the PageRank scores of the current iteration and the previous iteration is less than or equal to the tolerance set, the PageRank algorithm ceases iterating. We can use the PAGERANKTOLERANCE= parameter to specify the convergence tolerance. Write The example code demonstrates how to calculate PageRank centrality using a proc network built on a directed graph with unweighted links.
ALGORITHM Algorithm: BINSEARCH(DATA, ITEM) Set BEG = 0, END = N-1 and MID = INT((BEG + END) / 2) Repeat steps 3 and 4 while BEG <= END AND DATA[MID] != ITEM If ITEM < DATA[MID], then Set END = MID – 1, Else Set BEG = MID + 1 MID = INT((BEG + END) / 2) If DATA[MID] = ITEM, then Set LOC = MID Else Set LOC = NULL Exit Q: Run above algrithm in c++
Using pyhton coding to solve: Suppose the Great Frederick Fair wants to update its ticketing software. They need you to write a program to handle the price calculations, using the rules*: ● The basic price of a ticket is $40. Senior citizens (age >= 65) get a 50% discount. Children under 6 are free (100% discount). For residents of Frederick County, the basic price is $35; the same discounts still apply. So the individual ticket prices range from $0 to $40. ● . Your program should request age and county name from the user. The age will be entered as an integer and the county name as a string. Before calculating the price, confirm that the user's age is valid - not negative and not more than 110. If it is not, give a message and do not do the price calculation. Also, the county name should not be case sensitive - for example, Frederick, frederick, and FREDERICK should all be acceptable. Your program should then calculate and print out the ticket price, using the appropriate…
You are going on holiday. There are n cities in the world. There are also m airlines, the ith of which operates flights in both directions between cities ai and bi. You live in city 1, and you would like to travel to city n and back. You don’t mind stopovers in other cities, but you don’t want to have more than one stopover in any city.Design an algorithm which runs in time polynomial in n and m and determines whether it is possible to travel from city 1 to city n and back to city 1 without going through any other city more than once.
Given a program designed to calculate rocket trajectories, the algorithm has an O(2n) complexity and takes 1 second for each iteration, and n = 15. How many hours will it take to calculate the trajectories, worst case?
Conserving water saves energy. In many regions water gets collected between the valleys which is used for various purposes by the villagers. Help villagers to estimate how much water can be possibly collected. Given N non-negative integers representing an elevation of valleys where the width of each valley is 1, compute total units of water it can hold after raining. 3 2 • Height = [0,1,0,2,1,0,1,3,2,1,2,1] • Output: 6 • Explanation: The above elevation map (black section) is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. Input Format First line of input contains N, the number of valleys. Second line of input contains N integers denoting heights of the valley. Constraints • n == = height.length • 1 <= n <= 2 * 104 • 0 <= height[i] <= 105 Output Format Print a single line containing one positive integer, denoting the maximum amount of water that can be stored. Sample Input 0 12 0 1 0 2 1 0 1 3 2 1 2 1
Suppose N people are in a line. Everyone's height obeys the same distribution. And are independent of each other. Assume that no two people have the same height. For any two people in the team. If the person in front is taller than the person behind. Then define this pair of people as an occlusion pair. 1) Find the expectation of the total number of occlusion pairs in the team. 2) Design an algorithm with the lowest possible complexity. Calculate how many different permutations of the queue of N people can form exactly K pairs of occlusion pairs. Give pseudo code and analyze the time/space complexity of the algorithm.
There is a single pile of n chips. Two players take turns by removing from the pile at least one and at most m chips: the number of chips taken may vary from one move to another, but both the lower and upper limits stay the same. The winner is the last player who takes the last chip. „Which algorithm design strategy is used in this game? Decrease-by-a-constant factor algorithm Divide-and-Conquer Variable-size-decrease algorithm Decrease-by-a-constant algorithm