17. Show the array that results from the following sequence of operations using a hash- ing system under the given conditions: insert 5, insert 205, insert 406, remove 205, insert 407, insert 806, insert 305 (you can simply list the non-null array slots and their contents) a. array size is 100, linear probing used, the value -1 indicates a removed entry. b. array size is 10, linear probing used, the value -1 indicates a removed entry. c. array size is 10, linear probing used, an additional value of type boolean is used, with true indicating a slot has been used. d. array size is 10, with buckets consisting of linked lists.

17. Show the array that results from the following sequence of operations using a hash- ing system under the given conditions: insert 5, insert 205, insert 406, remove 205, insert 407, insert 806, insert 305 (you can simply list the non-null array slots and their contents) a. array size is 100, linear probing used, the value -1 indicates a removed entry. b. array size is 10, linear probing used, the value -1 indicates a removed entry. c. array size is 10, linear probing used, an additional value of type boolean is used, with true indicating a slot has been used. d. array size is 10, with buckets consisting of linked lists.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 29SA

See similar textbooks

Similar questions

2. An interpolation search assumes that the data in an array is sorted and uniformly distributed.Whereas a binary search always looks at the middle item in an array, an interpolation searchlooks where the sought-for item is more likely to occur. For example, if you searched yourtelephone book for Victoria Appleseed, you probably would look near its beginning ratherthan its middle. And if you discovered many Appleseeds, you would look near the lastAppleseed. Instead of looking at the element a[mid] of an array a, as the binary search would,an interpolation search examines a[index], where p = (desiredElement - a[first]) / (a[last] - a[first]) index = first + [(last – first) × p]Implement an interpolation search of an array. For particular arrays, compare the outcomesof an interpolation search and of a binary search. Consider arrays that have uniformlydistributed entries and arrays that do not. Modify and save the file asSearchComparerYourlastname.java.
ALGO2(A)// A is an integer array, index starting at 11:for i=1 to n-1 do2: for j=n to i+1 do3: if (A[j] < A[j-1]) then4: exchange A[j] with A[j-1] Which function best describes the worst-case running time behaviour of ALGO2 on an array of size n? Option 1) a*(n^2) + b*n +c, where a,b,c are constantsOption 2) a*n + b , where a and b are constantsOption 3) a * n * log(n) + b, where a,b are constantsOption 4) a*(n^3) + b*(n^2) + c*n + d, where a,b,c,d are constants
The code below computes the intersection (the number of entries shared by two arrays). It is assumed that neither array contains any duplicates. It computes the intersection by sorting one array (array b) and then iterating over array a to see if each value is in b (through binary search). What is its duration? nt intersection(int[] a, int[] b) {mergesort(b);}int intersect = 0;for (int x : a) {if (binarySearch(b, x) >= 0) {intersect++;return intersect; }}
Magic Index: A magic index in an array A[ 1 .•. n-1] is defined to be an index such that A[ i] i. Given a sorted array of distinct integers, write a method to find a magic index, if one exists, in array A.FOLLOW UPWhat if the values are not distinct?
The following code computes the intersection (the number of elements in common) of twoarrays. It assumes that neither array has duplicates. It computes the intersection by sortingone array (array b) and then iterating through array a checking (via binary search) if eachvalue is in b. What is its runtime?int intersection(int[] a, int[] b) {mergesort(b);}int intersect = 0;for (int x : a) {if (binarySearch(b, x) >= 0) {intersect++;return intersect; }}
In the following code both myList and yourList are dynamic arrays of the same size. The code initializes the array myList to certain values. The value in each element of yourList should be twice the value in the corresponding element in myList. However, the output of this code would show that is not the case. Provide the correct code to accomplish the desired results. int *myList;int *yourList;myList = new int[5];myList[0] = 8;for (int i = 1; i < 5; i++)myList[i] = i * myList[i - 1];yourList = myList;for (int i = 0; i < 5; i++)yourList[i] = 2 * myList[i];
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);
Question 4: (30 marks) A Math teacher is teaching Math course to a set of classes (each class may have different number of students) and want to check the behavior of his students in a homework report. The teacher gave the classes the same exam and marked their answer and wants to know the class whose students got the highest average. Help the teacher in the required analysis of student’s marks by implementing a Java program ClassAverageMArks2DimmArray using 2-dimensional array to store the students marks and then compute the average of each class student’s marks. The program has the following specification: • A Method titled averageClassMarks for computing the average (as double) of a class students marks (given to the method as a single-dimensional array) • Another Method titled averageAllClassesMarks for computing the average (as single array of double) of all the classes class student’s marks (given to the method as a 2dimensional array). This method has to repeatedly call the…
Use C++ Programming bool remove(const char* person) Improve the remove method where you return true if an entry is successfully deleted (i.e. we have found an entry that matches the person), otherwise return false. Initial code below bool remove(const char* person) { for (int i = 0; i < index; i++) { entry* existing = array + (sizeof(entry) * i); if (!strcmp(existing->name, person)) { // MOVE all entries to the left starting to the next // We are to stop before we reach index-1 so as not to reach index-1+1 where data doesn't exist for (int j = i; j < index - 1; j++) { // current entry = next entry *(array + ( sizeof(entry) * (j) ) ) = *(array + ( sizeof(entry) * (j+1) ) ); } index--; break; } } // Added temporarily. You may delete or move this.…
Java Program. Write a function that returns the index of the smallest element in an array of doubles. If there are more such elements than one, return the last index is fine. Using the following header: int IndexOfSmallestArray(double array[], int size) Finish the function implement only.
Below you will find code blocks necessary to insert a value into an ordered array given a position (index) to insert. Be careful! Some lines are not needed. first line COMPLETED: bool insertElement(char array[ ], int& numElems, int &capacity, in position, char value) { last line COMPLETE: bool insertElement(char array[ ], int numElems, int capacity, in position, char value) {
Requirements: Use Java Programming only. Show screenshots of your work. this is the second time I posted this since the previous answer is very wrong. 6. Write method public static int linearSearch(int [] arr, ine key) which returns the largest index such that arr[index] matches the key. If there is match, returns -1. 7. Write method public static double average(int [] arr) which returns the average of all elements in given array arr. Assume that arr has length at least 1. 8. Write method public void crazyPrint(String sentence, int n) which print out the given sentence n times. Assume n is positive integer.