What are the disadvantages of arrays? a) Data structure like queue or stack cannot be implemented b) There are chances of wastage of memory space if elements inserted in an array are lesser than the allocated size c) Index value of an array can be negative d) Elements are sequentially accessed

Sorted Names Problem:Assume that you already have the bubbleSort () ans swapS() modules. Design the main() program that allows the user to enter 20 names into a String array. Sort the array in ascending (alphabetical) order and display its contents. //  The bubbleSort module accepts an array of Strings and array size//  and sorts array in ascending orderModule bubbleSort(String Ref array[], integer arraySize)    Declare Integer index1, index2        // bubblesort scores    For index1 = arraySize – 1 to 0 Step -1        For index2 = 0 to index1 – 1            If array[index2] > array[index2 + 1] Then                Call swapS(array[index2], array[index2 + 1)            End If        End For    End ForEnd Module// The swapS module accepts two String elements and swaps their contentsModule swapS(String  ref a, String  ref b)    Declare String temp    // Swap a and b    Set temp = a    Set a = b    Set b = tempEnd Module

C++ Dynamic Array Project Part 2

A pointer variable is O the same thing as an array subscript dereferences a pointer and allows access to the value of the variable the pointer points to an operator that returns the memory address of a variable a variable that holds an address

Matlab code

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…

Question 1: Array offset computation Compiling code that accesses an element of an array involves computing the base address of the array and the offset from that address to the specified element. The offset to array elements must always be computed statically. O (a) True O (b) False Save

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…