write code in x86 assembly q5a Subtract an array of 5 doublewords using indirect operands. Save the final result in a variable. write code in x86 assembly q5b Use following array declarations: arrayB BYTE 60, 70, 80 arrayW WORD 150, 250, 350 arrayD DWORD 600, 1200, 1800 For each array, add its 1st and last element using scale factors and display the result in a separate register. (Hint: Use ESI and TYPE Operator).

write code in x86 assembly q5a Subtract an array of 5 doublewords using indirect operands. Save the final result in a variable. write code in x86 assembly q5b Use following array declarations: arrayB BYTE 60, 70, 80 arrayW WORD 150, 250, 350 arrayD DWORD 600, 1200, 1800 For each array, add its 1st and last element using scale factors and display the result in a separate register. (Hint: Use ESI and TYPE Operator).

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 c++ for the following. donot copy from other sites. Solve this question without using pointers. Take a Boolean 2D array of 10X10, where each row is sorted from the user, Find the row with the maximum number of 1s.Example:Input matrix0 1 1 10 0 1 11 1 1 1 // this row has maximum 1s0 0 0 0Output: 2
Talk about the difference of accessing elements in an array VS access the memory address of an array What will happen with the following code: 1: cout << array<<endl; 2: cout << array[0] << endl; Does C++ support Index Out of bound Checking? If so, please explain how that works, if not, explain what will happen if Index Out of bound happens.
# //Write the assembly for the following loop# // Use indexed array access (no pointers)# const int AMAX = 15;# 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;.dataA: .word 0,1,2,3,4,5,6,7, .word 8,9,10,11,12,13,14,15AMAX: .word 15 .text.globl mainmain: #TODO: write the loop code: A[i+1] = A[i] * 2
Computer Science Write a shell program to demonstrate array operations using switch case. The operations are print all values of an array, print specific values of an array, print range values, get the size of an array, search and replace value, add new value to existing array, remove a value of an array, deleting Arrays, copy an array, combining arrays, and load Content of a File into an array
Utilizing c++, write a code to implement the following:Firstly, create(populate) an array (one with unknown size) and determine its(array's) size. Furthermore, the array should then be sorted and its output(prints out) should print each element in the array in order from the last to the 1st index.
Please fill in the blanks where all the XXXXXXX is at .386 .model flat, stdcall .stack 4096 ExitProcess PROTO, dwExitCode: DWORD .data Array WORD 10, 2, 23, 45, 21, 11 MAXIMUM WORD ? .code main PROC mov ecx, LENGTHOF Array ; to loop through every item mov esi, OFFSET Array ; points to the first item of the array mov ax, 0 ; start with 0 as the highest value L1: XXXXXX ; compares current max with current item JAE L2 ; if ax is larger or equal to the current item, no change in ax. Just move to next element XXXXXXX ; update ax with the current element, so it becomes the new max L2: XXXXXXX ; move to the next item of the array loop L1 ; if there are more items, loop again mov MAXIMUM, ax ; finally, move the max value into MAXIMUM INVOKE ExitProcess, 0 main ENDP END main
Computer Science Consider the following pthreads code that is supposed to double each number of the array (all header files and error checks have been omitted for brevity). The two halves of the array are supposed to be processed in parallel. Is the following code correct? If so, then explain why so. If not, then please identify and describe each flaw. void* doStuff1(void* arg){ int* ptr = (int*)arg; *ptr = *ptr * 2;}int main(){ pthread_t tids[100]; int array[100]; for(int i = 0; i < 50; ++i) { pthread_create(&tids[i], NULL, doStuff1, (void*)&i); } for(int i = 50; i < 100; ++i) { pthread_create(&tids[i], NULL, doStuff1, (void*)&i); } return 0;}
5. Implement the binary search function below that returns the index of the target value in an integer array. int search(int a[], int t, int l, int r); Given the binary search function in question 5 and the array a below, list all activations when calling search(a, 19, 0 15). -9 -5 -2 0 1 3 7 11 17 19 21 25 27 31 37 41 a index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
3. Implement a function called findLargestIndex which returns the index of the rowwith the largest sum.ex. int array[3][6] = {{3, 6, 8, 2, 4, 1}, // sum = 24{2, 4, 5, 1, 3, 4}, // sum = 19{1, 0, 9, 0, 1, 0}}; // sum = 11If the findLargestIndex function was called using this array, it would return 0, asit is returning the index of the row, not the sum.Note that the number of columns is required when passing a 2d array to a function.Assume that 2D arrays passed to this function will have 6 columns.Title line: int findLargestIndex(int array[][6], int rows, int columns);
Wap Given a sorted array nums, remove the duplicates in-place such that each element appears only once and returns the new length. Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory. Clarification: Confused why the returned value is an integer but your answer is an array? Note that the input array is passed in by reference, which means a modification to the input array will be known to the caller as well. Internally you can think of this: // nums is passed in by reference. (i.e., without making a copy) int len = removeDuplicates(nums); // any modification to nums in your function would be known by the caller. // using the length returned by your function, it prints the first len elements. for (int i = 0; i < len; i++) { print(nums[i]); } Example 1: Input: nums = [1,1,2] Output: 2, nums = [1,2] Explanation: Your function should return length = 2, with the first two elements of nums being 1 and 2…
Answer in C++, please show your compiled output Ask user enter size of array N, then ask user enter maximum number of arrayelement X, then create an array size N, and assign each element of array to randomnumber between 1~X. Print the array, and also find which element appeared most in thearray, print all if there are multiple elements which are most at the same time. Sample input:Enter N: 20Enter X: 10 Sample output:8 7 10 8 1 7 4 3 4 7 5 6 4 3 1 10 1 9 9 101 4 7 appear most
write your own MIPS program that allocates space for two integer arrays (P and Q) of size 9 each. You can use pointers or indices for traversing arrays. The program should do the following:a. Read in the value of N (a digit between 1 and 9, the actual working size of your array).b. Read in from the keyboard the first N values of the array P. Note that we want both arrays P and Q to haveidentical elements (see the example below for additional explanation).c. Output to the console the N values of both arrays P and Q (use any format and additional text you like).Textbook i use is "Computer Organization and Design 4th Edition by John L hennesyExample: let’s say that the digit read from the keyboard was 3. This means that N=3; them our program will initialise two arrays with elements P[0], P[1], P[2] and Q[0], Q[1], Q[2]. Elements of the arrays are to be read from the keyboard, let’s assume that they were: 25, 11 and 2. The arrays are to be initialised as following:Q[0]=25 Q[1]=11 Q[2]=…