The number of goals achieved by two football teams in matches In a league Is given in the form of two lists. For each match of team B, compute the total number of matches of team A where team A has scored less than or equal to the number of goals scored by team B In that match. Example teamA = [1, 2, 3] teamB = [2, 4] %3D Team A has played three matches and has scored teamA = [1, 2, 3] goals in each match respectively. Team B has played two matches and has scored teamB = [2, 4] goals in each match respectively. For 2 goals scored by team B in its first match, team A has 2 matches with scores 1 and 2. For 4 goals scored by team B in its second match, team A has 3 matches with scores 1, 2 and 3. Hence, the answer is [2, 3]. Function Description Complete the function counts in the editor below. counts has the following parameter(s): int teamA[n]: first array of positive integers int teamB[m]: second array of positive Integers Return int[m]: an array of m positive integers, one for each teamB[i] representing the total number of elements from teamA[j] satisfylng teamA[j] s teamB[i] where 0 s j < nand 0si< m, in the given order. Constraints 2sn, m s 105 1 s teamA[j] s 10°, where 0 sj

The number of goals achieved by two football teams in matches In a league Is given in the form of two lists. For each match of team B, compute the total number of matches of team A where team A has scored less than or equal to the number of goals scored by team B In that match. Example teamA = [1, 2, 3] teamB = [2, 4] %3D Team A has played three matches and has scored teamA = [1, 2, 3] goals in each match respectively. Team B has played two matches and has scored teamB = [2, 4] goals in each match respectively. For 2 goals scored by team B in its first match, team A has 2 matches with scores 1 and 2. For 4 goals scored by team B in its second match, team A has 3 matches with scores 1, 2 and 3. Hence, the answer is [2, 3]. Function Description Complete the function counts in the editor below. counts has the following parameter(s): int teamA[n]: first array of positive integers int teamB[m]: second array of positive Integers Return int[m]: an array of m positive integers, one for each teamB[i] representing the total number of elements from teamA[j] satisfylng teamA[j] s teamB[i] where 0 s j < nand 0si< m, in the given order. Constraints 2sn, m s 105 1 s teamA[j] s 10°, where 0 sj

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

C PROGRAMMING Phase 1 Each person eligible to win is placed in one of G groups. For each group, a process is used to narrow down the possible number of winners. The process is as follows:Let a group initially start with p people. We can number the people within a group from 1 to p and assume they are arranged in a circle(circular linked list), with 1, then 2, ..., then p, followed by 1. Each group has its own skip number, s, and its own threshold number, t, where t< p. To eliminate some people in a group from possibility of winning the lottery, start at the person labeled 1 and skip over speople in line. Then, remove the following person. (Thus the first person removed is always person number s+1.)Then repeat the process. Since the line is circular, once you pass the highest numbered person left in line, you'll continue to the lowest numbered person left in line. Continue eliminating people in this fashion until there are precisely t people left. Phase 2 Of all of the people…
Python problem Problem statementDevelop a program that receives a matrix and determines whether it corresponds to a magic square. A magic square is one that the sum of its elements in each of the rows is equal to the sum of the elements in each of the columns and also equal to the sum of the elements of each of the diagonals. The condition that the numbers from 1 to n ** 2 are used must also be met, where n is the size of the magic square, which is a matrix of nxn. https://upload.wikimedia.org/wikipedia/commons/thumb/e/e4/Magicsquareexample.svg/1200px-Magicsquareexample.svg.png EntryThe first line corresponds to the number n. After this, n lines, each line contains a list of integers separated by a space. DepartureIf the square is magic, it must print the value that has the sum of the numbers by columns, rows and main diagonals. If it is not a magic square, the word "Error" must be printed without quotation marks. Examples Input Example 1 416 3 2 135 10 11 89 6 7 124 15 14 1Output…
Python only* Use recursive function*. Define colorListCircles with 2 parameters Use def to define colorListCircles with 2 parameters The colorListCircles function must draw concentric circles using colors from a list. It has two parameters: the first specifies the radius of the largest circle, and the second is a list of colors. The number of concentric circles drawn is the length of the list, and these circles are colored, from largest to smallest, by the colors in the list from first to last. When viewed as nested rings, all rings should have the same thickness. If the list is empty, nothing should be drawn. We will test both how many circles are drawn as well as whether the correct circles are drawn in the correct order, you may not use any loops and you must use recursion. Also, you will still need to use drawDot. For full credit, your function should call drawDot in only one place, and should only contain one recursive call. Do not use any kind of loop Within the definition…
In c programming without pointer and function Problem Statement A matrix is a 2D array of numbers arranged in rows and columns. We give you a Matrix of N rows and M columns. Now your task is to do this operation on this matrix: If the value matches with the current row and column number then add 3 with the value. If the value matches with only the current row number then add 2 with the value. If the value matches with only the current column number then add 1 with the value. Input Format The first line contains N is the number of rows in this matrix and M is the number of columns in this matrix The second line contains a 2D array Arr[i][j]. Constraints 1 <= N, M <= 10 0 <= Arr[i][j] <= 100 Output Format Print the matrix after the operation is done. Sample Input 0 3 31 1 11 1 11 1 1 Sample Output 0 4 3 3 2 1 1 2 1 1
Python only* Use recursive function*. Define colorListCircles with 2 parameters Use def to define colorListCircles with 2 parameters The colorListCircles function must draw concentric circles using colors from a list. It has two parameters: the first specifies the radius of the largest circle, and the second is a list of colors. The number of concentric circles drawn is the length of the list, and these circles are colored, from largest to smallest, by the colors in the list from first to last. When viewed as nested rings, all rings should have the same thickness. If the list is empty, nothing should be drawn. We will test both how many circles are drawn as well as whether the correct circles are drawn in the correct order, you may not use any loops and you must use recursion. Also, you will still need to use drawDot. For full credit, your function should call drawDot in only one place, and should only contain one recursive call. Do not use any kind of loop Within the definition…
Weighted Job Scheduling in C language Problem statement: You are given a list of jobs where each job has a start time, finish time, and the profit associated with that job, find the maximum profit subset of non-overlapping jobs. Problem description: The problem wants you to find the maximum profit that you can make after performing a certain number of jobs such that each job has a certain condition that you can start a job only if the start time of the current job is greater than the finish time of the previous job. You are required to develop some algorithm such that the job start time and the finish time does not coincide with other jobs.
Function Growth i Organize the following functions into six columns. Items in the same column should have the same asymptotic growth rates (big-O). If a column is to the left of another column, all its growth rates should be slower than those of the column to its right. n2, n!, log, n, n log, n, 3n, 5n² + 3, 2", 10000, n log3 n, 100n, 3logzn ii Using the definition of big-O, show 100n + 5 = 0(n). Give a particular e and no. iii Using the definition of big-O, show that n = O(2"). Give a particular e and no. iv Identify a function f(n) which has 3n + 4n? + 3n! n = 0(n!) and n² = O(n!). O(f (n)). You may use the facts that
Exercise # 2: Map search For the location map search example explained in the Greedy best first search and A* algorithm, change the search algorithm to follow the uniform cost algorithm (UCS). Run the new code and compare the results of UCS versus Greedy & A*, in terms of the levels required and the number of nodes expanded. IT HAS TO BE IN PYTHON LANGUAGE
Query Board Python or Java(Preferred Python please) Thank you! Programming challenge description: There is a board (matrix). Every cell of the board contains one integer, which is 0 initially.The following operations can be applied to the Query Board:SetRow i x: change all values in the cells on row "i" to value "x".SetCol j x: change all values in the cells on column "j" to value "x".QueryRow i: output the sum of values on row "i".QueryCol j: output the sum of values on column "j".The board's dimensions are 256x256."i" and "j" are integers from 0 to 255."x" is an integer from 0 to 31. Input: Your program should read lines from standard input. Each line contains one of the above operations. Output: For each query, output the result of the query. Test 1 Test InputDownload Test 1 Input SetCol 32 20 SetRow 15 7 SetRow 16 31 QueryCol 32 SetCol 2 14 QueryRow 10 Expected OutputDownload Test 1 Input 5118 34
Please code in C Pascal’s Triangle Version 2 The Pascal triangle can be used to compute the coefficients of the terms in the expansion (a + b)n. For example, (a + b)2 = a2 + 2ab + b2 where 1, 2, and 1 are coefficients. Write a C program that creates a two-dimensional matrix a representing the Pascal triangle of size n. For example, a Pascal triangle of size 10 is shown below:
Bus Loading Problem. You are in charge of filling busses with passengers at a bus terminal. Each bus has space for ten (10) passengers. Four (4) of those spaces can hold only wheelchair passengers, and the other six (6) can hold only non-wheelchair passengers. Busses and both types of passengers arrive at random. As busses arrive, you are to fill them up with passengers. Once a bus is full (containing 6 non-wheelchair, and 4 wheelchair passengers), it is allowed to leave the terminal, along with its passengers. You are responsible only for loading the passengers on the bus and having the bus depart. You do not need to worry about what happens to the busses or passengers after they leave. Each bus process has available to it the functions ArriveAtTerminal(), OpenDoors(), CloseDoors(), and DepartTerminal(). Each passenger process has available to it the functions ArriveAtTerminal() and GetOnBus(). Executing GetOnBus() loads the passenger on the bus, and the function returns when the…
Python problem Problem StatementDevelop a function that receives an array and returns a tuple with its dimensions. EntryMultiple lines, each line contains a list of numbers separated by a space and this line corresponds to a row in the matrix. At the end of the array, the character "*". DepartureThe dimensions of the matrix in a tuple, (m, n) where m are the rows and n the columns. If it is not a valid array, the word "Error" must be printed without quotes. Examples of Input example 1 8 4 3 2 6 9 7 14 4 1 2 5 6 1 31 1 2 2 3 4 5 60 3 4 6 0 2 4 8*Output example 1 (4, 8) Input example 2 1 6 8 9 5 4 1 2 5 4 8 25 3 5 6 9 8 2 9 6 3 4 66 2 4 8 6 9 1 0 3 61 2 3 4 5 6 7 8 9 1 1 2*Output example 2 Error