C++ Consider the following function:(int get_random(int start, int end){)int * rand_intnew int;std::random_device rd;std::mt19937 generator(rd());std::uniform_int_distribution<> distribution(start, end);*rand_int = distribution(generator);return*rand_int;Imagine creating 1000 random numbers using this function. How much of a memoryis leaking?

Answered: Consider the following function: int…

Engineering

Computer Science

Consider the following function: int get_random(int start, int end){) int * rand_int = new int; std::random_device rd;

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Similar questions

Write a function in C programming language that gets two ints x and y, and returns the sum of all ints between x and y, including them. int sum_interval(int x, int y); For example: - sum_interval(1, 4)returns 1+2+3+4=10. - sum_interval(10, 3)returns 3+4+5+6+7+8+9+10=52. - sum_interval(2, -1)returns (-1)+0+1+2=2. - sum_interval(-1, -1)returns -1. Note that we may have x>=y or x<=y. You may assume that the sum will be within the range of int.
Write a function checkConditions that takes a two-dimensional array of integers, array, and a set of integers, conditions, as input. The function should return 0 if all elements in the array are contained in the conditions set. If any element in the array is not in the conditions set, the function should return -1. Function signature: int checkConditions(int array[][], int rowSize, int colSize, std::set<int> conditions) Write the implementation of the function checkConditions without using any built-in functions for searching elements in sets. You should implement your own algorithm for searching elements in the conditions set. Example: int arr[3][4] = {{1,2,3,4},{5,6,7,8},{9,10,11,12}}; std::set<int> conditions = {1,2,3,6,7,8}; int result = checkConditions(arr, 3, 4, conditions); //result will be 0 since all elements in the array are in the conditions set.
(Numerical) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters to 0, and then generate a large number of pseudorandom integers between 0 and 9. Each time a 0 occurs, increment the variable you have designated as the zero counter; when a 1 occurs, increment the counter variable that’s keeping count of the 1s that occur; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of the time they occurred.
(Program) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters, such as zerocount, onecount, twocount, and so forth, to 0. Then generate a large number of pseudorandom integers between 0 and 9. Each time 0 occurs, increment zerocount; when 1 occurs, increment onecount; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of time they occurred.
Write a c++ program and test the “digit” function:Function Prototype: int digit(int n,int k)This function returns the kth digit of the positive integer n. For example, if n is the integer29,415, then the call digit(n,0) would return the digit 2, and the call digit(n,2) would returnthe digit 4. The digits are numbered from left to right beginning with the “zeroth” digit. Take input and display output in main function. donot use arrays
Write a function in C language that will take a 2D Array of size 3x3 from the user. Your Program should: 1. Prompt the user to enter 2D array of size 3x3. 2. Calculate the sum of all rows. 3. Calculate the sum of all columns 4. Return 1 if the sum of all rows is greater than sum of all columns, 0 otherwise. Your main program should print the result based on the returned values.
Python Functions for Statistical Applications 1A. Implementation with the standard def keyword Suppose you have done a statistical comparison using the Z-scores approach. Write a function for calculating the lower bound of the 95% CI. A starter code for this function is already provided to you below. def compute_lower_bound(n, mu, stdev, z=1.96):"""Computes lower bound of a confidence intervalParameters:n: Type int. number of data pointsmu: Type float. sample meanstdev: Type float. sample standard deviationz: Type float. critical value. Default to 95%CI that corresponds to value of 1.96"""# YOUR CODE HERE# Hint: A correct implementation can be as short as just 1 line long! 1B. Using the function of Part 1A Run your function on the following scenario: There are 500 data points. The sample mean is 2525 The sample standard deviation is 7.57.5 The critical value at 95% confidence, ?0.95�0.95, is a constant: 1.96 # YOUR CODE HERE 1C. Application of Part 1A Now, you are asked to do the…
Please answer the "function" I already did the code. thank you this is my code : A = [2,1,0;-1,1,1;1,1,-1] [ss,li,bas] = splibas(A) function [ss,li,bas] = splibas(A) % Initialize outputs to false ss = false; li = false; bas = false; % Get Dimension of vectors dim = size(A(:,1),1); % Get number of vectors n = size(A,2); % Calculate Rank of A r= rank(A); % If rank is equal to number of vector % Vectors are linearly independent if(r==n) li = true; end % Calculate row echelon form of A RE = rref(A); % Find number of non-zero rows span = 0; for i=1:dim if(~isequal(RE(i,:),zeros(1,n))) span = span + 1; end end % If number of non-zero rows equals vector dimension % Vectors form a spanning set if(span==dim) ss = true; end % If vectors are both spanning set and linearly-independent % They form Basis if(ss==true && li==true) bas = true; end end
Write a c++ function reportDuplicates() that takes a two dimensional integer array as a parameter and identifies the duplicate valuesin the array. The function then reports these to user. Sample input and corresponding output:How many rows? 5How many columns? 2Let’s populate the array:1 86 97 312 522 4Thank you, there are no duplicate elements!How many rows? 3How many columns? 4Let’s populate the array:3 7 5 76 9 7 38 5 12 6Thank you, 3 appears 2 times, 7 appears 3 times, 5 appears 2 times,and 6 appears 2 times.
Write a function called subsequence() that finds the longest common subsequence of two DNA strands. The function should take two DNA strands (strings) as input and should return the longest common subsequence. Example:subsequence(“AATTCAT”, “CAT”) returns “CAT”subsequence(“CAAAT”, “CAT”) returns “CA”subsequence(“CCG”, “TTA”) returns “”subsequence(“AATGTTACCC”, “AATCTTACCT”) returns “TTACC”subsequence(“AATCTTAGCC”, “AATCAAAGCC”) returns “AATC”If there are multiple subsequences of the same length, then return the first
Write and test the “digit” function: Function Prototype: int digit(int n,int k)This function returns the kth digit of the positive integer n. For example, if n is the integer 29,415 that is entered by user , then the call digit(n,0) would return the digit 2, and the call digit(n,2) would returnthe digit 4. do this only by using functions and loops. arrays are not allowed. example :Input: n = 29415 , k = 1 output: 9 Input: n = 2 , k = 1 output: index out of bound (return -1)
Write a function called number_matrix(r,c) that takes two parameters r and c and PRINTS ON THE SCREEN a matrix of numbers as follows: 1 2 3 4 5 .... 2 3 4 5 6 .... 3 4 5 6 7 .... ... In this pattern, each row contains c numbers and there are r rows. For example, number_matrix(4,3) results in: 1 2 3 2 3 4 3 4 5 4 5 6