Write an assembly language(intel x86 32bit) program with the following features An array with 10 numbers The program searches for the smallest number in the array The program then prints the number and its position in the array

You can Use C++ programming, Windows Programming, Java, or Ptyhon to solve it The following table contains quarterly sales figures for five (5) departments:   Quarter 1 Quarter 2 Quarter 3 Quarter 4 Total Department 1 750 660 910 800   Department 2 800 700 950 900   Department 3 700 600 750 600   Department 4 850 800 1000 950   Department 5 900 800 960 980   Total           Design and write a Windows program/module named SalesAnalysis that will: Declare a two-dimensional integer array named sales – (Note: you have 6 rows and 5 columns) - that will hold the 4 quarterly sales for 5 departments Populate the first four columns for the 5 departments using the data in the preceding table. Contain a loop to compute and populate the total column. Store each department’s total in the array as it is being computed. Contain a loop to compute and populate the total row. Store each quarter’s total in the array as it is…

Use matlab

MIPS assembly language program   Linear Search: Write a MIPS assembly language program that can search for a number that entered by user in an array with 20 integer numbers and prints the index of the number in the array if it is found.

Convert the following pseudo code into assembly code. int array_list() = {10, 11, 13, 18, 21, 23, 24, 17, 45}; int array_size = sizeof array_list / sizeof sanple; int index = 0; / index for while loop int sun- 0; // accumulate the result for (current_size = array_size ; current_size > 8 ; current_size--){ while ( index < current_size){ if( array_list[index] is even ){ sum += array_list[index]; index + 1; Store the result in the variable – sum.

1. Convert the following C code into MIPS assembly: void array_comp(int num) { int array [10]; int i; for (i=0; i= 0) return 1; else return 0; int sub (int a, int b) { return a-b; }