4. Perform array slicing to retrieve elements. Assume the array is arr=[1,2,3,4,5,6,7,8,9,10] a) Slice elements from index 3 to the end of the array: b) Slice elements from the beginning to index 4 (not included): c) Slice from the index 3 from the end to index 1 from the end:( Use negative indexing) obob 5. Use this array for the following practice: Arr = np.arange(10) onollonut yimut pniwollol ont do poitae a. Find the square of every number in array anoidonut yamulW b. Find the square root of every number in array c. Multiply the square of each number in array with its respective square root

4. Perform array slicing to retrieve elements. Assume the array is arr=[1,2,3,4,5,6,7,8,9,10] a) Slice elements from index 3 to the end of the array: b) Slice elements from the beginning to index 4 (not included): c) Slice from the index 3 from the end to index 1 from the end:( Use negative indexing) obob 5. Use this array for the following practice: Arr = np.arange(10) onollonut yimut pniwollol ont do poitae a. Find the square of every number in array anoidonut yamulW b. Find the square root of every number in array c. Multiply the square of each number in array with its respective square root

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

()8. integer array nums and an integer k, return the length of the shortest non-empty subarray of nums with a sum of at least k. If there is no such subarray, return -1. A subarray is a contiguous part of an array. Example 1: Input: nums = [1], k = 1 Output: 1 Example 2: Input: nums = [1,2], k = 4 Output: -1 Example 3: Input: nums = [2,-1,2], k = 3 Output: 3.
3. Selection Sort• The idea in a selection sort is that you locate the largest item out of a set ofunsorted items, and move it into position at the end of the unsorted items. Asorted region grows one item at a time, while an unsorted region shrinks.• As done in Part 1, fill an array with random numbers.• Write a function that locates the largest element in the portion of the arraybeginning at the start of the array, up to a given index, and swaps the largestitem with the item at the given index.• E.g. If searching a[0] to a[7] locates the largest item at a[4], a[4] and a[7] would beswapped.• Write a second function that calls the first function repeatedly, until the entirearray is sorted. (Each time the first function is called, it will search one fewerelement)
Assignment Write a program that reads a 2D array of chars, checks, and corrects each char within this array, and print out the corrected 2D array. First the program will read the row count (rowCount) and column count (columnCount) of the 2D array, both as int values. Then, the chars constituting the 2D array will be read on a row-by-row basis. After reading the 2D array, the program will check and correct each char within the 2D array according to the rules below. This process MUST be done by using a void function by sending the appropriate cell of the 2D array with a call-by-reference fashion. • If the row index is an even number, a char can only be a lowercase English value. • If the row index is an odd number, a char can only be ?, 7', or X'. • Any incorrect value MUST be changed into Finally, the checked and corrected 2D array will be printed out to the screen. NOTE: Checking the correctness of a char and correcting it (if necessary) MUST be done in the function with a…
You need to generate a (5x12) rain matrix (Rain[5][12]) that contains the average rainfall over 12 months for a 5 year period. You program should do the following steps: Create a 5x12 integer rainfall matrix Create a 5 element array of int pointers(int * Rain[5]) and assign each pointer to the address of the first element of each row Populate the elements of the matrix with pseudo-random numbers having a range from 0-100 Use the rand( ) function to generate your temperatures. The output of rand() should be mod with 100 (rand()%100) in order to get reasonable rainfall values. Init the random number generator with long seed = srand(67) This task should be performed by a function, void RainGen(int* Rain[ ], int R, int C), that populates all the matrix entries. After generating all rainfall matrix entries, print the entire matrix using the function, void Print(int* Rain[ ], int R, int C); Calculate the total monthly Rainfall per year for the entire five years. Use the following…
Computer Science 1)What are the steps in the selection sort algorithm? Group of answer choices Split the array into two subarrays, sort each subarray, and append the two arrays together. Starting at index 0, search the entire array to find the smallest value and swap the smallest value with the value at index 0. 2)Suppose there an integer threshold such that the expression n2 is equal to the expression 9n-8 at that threshold, and is larger for all integers values larger than the threshold. What does this mean?
Homework 7: Merging two sorted arrays Due date: Saturday March 18. Objectives: Learn to implement algorithms that work with multiple arrays. Understand the Merging algorithm. IMPORTANT. Carefully study Lecture 1 from Week 8 on D2L before you start on this. Sometimes we need to combine the values in two sorted sequences to produce a larger sorted sequence. This process is called Merging. As an example, if the first sequence (S1)contains the numbers 2 3 4 4 5 9 and the second sequence (S2) contains the numbers 1 4 5 8 9 11 12 13 17 the output sequence will contain 1 2 3 4 4 4 5 5 8 9 9 11 12 13 17 Each sequence can be stored in an array. The strategy is as follows: Start by comparing the first items in the two input arrays. Write the smaller number to the output array, and move to the the next item in that array. This is repeated until we reach the end of any one of the input arrays; thereafter, we simply copy all the numbers from the other input array to the output array. (In the…
MIPS Assembly The program: Write a function in MIPS assembly that takes an array of integers and finds local minimum points. i.e., points that if the input entry is smaller than both adjacent entries. The output is an array of the same size of the input array. The output point is 1 if the corresponding input entry is a relative minimum, otherwise 0. (You should ignore the output array's boundary items, set to 0.) My code: # (Note: The first/last entry of the output array is always 0# since it's ignored, never be a local minimum.)# $a0: The base address of the input array# $a1: The base address of the output array with local minimum points# $a2: Size of arrayfind_local_minima:############################ Part 2: your code begins here ###la $t1, ($t2)la $t1, ($t2)move $a1, $s0 li $a2, 4jal find_local_minima print:ble $a2, 0, exitlw $a0, ($s0)li $v0, 1syscall addi $s0, $s0, 4addi $a2, $a2, -1 ############################ Part 2: your code ends here ###jr $ra I am not getting the correct…
Mirrored Matrices Concepts Tested: iterating through multi-dimensional arrays, functions, function overloading Instructions: 1) Write a SET OF 3 OVERLOADED functions called flipMatrixHorizontal() that takes the following inputs: a) a 2-dimensional array with any number of rows and 3, 4, or 5 columns (this is where the overloading comes in). b) an array to put the flipped array values in c) number of rows d) number of columns The function should reverse the ROWS (rotate around the horizontal axis)of the original array and put the new values in the flipped array. 2) Write a SET OF 3 OVERLOADED functions called flipMatrixVertical() that takes the following inputs: a) a 2-dimensional array with any number of rows and 3, 4, or 5 columns (this is where the overloading comes in). b) an array to put the flipped array values in c) number of rows d) number of columns The function should reverse the COLUMNS (rotate around the vertical axis)of the original…
Computer Science Selection sort Algorithm (Assembly language - masm in 32 bits) Write a program that sorts an array of a set of numbers in assembly language, masm in 32 bits. Sort the numbers in the array from ascending to descending and simply print the array. Remember the time complexity of the sorting algorithm is O(n^2) The array - {25, 62, 91, 15, 10, 11, 35, 78}
# //Write the assembly for the following loop # //Use indexed array access (no pointers) 15; const int AMAX # # # # . data A: int A[] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; for (int i=AMAX; i > 0; i--) { A[i-1] = A[i] * 2; } # DO NOT CHANGE THIS TEST DATA .word 1, 2, 3, 5, 6, 7, 4, 9, 10, 11, 12, 13, 14, 15 .word AMAX: . word 15 .text .globl main $t0, AMAX $s0, A #TODO: Write the loop code: A[i+1] = A[i] * 2 main: #highest index #&A[0] lw la loоp: exit: li $v0, 10 syscall
6 - final question What indexes will be examined as the middle element by a binary search for the target value 8 when the search is run on the following input array? int[] numbers = {1, 2, 3, 4, 5, 7, 8, 9, 10}; %3D a. [0, 1, 2, 3, 4, 5, 6] b. [1, 2, 3, 4, 5, 6, 7] c. [4, 6] d. [5, 7]