B)and calculate the sum of consecutive adjacent rows of both arrays More over youralgorithm is able to identify that how many negative and positive number does yourarray contain save the result in P and N 1 dimensional array.Write an algorithm that takes the input 2 multi-dimensional array and produceArray -1323132Array - 2-34-7-697-22Output Must be like this:Output Must Be Like This 3+2+3+2-3+4 = 11P=3 231352 589704N= -3 -6 – 7

Since no programming language is mentioned. I am attempting this in python. if you need it in any…

B) Write an algorithm that takes the input 2 multi-dimensional array and produce and calculate the sum of consecutive adjacent rows of both arrays More over your algorithm is able to identify that how many negative and positive number does your array contain save the result in P and N 1 dimensional array.

B) Write an algorithm that takes the input 2 multi-dimensional array and produce and calculate the sum of consecutive adjacent rows of both arrays More over your algorithm is able to identify that how many negative and positive number does your array contain save the result in P and N 1 dimensional array.

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 program to apply a cyclic shift in an array of characters (cstring) given number of spaces to shift. For example, if the input characters are abcadebcaand the number of spaces to shift is 3, the output will be: bcaabcadeIf the number of spaces is negative, the shift will be to the left. Note: You should NOT use any additional arrays (Apply the shift in-place). using Arrays and Vectors/ User-defined Functions
You are now running the insertion sort algorithm on your computer. Assume that at the start of iteration j=4 of the for loop, the array A is A=3,6,8,4,9,2,7,10, and that the for loop is iteration j=4. The array A should be written at the beginning of iteration j=5 of the for loop.
The check-in and check-out times of each guest for a hotel are given as input. You need to output the maximum number of guests staying at a time at the hotel. [Hint]: Sort the check-in array Sort the check-out array Merge the sorted arrays Keep track of the number of guests at the hotel during each iteration. To do this traverse the merged array. When someone check-ins, guest count increases by one, when someone check-outs, guest count decreases by one. And also keep track of the maximum number at any time Sample Input Check-in times Check out times Sample Output {2.00, 2.10, 3.00, 3.20, 3.50, 5.00} {2.30, 3.40, 3.20, 4.30, 4.00, 5.20} 2 {9.00, 9.40, 9.50, 11.00, 15.00, 18.00} {9.10, 12.00, 11.20, 11.30, 19.00, 20.00} 3 Your answer
With c programming and without pointer and function You are given an array of N positive integers. Find the maximum even values from the array. For finding the maximum even values from the array you can perform only one of the following operations. Choose any even value from the array. Choose any two(must be different) values from the array and perform summation on those two values. If it will even you can pick those two values. It is guaranteed that all the integers are distinct and at least one operation will exist in the given input. Input Format The first line contains a single positive integer N. The second line will contain N positive integers A1,A2,A3,A4…..An Constraints 1 <= N <= 10 1 <= A[i] <= 20 where (0 <= i < n) Output Format Print a single positive integer, the maximum even value. Sample Input 0 52 4 6 8 10 Sample Output 0 18 Explanation 0 In this case, we can choose 8 and 10, the summation is…
Correct answer will be upvoted else Multiple Downvoted. Computer science. you can choose two indices x and y (x≠y) and set ax=⌈axay⌉ (ceiling function). Your goal is to make array a consist of n−1 ones and 1 two in no more than n+5 steps. Note that you don't have to minimize the number of steps. Input The first line contains a single integer t (1≤t≤1000) — the number of test cases. The first and only line of each test case contains the single integer n (3≤n≤2⋅105) — the length of array a. It's guaranteed that the sum of n over test cases doesn't exceed 2⋅105. Output For each test case, print the sequence of operations that will make a as n−1 ones and 1 two in the following format: firstly, print one integer m (m≤n+5) — the number of operations; next print m pairs of integers x and y (1≤x,y≤n; x≠y) (x may be greater or less than y) — the indices of the corresponding operation. It can be proven that for the given constraints it's always possible to find a correct sequence…
Write a program to display find and display the duplicate numbers in the given array of elements.Input:Enter array of elements: 10 20 1 3 4 1 2 10 1 8Output:Duplicate elements in the given array of elements are10 (2 times)1 (3 times)
Problem2: A square matrix can be represented by a two-dimensionalarray with N rows and N columns. You may assume a maximum size of 50 rows and 50 columns. 1. Write an algorithm MakeEmpty(n), which sets the first n rows and n columns to zero. 2. Write an algorithm Add(M1, M2, M3), which adds two matrices M1 and M2 together to produce matrix M3. 3. Write an algorithm Subtract(M1, M2, M3), which subtracts matrix M2 from matrix M1 to produce matrix M3. 4. Write an algorithm Copy(M1, M2), which copies matrix M1 into matrix M2.
Read in an integer n (n < 25). Read n integers in an array A. Then do the following (writeseparate programs for each, only the reading part is common).a) Find the sum of the absolute values of the integers.b) Copy the positive and negative integers in the array into two additional arrays B and Crespectively. Print A, B and C.c) Exchange the values of every pair of values from the start (so exchange A[0] and A[1],A[2] and A[3] and so on). If the number of elements is odd, the last value should stay thesame.write c program
2. Consider an array consisting of the following sequence: 1, 4, 9, 16, 25, 49, …, n Suppose a number in the sequence is missing. a. Write the mathematical process to find the missing number, i.e. some equation. b. What is the time complexity of finding the missing number in the sequence?
Input a list of employee names and salaries and store them in parallel arrays. End the input with a sentinel value. The salaries should be floating point numbers Salaries should be input in even hundreds. For example, a salary of 36,510 should be input as 36.5 and a salary of 69,030 should be entered as 69.0. Find the average of all the salaries of the employees. Then find the names and salaries of any employee who's salary is within 5,000 of the average. So if the average is 30,000 and an employee earns 33,000, his/her name would be found. Display the following using proper labels. i need to do this in raptor.
you are given integers A = [a0, a1, a2, · · · an], where a are integers. We want to determine the largest sum of a portion of consecutive values in the array. array A = [3, 13, −20, 9, −3, 30, 9, −70], largest sum of a portion of consecutive values is 9-3+30+9 = 45. a) you must write an iterative algorithm that can determine the largest sum of a portion of consecutive values / show the time complexity b)Write a dynamic programming-based algorithm that determines the largest sum of a portion of consecutive values/show its time complexity