IN JS ONLY NEEDED SOLUTION Your task, is to create ~ × N multiplication table, of size ŉ provided in parameter. For example, when is 5, the multiplication table is: 1, 2, 3, 4, 5 2, 4, 6, 8, 10 3, 6, 9, 12, 15 4, 8, 12, 16, 20 5, 10, 15, 20, 25 ● This example will result in: [[1, 2, 3, 4, 5], [2, 4, 6, 8, 10], [3, 6, 9, 12, 15], [4, 8, 12, 16, 20], [5, 10, 15, 20, 2511 Examples → [[1]] (3) → [[1, 2, 3], [2, 4, 6], [3, 6, 9]] multiplicationTable (1) → multiplicationTable

IN JS ONLY NEEDED SOLUTION Your task, is to create ~ × N multiplication table, of size ŉ provided in parameter. For example, when is 5, the multiplication table is: 1, 2, 3, 4, 5 2, 4, 6, 8, 10 3, 6, 9, 12, 15 4, 8, 12, 16, 20 5, 10, 15, 20, 25 ● This example will result in: [[1, 2, 3, 4, 5], [2, 4, 6, 8, 10], [3, 6, 9, 12, 15], [4, 8, 12, 16, 20], [5, 10, 15, 20, 2511 Examples → [[1]] (3) → [[1, 2, 3], [2, 4, 6], [3, 6, 9]] multiplicationTable (1) → multiplicationTable

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

Algorthim of how to find the largest element missing in an unsorted array of n positive integers and the running time of the algorthim is in O(n). Example of this is that the n=6 array C= [5,90,8,6,26,9] The largest element missing in the array is 7
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.
) Which one is the computationally best-case scenario for the insertion sort algorithm. InsertionSort(a[ ]){ int N = size; for (int i = 0; i < N; i++) for (int j = i; j > 0; j--) if (less(a[j], a[j-1])) // compare swap(a, j, j-1); // exchange else break;} A) 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 B) 10, 9, 8, 7, 6, 5, 4, 3, 2, 1 C) 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3 D) 10, 10, 1, 1, 2, 2, 3, 3, 4, 4 E) 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0
Suppose that f(n) is defined to be n/2 if n is even, and 3n + 1 if n isodd. It is known that for small values of n (less than 1040) the sequenceof values generated by repeated application of f starting at n eventuallyreaches 1. Consider all the sequences generated from n < 10, 000. Whatare the maximum values encountered?
For this given code, please help me create a recursive case for transpose of matrix using the cache oblivious algorithm. for ( size_t i=0; i<n; i += block ) { for ( size_t j=0; j<n; j++ ) { for ( size_t b = 0; b < block && i + b < n; ++b){ b[ j*n + i ] = a[ i*n + j ]; } } else { recursMatTranspose ( n, n, a, 0, 0, b, 0, 0 ); //recursive case using cache-oblivious algo } }
What is the worst case size of SL and SR (in terms of n) when you divide a list of unsorted items of size n into groups of (2*9)+1 while selecting a pivot? Input your answer as a decimal to three places. E.g. 3n/8 would be 0.375
I need help with this pratice run question. In C++, Implement a Hash Table of size 8191 (= 2^13 - 1) to store integers based on quadratic probing. Design your own hash function that is, in your view, sufficiently non-trivial and efficient to compute. Compare the average number of probes for the following cases:Generate 4000 integer random numbers in the range 0 to 10^6 - 1, and insert them into the hash table. Compute and print the total number of probes.Repeat step (a) above 10 times, and find the average number of probes over these 10 trials
Update the given 0-1 or binary knapsack program to minimize no. of columns approximately equal or in order of number of inputs having very large knapsack capacity. program to be updated: #include<stdio.h> #include<conio.h> void display(int B[5][6]); void main() { int b[]={3,4,5,6}; // 1D array to hold benefit of items int wt[]={2,3,4,5}; // 1D array to hold weight of items int B[5][6]; int MaxCapacity=5; //total capacity of knapsack int n=4; //no. Of items int wi,bi; // weight and benefit of item i for(int i=0;i<=n;i++) { B[i][0]=0; // first col is assigned 0 as no benefit if current Capacity (w) =0 } for(int w=0;w<=MaxCapacity;w++) { B[0][w]=0; // first row is assigned 0 as no benefit if no. Of items=0 } for(i=1;i<=4;i++) { for(w=1;w<=5;w++) { B[i][w]=-1; } } printf("\n initially benefit matrix B is as follows after 1st row n col is 0 \n"); display(B); for(i=1;i<=4;i++) { wi=wt[i-1];bi=b[i-1]; // weight and benefit of item i…
Given an integer array [A], efficiently find a descending sorted triplet such that: A[i]> A[i]> A[k] and 0 <=i<j <k <n, where n is the array size. For example, Input: A[] = {9, 1, 6, 7, 3, 4, 5) Output: Any one of the following triplets: (9, 7,5) (9, 7, 4) (9, 7, 3) (9, 6, 5) (9, 6, 4) (9, 6, 3) a) Design a brute-force algorithm to solve this problem complexity of your solution b) Design a more efficient algorithm to do the same task with less complexity and analyse the complexity of your solution. c) Develop a python code to implement your efficient algorithm. depend on the correctness of the code, indentation, comments, test-case] d) Prepare a brief report (250 words) comparing the two algorithms
2. (20) Arrange the following functions in increasing order of big O, i.e., a function in your list must be big O of the next function. Give all justifications. nyn, 23 log log n, (log n)2, 2(log n), Vn3.1,nlcos nl, nlog n 2n, 3", n! to0)
Consider printing neatly the silly text “This week has seven datesin it ok” in a column with width M = 11. This is represented as the printing neatlyinstance M;l1, ... , ln=11; 4, 4, 3, 5, 5, 2, 2, 2. (a) Fill in the birdAdvice[0..n] andcost[0..n] tables for this example. The original instance, its solution, and its cost arein the bottom row. (b) When filling in this last row, give solutions and costs associatedwith each of the possible bird answers
Conduct doubling experiments to compute the run time and plot the results (for array A and B ) for array sizes n = 2, 4, ... 1024. The function merge_sort (provided) . def merge (front, back): pos_f, pos_b = 0,0 merged = np.zeros(len(front)+len(back)) for i in range (len(merged)): if pos_f == len(front): merged[i] = back[pos_b] pos_b += 1 elif pos_b == len(back): merged[i] = front[pos_f] pos_f += 1 elif front[pos_f] < back[pos_b]: merged[i] = front[pos_f] pos_f += 1 else: merged[i] = back[pos_b] pos_b += 1 return merged def merge_sort(A): n = len(A) if n <= 1: return A mid = int(n/2) front = merge_sort(A[0:mid]) back = merge_sort(A[mid:]) return merge(front, back) ARRAY A) Ai s perfectly sorted and contains random integers (0 to 100 inclusive). b) B is reversely sorted and contains random integers (0 to 100 inclusive)