Given two vectors of integers (either positive, negative or zeros) vi and v2 of length di and d2 respectively, write a C function prodCartFilt that displays on the screen the cartesian product of the two vectors, filtered by excluding the pairs of numbers that are either equal to each other or differ by 1. The prototype of the function should be the following: void prodCartFilt (int *v1, int dl, int *v2, int d2) ; Remember: the cartesian product of two sets of values is the set of all possible pairs combining one element of the first set and one element of the second set. Example: vl=(1,2,3) v2=(3,4,5,6) Filtered Cartesian product: (1,3). (1,4), (1,5), (1,6), (2,4), (2,5), (2,6), (3,5). (3,6). The excluded pairs are: (2,3), (3,3). (3,4). Choose the print format that you prefer.

Given two vectors of integers (either positive, negative or zeros) vi and v2 of length di and d2 respectively, write a C function prodCartFilt that displays on the screen the cartesian product of the two vectors, filtered by excluding the pairs of numbers that are either equal to each other or differ by 1. The prototype of the function should be the following: void prodCartFilt (int v1, int dl, int v2, int d2) ; Remember: the cartesian product of two sets of values is the set of all possible pairs combining one element of the first set and one element of the second set. Example: vl=(1,2,3) v2=(3,4,5,6) Filtered Cartesian product: (1,3). (1,4), (1,5), (1,6), (2,4), (2,5), (2,6), (3,5). (3,6). The excluded pairs are: (2,3), (3,3). (3,4). Choose the print format that you prefer.

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

Two numbers are said to be co‐prime, if the greatest common divisor of the numbers is one. Forexamples,13 and 14 are co‐prime but 14 and 21 are not.a. Write a C function gcd_helper (int x, int y) to find the greatest common divisor of twonumbers x and y.b. Write a C function CoPrime_helper (int a, int b) to test whether the pair of numbers aand b are co‐prime by using gcd_helper() function.In the main() function, read five numbers and use the CoPrime_helper ( ) function to test howmany pair of them are co‐prime.
A natural number is prime if it is greater than 1 and has no divisors other than 1 and itself. Example: 8 isn't a prime number, as you can divide it by 2 and 4 (we can't use divisors equal to 1 and 8 as the definition prohibits this). On the other hand, 7 is a prime number as we can't find any legal divisors for it. Your task is to write a function checking whether a number is prime or not. in phython langauge Ques: The function: is called IsPrime() takes one argument (the value to check) returns True if the argument is a prime number, and False otherwise. Hint: try to divide the argument by all subsequent values (starting from 2) and check the remainder - if it's zero, your number cannot be a prime; think carefully about when you should stop the process. If you need to know the square root of any value you can utilize the ** operator. Remember: the square root of x is the same as x**0.5 Write a code that calculates all the prime numbers between 1 and 20. (Hint: Use a loop and…
A natural number is prime if it is greater than 1 and has no divisors other than 1 and itself. Example: 8 isn't a prime number, as you can divide it by 2 and 4 (we can't use divisors equal to 1 and 8 as the definition prohibits this). On the other hand, 7 is a prime number as we can't find any legal divisors for it. Your task is to write a function checking whether a number is prime or not. Please us phython language The function: is called IsPrime() takes one argument (the value to check) returns True if the argument is a prime number, and False otherwise. Hint: try to divide the argument by all subsequent values (starting from 2) and check the remainder - if it's zero, your number cannot be a prime; think carefully about when you should stop the process. If you need to know the square root of any value you can utilize the ** operator. Remember: the square root of x is the same as x**0.5 Write a code that calculates all the prime numbers between 1 and 20. (Hint: Use a loop and…
Write a function that converts a phrase into pig Latin. A word is convertedto pig Latin by removing the first character of the word, placing it at theback of the word, and adding the characters “ay” to the word. For example,“hello world” in pig Latin is “ellohay orldway.” Your function can assumethat each word consists of at least two letters and that each word is separatedby one space, with no punctuation marks.
Define a function called gaussian() that takes in the arguments x, mu, and sig. Convert the above normal equation into code and return the output of the equation. Recall that mu represents ? and sig represents ?. # TODO 1.1 y_values = display(y_values) todo_check([ (y_values.shape == (120,),'y_values does not have the correct shape of (120,)'), (np.all(np.isclose(y_values,…
Write a c++ program that takes a date in the following format: December 24th, 2021 and extracts the day, month, and year as 3 integers. Your program should have the following functions: (a) WriteafunctiongetDatethatpromptsausertoenteradateasastringandreturns it. (b) Write a function extract that takes as its parameter a date and returns the day, month, and year as 3 integers.use the function isdigit(c) that returns true if c is a digit character and false if otherwise. (c) Write a function convertDigits that takes as its parameter a string of digits and converts it to an int.(to convert a digit character to a digit number use static_cast<Int> ('D') - static_cast<Int>('0') where d is 0,1,...,9) (d) Write a function convertMonths that takes as its parameter a month as a string and returns a corresponding number from 1 to 12 (1 for January, . . . , 12 for Decem- ber).
Write a function that takes 3 I/O integer parameters, and sort them in ascending order. (C++)
Transcribed Image Text About initial programming in python: Consider the series: 8. 1)" 1 = 1- 3 1 1 1 2n | 1 n=0 whose sum converges ton/4 That is: П lim s, = a) Write a function that, given n, calculates the sum of the series up to term n. b) Write a function that calculates the sum of the series with an error of less than O.01, that is, calculate the sum of the series series such that |Sn-N/4| < O. 01. Your function must also return the number of terms necessary to reach this error, that is, your function will return a tuple with the two calculated values. Important: It is mandatory to use the function defined in the previous item. Hint: math.fabs(number) returns the absolute value (module) of a number.
For this assignment you will be replicating the game of Roshambo (aka rock, paper, scissors). Please answer both parts a and b of the following question below. Show the R code in your answer and annotate all parts of the code. a.) First, you need to come up with a strategy to win the game. Write a function in R that takes in a vector of past plays for your opponent (each play should be represented as "R", "P", or "S") and outputs the next move ("R", "P", or "S"). Your strategy should at least depend on the last two moves used, but you should return a random move if there is not enough past history to use the strategy. b.) Now, play your strategy against a random player who uses rock, paper, or scissors with 1/3 probability each. Who wins the most rounds after 100 rounds of play? Write a function in R.
Develop a code that gets two integers from the user and calculates and prints their least common multiplier or LCM. LCM is the smallest number that divides both given integers. Example. lcm (10, 15) = 30, lcm (5,7) = 35 and lcm (12, 24) = 24Hint: we know that lcm(x,y) = xy/gcd(x,y) where gcd is the greatest common divisor (discussed in class). Develop a gcd function in your code, get the two numbers from the user, call your function to calculate their gcd and then use the formula above to calculate and display their lcm GOOD LUCK! Reference This is a list of function prototypes of the C library functions presented in class. You may use any of these functions in your solutions (unless the requirements explicitly indicate otherwise). As you have been provided the function prototypes, you are expected to use the functions correctly in your solutions. double atof(char *string); int atoi(char *string); long atol(char *string); int fclose(FILE *filePointer); char *fgets(char…
Write program in python with a function occupy(n), which shows how birds are going to occupy n nests, assuming that each new bird will choose the nest in the middle of the largest unoccupied run of nests. For example, if there were 10 nests, occupy(10) would print out the following sequence, where underscore indicates an unoccupied nest, and X indicates an occupied nest. The first line of the printout is just 10 underscores showing that all the nests are unoccupied. The second line shows that a bird came to nest in position 5, since that is one the first middle positions of the unoccupied run from 0 to 9. In the third line a bird came to occupy the middle position for the longest open run of nests, from 0 to index 4.
A natural number is prime if it is greater than 1 and has no divisors other than 1 and itself.Example: 8 isn't a prime number, as you can divide it by 2 and 4 (we can't use divisors equal to 1 and 8 as the definition prohibits this). On the other hand, 7 is a prime number as we can't find any legal divisors for it.Your task is to write a function checking whether a number is prime or not.The function:•is called IsPrime()•takes one argument (the value to check)•returns True if the argument is a prime number, and False otherwise.Hint: try to divide the argument by all subsequent values (starting from 2) and check the remainder - if it's zero, your number cannot be a prime; think carefully about when you should stop the process.If you need to know the square root of any value you can utilize the ** operator. Remember: the square root of x is the same as x**0.5Python programming question Write a code that calculates all the prime numbers between 1 and 20. (Hint: Use a loop and call the…