04. C++ Programming Problem:You are given n sets S₁, S2,..., Sn.For each ?, you want to choose ; E Sį, such that the variance of the multiset{x1,x2,..., n} is minimized.The variance of a multiset {x₁,x2,..., n} is defined asΣ 1(; – μ)202where is the mean, which equalsnSay the minimum possible variance is R. Print n² x R. It can be proved that n² Ris always an integer.Input:233712511Output:i=1 in4

Code in CPP: #include <bits/stdc++.h> using namespace std; #pragma optimize("-O3") #define…

C++ Programming Problem: You are given n sets S₁, S2,..., Sn. For each i, you want to choose i E Sį, such that the variance of the multiset {x1,x2,...,n} is minimized. The variance of a multiset {₁, 2,...,n} is defined as Σ 1(x; – μ)2 - 0² where is the mean, which equals n Say the minimum possible variance is R. Print n² x R. It can be proved that n² R is always an integer. Input: 2 3371 2511 Output: n 4

C++ Programming Problem: You are given n sets S₁, S2,..., Sn. For each i, you want to choose i E Sį, such that the variance of the multiset {x1,x2,...,n} is minimized. The variance of a multiset {₁, 2,...,n} is defined as Σ 1(x; – μ)2 - 0² where is the mean, which equals n Say the minimum possible variance is R. Print n² x R. It can be proved that n² R is always an integer. Input: 2 3371 2511 Output: n 4

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

Given A = {1,2,3} and B={u,v}, determine. a. A X B b. B X B
Python Programming Lab: You are given N sets of integers A1,A2,…,AN. For each valid i, let's denote the elements of the set Ai by {ci,1,ci,2,…,ci,|Ai|}. Find the number of ways to choose a sequence (a1,a2,…,aN) such that: ai∈Ai for each valid I ai≠ai+1 for each valid i and a1≠aN. Since this number may be large, compute it modulo 998,244,353. Write a python code to print a single line containing one integer the number of ways to choose (a1,a2,…,aN) Input Case: 3 3 1 2 3 2 1 2 2 2 3 Output: 3
d) for (k0; k=0; t = t-1) printf("B"); for-t: TC1iter) = Change of var: Σ/repetitions, Closed form: for-k: TC1iter) =. Change of var: Σ/repetitions Closed form: dependent / independent of loop variable dependent / independent of loop variable e(
Ql: The Collatz conjecture function is defined for a positive integer m as follows. (COO1) g(m) = 3m+1 if m is odd = m/2 if m is even =1 if m=1 The repeated application of the Collatz conjecture function, as follows: g(n), g(g(n)), g(g(g(n))), ... e.g. If m=17, the sequence is 1. g(17) = 52 2. g(52) = 26 3. g(26) = 13 4. g(13) = 40 5. g(40) = 20 6. g(20) = 10 7. g(10) = 5 8. g(5) = 16 9. g(16) = 8 10. g(8) = 4 11. g(4) = 2 12. g(2) = 1 Thus if m=17, apply the function 12 times in order to reach m=1. Use Recursive Function.
This problem is taken from the delightful book "Problems for Mathematicians, Young and Old" by Paul R. Halmos. Suppose that 931 tennis players want to play an elimination tournament. That means: they pair up, at random, for each round; if the number of players before the round begins is odd, one of them, chosen at random, sits out that round. The winners of each round, and the odd one who sat it out (if there was an odd one), play in the next round, till, finally, there is only one winner, the champion. What is the total number of matches to be played altogether, in all the rounds of the tournament? Your answer: Hint: This is much simpler than you think. When you see the answer you will say "of course".
1. A set of integers are relatively prime to each other if there is no integer greater than 1 that divides all the elements. Furthermore, in Number Theory, it is known that the Euler function,ϕ (n), expresses the number of positive integers less than n that are relatively prime with n. Choose the alternative that has the correct value of ϕ(n) for every n below. A) ϕ(5) = 4 B) ϕ(6) = 2 C) ϕ(10) = 3 D) ϕ(14) = 6 E) ϕ(17) = 16
Your checkWinner function should determine whether or not the game is over. If the game is over, it should print who won (if anyone), and return true. If the game is not over, it should return false. The game is over if someone wins by getting three X's or three O's in a row, column or diagonal. So there are 8 different combinations of 3-in-a-row moves. You may assume that the board has a size of 3 (length and width). The TicTacBoard.java file I'm giving you uses a variable for that size, but you can assume it's always 3. The game is also over if the board is full but nobody won. I recommend you write some other functions to help in determining if the game is over. Remember you should never copy and paste code if you can avoid it. Write a function to perform a common, generalizable task, and call that function every time you need it. (Like I did with my dispRow method.) Please follow the standard conventions for indentation, meaningful variable names, etc. like the examples in class…
Your checkWinner function should determine whether or not the game is over. If the game is over, it should print who won (if anyone), and return true. If the game is not over, it should return false. The game is over if someone wins by getting three X's or three O's in a row, column or diagonal. So there are 8 different combinations of 3-in-a-row moves. You may assume that the board has a size of 3 (length and width). The TicTacBoard.java file I'm giving you uses a variable for that size, but you can assume it's always 3. The game is also over if the board is full but nobody won. I recommend you write some other functions to help in determining if the game is over. Remember you should never copy and paste code if you can avoid it. Write a function to perform a common, generalizable task, and call that function every time you need it. (Like I did with my dispRow method.) Please follow the standard conventions for indentation, meaningful variable names, etc. like the examples in class…
Dingyu is playing a game defined on an n X n board. Each cell (i, j) of the board (1 2, he may only go to (2, n).) The reward he earns for a move from cell C to cell D is |value of cell C – value of cell D|. The game ends when he reaches (n, n). The total reward - is the sum of the rewards for each move he makes. For example, if n = 1 2 and A = 3 the answer is 4 since he can visit (1, 1) → (1, 2) → (2, 2), and no other solution will get a higher reward. A. Write a recurrence relation to express the maximum possible reward Dingyu can achieve in traveling from cell (1, 1) to cell (n, n). Be sure to include any necessary base cases. B. State the asymptotic (big-O) running time, as a function of n, of a bottom-up dynamic programming algorithm based on your answer from the previous part. Briefly justify your answer. (You do not need to write down the algorithm itself.)
Correct answer will be upvoted else downvoted. Computer science. Positive integer x is called divisor of positive integer y, in case y is distinguishable by x without remaining portion. For instance, 1 is a divisor of 7 and 3 isn't divisor of 8. We gave you an integer d and requested that you track down the littlest positive integer a, to such an extent that a has no less than 4 divisors; contrast between any two divisors of an is essentially d. Input The primary line contains a solitary integer t (1≤t≤3000) — the number of experiments. The primary line of each experiment contains a solitary integer d (1≤d≤10000). Output For each experiment print one integer a — the response for this experiment.
Write a Python function mat_to_prob (R) that returns the matrix P = (P₁, P2, ..., Pm) where Pi is the i-th row of matrix P, and Pi is the probability vector obtained from R; using the formulation in Question 1. In other words, convert each row of the input matrix into a probability vector. Sample inputs and outputs: • Input: np.array([[4, 6], [3.5, 9.1]]) Output: ● [[0.11920292 0.88079708] [0.00368424 0.99631576]] Input: np.array([[2, 3.1, 5], [10, 3.7, 12], [4, 5.5, 0]])) Output: [[4.15115123e-02 1.24707475e-01 8.33781013e-01] [1.19176835e-01 2.18844992e-04 8.80604320e-01] [1.81818026e-01 8.14851861e-01 3.33011331e-03]] Hint: use numpy.sum with an appropriate axis and keepdims settings. You should also check broadcasting in numpy. [ ] # Write your function here Let's test your function. [ ] # Convert input from 2-d list to np.array first before calling your function print (mat_to_prob(np.array([[4, 6], [3.5, 9.1]]))) print (mat_to_prob (np.array([[2, 3.1, 5], [10, 3.7, 12], [4, 5.5,…
Write a Python function mat_to_prob (R) that returns the matrix P = (P₁, P2, ..., Pm) where Pi is the i-th row of matrix P , and Pi is the probability vector obtained from R; using the formulation in Question 1. In other words, convert each row of the input matrix into a probability vector. Sample inputs and outputs: • Input: np.array([[4, 6], [3.5, 9.11) Output: [[0.11920292 0.88079708] [0.00368424 0.99631576]] • Input: np.array([[2, 3.1, 5], [10, 3.7, 12], [4, 5.5, 0]])) Output: [[4.15115123e-02 1.24707475e-01 8.33781013e-01] [1.19176835e-01 2.18844992e-04 8.80604320e-01] [1.81818026e-01 8.14851861e-01 3.33011331e-03]] Hint: use numpy.sum with an appropriate axis and keepdims settings. You should also check broadcasting in numpy. Question 2b In fact, the function above is called the softmax function, and scipy has an implementation for it. First, read the API at: https://docs.scipy.org/doc/scipy/reference/generated/scipy.special.softmax.html. Then write code to apply this version of…