(1) Write a function that given an integer n, it finds all binary sequences of length 2n such that the sum of thefirst n bits is same as the sum of last n bits.Example:For n = 2, the sequences are:I,1] [,2] [,3] [,4] L,51 [,6][1,] 0 1 1 0 0 10 0[2,1 01 1 1[3,1 010.1.[4,1 011For n = 3, the sequences are:[1 oI IO o o o o o I II III 0 o 0 1a1 o o 0 I1.0 0 0 0 O I1.110即 0O 0 I O O61 0 0 11.L1 0 0 0 IO OO 0 I 0 II0I(2) Write a function that given an integer n computes all non-increasing partitions of n.Example:For n=3,111213For n=4,111122211314

In this program the if n=3 then the binary sequence first 3 bits and last bit sum should be same.…

non that given an integer n, it finds all binary sequences of length 2n such that the sum of the first n bits is same as the sum of last n bits. Example: For n = 2, the sequences are: 1,1] [,2] [,3] L,4] [,51 (,61 [1,] 0 1 1 0 0 1 0 0 [2,1 0 [3,1 0 1 1 1 [4,1 0 1 0 1 1 For n 3, the sequences are: [] o 11 IO 0 o o 0 1 III IIO O 1 a1 o o 0 o 1. C幻 0 0 0 0 0 的 61 0 0 3. 1. O I 0 0 I 6O G1 0 0 0 IO O (2) Write a function that given an integer n computes all non-increasing partitions of n. Example: For n=3, 111 21 3 For n=4, 1111 22 211 31 4

non that given an integer n, it finds all binary sequences of length 2n such that the sum of the first n bits is same as the sum of last n bits. Example: For n = 2, the sequences are: 1,1] [,2] [,3] L,4] [,51 (,61 [1,] 0 1 1 0 0 1 0 0 [2,1 0 [3,1 0 1 1 1 [4,1 0 1 0 1 1 For n 3, the sequences are: [] o 11 IO 0 o o 0 1 III IIO O 1 a1 o o 0 o 1. C幻 0 0 0 0 0 的 61 0 0 3. 1. O I 0 0 I 6O G1 0 0 0 IO O (2) Write a function that given an integer n computes all non-increasing partitions of n. Example: For n=3, 111 21 3 For n=4, 1111 22 211 31 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

Write a function in C swapRows(): which takes two 4x4 array as an argument and swap the values of its even rows with odd rows . Expected input: 5 2 3 1 4 8 9 0 -1 3 8 -2 99 102 33 56 Expected Output: 4 8 9 0 5 2 3 1 99 102 33 56 -1 3 8 -2
Write a MIPS function that reads an array of n integers. The function "read" must receive two arguments: $a0 = addres array, and $a1 = number n of elements to read.
Implement the following function, without using any data structure or #include <bits/stdc++.h> /* Given two vectors of chars, check if the two vectors are permutations of each other, i.e., they contains same values, in same or different order.e.g., V1=[‘a’,’b’,’a’] and V2=[‘b’,’a’,’a’] stores same multi-set of data points: i.e., both contains two ‘a’, and one ‘b’. e.g., V3=[‘a’,’c’,’t’,’a’] and V4=[‘a’,’c’,’t’] are not same multi-set. V3 contains two ‘a’s, while V4 has only one ‘a’. Note: when considering multiset, the number of occurrences matters. @param list1, list2: two vectors of chars @pre: list1, list2 have been initialized @post: return true if list1 and list2 stores same values (in same or different order); return false, if not. */  bool SameMultiSet (vector<char> list1, vector<char> list2) THIS IS NOT THE CORRECT SOLUTION / include headers #include <bits/stdc++.h> // deinfe the namespace using namespace std; // function fo rchecking same bool…
Use C++ Programming language Write a function that merges two sorted array-based lists into one sorted array-based list. The function takes two arrays as parameters, each holding a sorted list of integers, merges them into a single sorted list, and returns the result. Note that this function performs the merge part of the merge sort algorithm. The function should have a linear time complexity i.e. O(N), where N is the sum of the length of the two input lists it merges. Note: You must write linear Function. Functions that are not linear will not be accepted. Deliverables: A copy of your merge function code in a text file. A copy of a test program to test your function. Be sure to test all cases e.g. two empty lists, one empty only, lists with 1 element each, lists with multiple elements. Screenshots of your test runs showing your function meets specifications.
A call perm(1) generates the permutations of the first n integers, stored in array T, where perm is the following function: procedure perm(i) if i = n then write T else for j = i to n do swap T[i] and T[j]perm(i+1)swap T[i] and T[j] Q1. For n = 3 and T[1..n] initialized with [3, 2, 1], give the result of perm(1). Q2. Determine the asymptotic efficiency of the algorithm. Submit your answers for Q1 & Q2. Do not write code for Q1, use instead algorithmic thinking.
Use C++ Programming language Write a function that merges two sorted array-based lists into one sorted array-based list. The function takes two arrays as parameters, each holding a sorted list of integers, merges them into a single sorted list, and returns the result. Note that this function performs the merge part of the merge sort algorithm. The function should have a linear time complexity i.e. O(N), where N is the sum of the length of the two input lists it merges. Deliverables: A copy of your merge function code in a text file. A copy of a test program to test your function. Be sure to test all cases e.g. two empty lists, one empty only, lists with 1 element each, lists with multiple elements. Screenshots of your test runs showing your function meets specifications.
Write a function that takes one input arr1, an array of 3 numbers. It should return one output, smallest a scalar double. smallest should be the index number of the lowest number in arr1. Assume that all 3 numbers are different. Do not use min or max to write this function
d. Write a function Encode as follows:• // Return M^e mod PQ• int Encode (int M, int e, int PQ); e. Write a function Decode as follows:• //Return C^d mod PQ• int Decode (int C, int d, int PQ); f. Verify that RSA algorithm works, i.e.,• int M;• /* M is an integer that is smaller than PQ */• cout <<"Enter an integer that is smaller than"<< PQ;• cin <<M;•• C=Encode (M, e, PQ);• M1=Decode (C, d, PQ);• assert (M==M1); //Note: include assert.h header file to use this//macro/function. c++
Computation a. Write a function countBits(int) that counts the number of bits that are 1. For example countBits(9) should return 2 because 9 = 1001 while countBits(16) should return 1 (10000 has one 1-bit). b. Write a function polynomial that takes an array of double, a length, and x as shown: double c[] = {3.0, 1.5, 1.0, -2.5); double y = polynomial(c, 4, 2.0); should compute the polynomial 3.0x + 1.5x² + 1.0x - 2.5 Note that the efficient way to do this is Horner's form: ((3.0 * x + 1.5) * x+ 1.0) * x - 2.5 You must use a loop, not hardcode it. Your code should work for. double c[] = {5.0, 1.0, 2.0, 3.5, 5.2}; cout << polynomial(c, 5. 2.2): c. Given the following 2-dimensional matrix, write loops to print out the sum of every row then column: constexpr int rows = 3, cols = 4; double x[rows][cols)] = { {1, 2, 3.5}, (2. -1, 1.5} }: Your loop should compute 1+2+3.5 = 6.5 and 2-1+1.5 = 2.5 for the two rows, then for the columns: 1+2 = 3, 2-1 = 1, and 3.5+1.5 = 5. The output of the…
Given an array of integers and a positive integer k, determine the number of (i, j) pairs where i < j and ar[i] + ar[j] is divisible by k. Example ar [1, 2, 3, 4, 5, 6] k=5 Three pairs meet the criteria: [1, 4], [2, 3], and [4, 6]. Function Description Complete the divisibleSumPairs function in the editor below. divisibleSumPairs has the following parameter(s): • int n: the length of array ar ⚫int ar[n]: an array of integers . int k: the integer divisor Returns -int: the number of pairs Input Format The first line contains 2 space-separated integers, 11 and k. The second line contains space-separated integers, each a value of arr[i]. Constraints • 2 ≤ n ≤ 100 • 1<k<100 • 1 ≤ ar[i] ≤ 100 Sample Input More STDIN 63 1 3 2 6 12 Function n6, k3 ar [1, 3, 2, 6, 1, 2] Sample Output 5 Explanation Here are the 5 valid pairs when k = 3: (0,2) ar[0] + ar[2]=1+2=3 (0,5) ar[0] + ar[5]=1+2=3 • (1,3) ar[1]+ar [3]=3+6=9 (2, 4) ar[2] + ar[4] = 2+1=3 • (4,5)→ ar[4] + ar[5]=1+ 2=3 with…
c) Consider the pseudo-codes representing two computer functions called loopA and loopB as follows: loopA (array T[], integer n) { for i from n to 2 loopB (integer n) { for s from 1 to n for j from 1 to i-1 for k from 1 to t if T[j]>T[j+1] then swap T[j] and T[j+1] a+t+k endif endfor } endfor } i. How many times will the swap function be performed in the best case and worst case of loopA? Justify your answer. ii. Express the time complexity of the loopB function using Big-Oh notation. Justify your answer. iii. Which program is faster? Justify your answer. endfor for t from 1 to s endfor endfor
Given an array of integers and a positive integer k, determine the number of (i, j) pairs where i < j and ar[i] + ar[j] is divisible by k. Example ar [1, 2, 3, 4, 5, 6] k=5 Three pairs meet the criteria: [1, 4], [2, 3], and [4, 6]. Function Description Complete the divisibleSumPairs function in the editor below. divisibleSumPairs has the following parameter(s): • int n: the length of array ar ⚫int ar[n]: an array of integers . int k: the integer divisor Returns -int: the number of pairs Input Format The first line contains 2 space-separated integers, 11 and k. The second line contains space-separated integers, each a value of arr[i]. Constraints • 2 ≤ n ≤ 100 • 1<k<100 • 1 ≤ ar[i] ≤ 100 Sample Input fin Contest ends in 5 days Submissions: 45 Max Score: 20 Difficulty: Easy Rate This Challenge: More STDIN 63 1 3 2 6 12 Function n6, k3 ar [1, 3, 2, 6, 1, 2] Sample Output 5 Explanation Here are the 5 valid pairs when k = 3: (0,2) ar[0] + ar[2]=1+2=3 (0,5) ar[0] + ar[5]=1+2=3 •…