Write a procedure named CountMatches that receives points to two arrays of signed doublewords, and a third parameter that indicates the length of the two arrays. For each element xix, in the first array, if the corresponding yiy, in the second array is equal, increment a count. At the end, return a count of the number of matching array elements in EAX. Write a test program that calls your procedure and passes pointers to two different pairs of arrays. Use the INVOKE statement to call your procedure and pass stack parameters. Create a PROTO declaration for CountMatches. Save and restore any registers (other than EAX) changed by your procedure. You can use the following template and test data to start your coding: .386 .model flat,stdcall .stack 4096 ExitProcess proto, dwExitCode:dword [CountMatches proto....] .data array1 sdword 10,5,4,-6,2 array2 sdword 4,1,2,8,9 count LENGTHOF array1 .code main proc invoke CountMatches,ADDR [, your argument list] invoke CountMatches,ADDR [, your argument list] invoke ExitProcess,0 main endp CountMatches [....] [your code here] CountMatches endp end main.

Write a procedure named CountMatches that receives points to two arrays of signed doublewords, and a third parameter that indicates the length of the two arrays. For each element xix, in the first array, if the corresponding yiy, in the second array is equal, increment a count. At the end, return a count of the number of matching array elements in EAX. Write a test program that calls your procedure and passes pointers to two different pairs of arrays. Use the INVOKE statement to call your procedure and pass stack parameters. Create a PROTO declaration for CountMatches. Save and restore any registers (other than EAX) changed by your procedure. You can use the following template and test data to start your coding: .386 .model flat,stdcall .stack 4096 ExitProcess proto, dwExitCode:dword [CountMatches proto....] .data array1 sdword 10,5,4,-6,2 array2 sdword 4,1,2,8,9 count LENGTHOF array1 .code main proc invoke CountMatches,ADDR [, your argument list] invoke CountMatches,ADDR [, your argument list] invoke ExitProcess,0 main endp CountMatches [....] [your code here] CountMatches endp end main.

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

in c++, use parallel arrays , and srand(time(NULL)) to randomize the two cards dealt at the start Create a Blackjack (21) game. Your version of the game will imagine only a SINGLE suit of cards, so 13 unique cards, {2,3,4,5,6,7,8,9,10,J,Q,K,A}. Upon starting, you will be given two cards from the set, non-repeating. Your program MUST then tell you the odds of receiving a beneficial card (that would put your value at 21 or less), and the odds of receiving a detrimental card (that would put your value over 21). Recall that the J, Q, and K cards are worth ‘10’ points, the A card can be worth either ‘1’ or ‘11’ points, and the other cards are worth their numerical values.
Using C++ Implement the ordered version of removeElement in the window below. Your function should validate inputs and remove the element in the given position by moving all of the other elements down. // removeElement preserves the order of the remaining elements in the array.// @param: char array that is ordered in some way.// @param: int numElems is the number of elements// @param: int position of the element being removed// @returns true if the element is removed, false otherwise.// be careful to use reference parameters where necessary!
. Now take any name from the user, find whether that name is present in that array or not, and print the position of that name in the array if found. Write a search method to sequentially search the name from the array. Invoke the search method from the main method. The array and the name to be searched should be passed into the search method as parameters.Now write a Java program to implement binary search for the above problem.[Hint: You can use equals() and compareTo() methods of String class.]
Write a function template that gets an array of generic type T as well as the number of items within the array, calculates the standard deviation of the items within the array and returns it. The user will first give an integerItemCount value (int) and that many integer values (all ints). Then, the user will give a doubleItemCount value (int) and that many double values (all doubles). Then, the program will use the function template to calculate the standard deviations of both arrays and print them out as first the standard deviation of the int array, then the standard deviation of the double array. Standard deviation of an array with size N, values are given as , and arithmetic mean as μ can be calculated as: Requirements: You MUST define and use a function template that takes an array of generic type T and an integer which defines the size of the array Getting all the user input, calling the appropriate version of the function via the template and printing the output should be done…
Write a C++ program with a linear search only: You have been hired by the SFPD fraud unit to help detect credit card fraud. They have given you a list of 20 stolen credit card numbers, and want you to write a program that can detect if someone is attempting to use one of these credit card numbers at the local Target store.Your program should first read in a list of credit card numbers from a file into an array, and ask the user for a credit card number they would like to use. Then, search the array of credit card numbers to see if the credit card number is in the list. To simplify, we will use a 6 digit credit card number, e.g. 424238. Your list of stolen credit card numbers must be stored in an array of 20 ints. You can get a list from my website and read it in to initialize your array, it is sorted from lowest to highest card number. To get the list into your hills directory, you can use the wget command from the hills prompt: wget http://fog.ccsf.edu/~mluttrel/cs110b/cards.txt…
Suppose you are given a list of students registered in a course and you are required to implement an array-based student list. Each student in the list has name, regNo, department and cGpa. Implement different functions for entering the data (like constructor (for setting to default values), setName, setReg, etc.). You also need to implement the following function related to the array. insertStudent( ) : It has 2 options • Asking the user for index and then insert the student at that index AND • Asking the user for name of the student where the new student is to be added (New student should be added at the index of the student whose name is entered) o If the list is full, it should create a larger list (new size should be entered by the user), copy all the data in it and make insertion as instructed o (Insertion will only be made if the reg of the new student doesn’t exist in the list) deleteStudent( ): Same as insertStudent( ) (either by asking the index or student name) sort( ): Ask…
Write a program that accepts two integer values, called "arraySize" and "multiplier", as user input. Create an array of integers with arraySize elements. Set each array element to the value i*multiplier, where i is the element's index. Next create two functions, called PrintForward() and PrintBackward(), that each accept two parameters: (a) the array to print, (b) the size of the array. The PrintForward() function should print each integer in the array, beginning with index 0. The PrintBackward() function should print the array in reverse order, beginning with the last element in the array and concluding with the element at index 0. As output, print the array once forward and once backward.
Write a program that declares an array of 5 integers called intArray. Do this in main(). Call function fill_up (Display 7-4 in your Module 12 download) from main, passing in a reference to intArray Load the array with the followng values (2, 4, 6, 8, 10). Print the contents of intArray. Do this in main().
Programming in C language. RandomNumbers Declare an integer array locally with the size of 200. Create a program that asks the user how many numbers the have. Use your getChoicel) function from before. Make sure it does not exceed 200 as the locally declared array has the size of 200. Use a loop to assign random numbers from 1 to 10000 to the array elements. (Remember to use srand() to seed the random number generator). Use a second loop to display each number, and also determine the average of all values in the array. You must also find the largest and the smallest numbers. After the for loop, display the average of all numbers. This program will let you enter a list of numbers into an array. It will then display all of the numbers, and finally display the average of all numbers. How many numbers would you like to enter?10 Number 1 is 42 Number 2 is 8468 Number 3 is 6335 Number 4 is 6501 umber 5 is 9170 Number 6 is 5725 Number 7 is 1479 Number 8 is 9359 Number 9 is 6963 Number 10 is…
Write a function secondLargest(array) in JavaScript that returns the second largest value in the array (or undefined if the array doesn't have at least two elements. You must use Array#reduce do the vast majority of the work. (You may do a little pre- and post- processing outside the call to reduce.) The lambda passed to Array#reduce function has parameters in this order: partial, item. For example, secondLargest([1, 3, 2]) should return 2 secondLargest([4]) should return undefined IMPORTANT: Make sure the last line of your submission is module.export = secondLargest;
Write a maxConsecutiveDiff function which returns the maximum difference between any two consecutive values in the array.Consecutive values are next to each other in an array (+/- 1 index)This function should accept all required data as parameters.ExamplesIf the array is 17 15 16 11 14 the maximum consecutive difference is 5 which is the difference between 16 and 11.If the array is 10 13 11 12 19 the maximum consecutive difference is 7 which is the difference between 12 and 19.
Write a program that accepts an integer value called multiplier as user input. Create an array of integers with ARRAY_SIZE elements. This constant has been declared for you in main, and you should leave it in main. Set each array element to the value i*multiplier, where i is the element's index. Next create two functions, called PrintForward() and PrintBackward(), that each accept two parameters: (a) the array to print, (b) the size of the array. The PrintForward() function should print each integer in the array, beginning with index 0. The PrintBackward() function should print the array in reverse order, beginning with the last element in the array and concluding with the element at index 0. As output, print the array once forward and once backward. Input: 2 Output: 0 2 4 6 8 10 12 14 16 18 20 22 22 20 18 16 14 12 10 8 6 4 2 0 int main() {const int ARRAY_SIZE = 12;}