ILO B: Solve given data sorting problems using appropriate basic sorting algorithmsCandidate 1Candidate 2Bo Dalton CapistranoCornelius Raymon AgustínCandidate 3Deja Jayla BañagaCandidate 4Lalla Brielle YabutCandidate 5Franklin Relano CastroList of CandidatesProblem: Generate an array A[0...100] of unsorted elements, wherein the values in the array are indicative ofa vote to a candidate. This means that the values in your array must only range from 1 to 5. Using sorting andsearching techniques, develop an algorithm that will count the votes and indicate the winning candidate.NOTE: The sorting techniques you have the option of using in this activity can be either bubble, selection, orinsertion sort. Justify why you chose to use this sorting algorithm.Deliverables:Pseudocode of Algorithm• Screenshot of Algorithm Code●Output TestingOutput Console Showing Sorted Array Manual CountCount Result of AlgorithmQuestion: Was your developed vote counting algorithm effective? Why or why not?

ALGORITHM:- 1. Create and initialise an array. 2. Pass it to the optimised bubble sort function. 3.…

ILO B: Solve given data sorting problems using appropriate basic sorting algorithms Bo Dalton Capistrano Candidate 1 Candidate 2 Cornelius Raymon Agustín Candidate 3 Candidate 4 Candidate 5 Problem: Generate an array A[0...100] of unsorted elements, wherein the values in the array are indicative a vote to a candidate. This means that the values in your array must only range from 1 to 5. Using sorting an searching techniques, develop an algorithm that will count the votes and indicate the winning candidate. Deja Jayla Bañaga Lalla Brielle Yabut Franklin Relano Castro List of Candidates NOTE: The sorting techniques you have the option of using in this activity can be either bubble, selection, or insertion sort. Justify why you chose to use this sorting algorithm. Deliverables: Pseudocode of Algorithm Screenshot of Algorithm Code • Output Testing

ILO B: Solve given data sorting problems using appropriate basic sorting algorithms Bo Dalton Capistrano Candidate 1 Candidate 2 Cornelius Raymon Agustín Candidate 3 Candidate 4 Candidate 5 Problem: Generate an array A[0...100] of unsorted elements, wherein the values in the array are indicative a vote to a candidate. This means that the values in your array must only range from 1 to 5. Using sorting an searching techniques, develop an algorithm that will count the votes and indicate the winning candidate. Deja Jayla Bañaga Lalla Brielle Yabut Franklin Relano Castro List of Candidates NOTE: The sorting techniques you have the option of using in this activity can be either bubble, selection, or insertion sort. Justify why you chose to use this sorting algorithm. Deliverables: Pseudocode of Algorithm Screenshot of Algorithm Code • Output Testing

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

Suppose the weekly hours for all employees are stored in a two-dimensional array. Each row records an employee's seven-day work hours with seven columns. For example, the following array stores the work hours for eight employees. Su MTW Th F Sa Su Employeel 0 Employee2 1 Employee3 2 Employee4 3 Employees 7 Employee6 5 Employee7 6 Employee8 7 52 2 2 13 7 34 4 3. 4 4 34 9 34 6 8 3 3. 32 2 by Java code 3 4 6. 3 4 4 6 3 4 374 8 3 8 6 35 9 87 4 4 27 Write a program that Prompt the user to enter number of employees Prompt the user to enter the employees names and save their names in a one dimensional array. (Check for availability if name exist, no duplicate names) For each employee, enter the seven-day work hours and save them in a two dimensional array. Compute the total hours worked by each employee and save them in one dimensional array. Compute the wages of employees as follows: up to 40 hours per week the hour price is 20 otherwise the overtime hour price is 1.2 regular hour price.…
In cell C18 type a VLOOKUP function to find the corresponding letter grade (from column D) for the name in A18. The table array parameter is the same as in B18. Type FALSE for the range lookup parameter. Copy the formula in C18 to C19:C22Notice this formula works correctly for all cells. Range lookup of FALSE means do an exact match on the lookup value whether or not the table array is sorted by its first column. In cell E11, type an IF function that compares the score in B11 with the minimum score to pass in A5. If the comparison value is true, display Pass. Otherwise, display Fail. Copy the formula in E11 to E12:E15. Did you use appropriate absolute and relative references so the formula copied properly? In cell F11, type an IF function that compares the grade in D11 with the letter F (type F). If these two are not equal, display Pass. Otherwise, display Fail. Copy the formula in F11 to F12:F15
Homework 7: Merging two sorted arrays Due date: Saturday March 18. Objectives: Learn to implement algorithms that work with multiple arrays. Understand the Merging algorithm. IMPORTANT. Carefully study Lecture 1 from Week 8 on D2L before you start on this. Sometimes we need to combine the values in two sorted sequences to produce a larger sorted sequence. This process is called Merging. As an example, if the first sequence (S1)contains the numbers 2 3 4 4 5 9 and the second sequence (S2) contains the numbers 1 4 5 8 9 11 12 13 17 the output sequence will contain 1 2 3 4 4 4 5 5 8 9 9 11 12 13 17 Each sequence can be stored in an array. The strategy is as follows: Start by comparing the first items in the two input arrays. Write the smaller number to the output array, and move to the the next item in that array. This is repeated until we reach the end of any one of the input arrays; thereafter, we simply copy all the numbers from the other input array to the output array. (In the…
Suppose a programmer writes an array x, where x contains 90 elements arranged in order. The best search algorithm is used to find a target value in array x. How many elements of the array will be checked when the target equals x[29]?
How many comparsions would be needed for selection sort algorithm for these 3 types of arrays and all of them has a size of 6. Please provide a calculation. sorted array unsorted array (Answer should be in range) identical array
2. Sorting Algorithm Exercises Show the results of each swap (exchange) applying the given sorting algorithm on the following set of initial array values. BUBBLE SORT SELECTION SORT 32 8 16 4 24 64 32 8. 16 4 24 2 64 When finished, make sure to click Submit. Optionally, click Save as Draft to save changes and continue working later, or click Cancel to quit without saving changes. SAMSUNG % %24
Lab 16 Implementing bubble sort In this lab, you will implement the bubble sort algorithm. The bubble sort is so called because it compares adjacent items, "bubbling" the smaller one up toward the beginning of the array. By comparing all pairs of adjacent items starting at the end of the array, the smallest item is guaranteed to reach the beginning of the array at the end of the first pass.The second pass begins again at the end of the array, ultimately placing the second smallest item in the second position. During the second pass, there is no need to compare the first and second items, because the smallest element is guaranteed to be in the first position.Bubble sort takes at most n - 1 passes for an array of n items. During the first pass, n - 1 pairs need to be compared. During the second pass, n - 2 pairs need to be compared. During the ith pass, n - i pairs need to be compared. During the last pass, n - (n - 1) or one pair needs to be compared. If, during any pass, no two…
Question 5: Professor Bond has developed the following algorithm that he claims is going to be a break through in computer science. 1 23400 HER 2 { 6 7 8 9 10 11 Assuming array is zero indexed, A[0] is the first and A[n-1] is the last element, the algorithm is as follows: mystery Function (A, n) 12 13 } int last Pos=n-1; while (last Pos > 0) { } int maxPos=0; for (int i=0; i A[maxPos]) i; maxPos = swap (A, maxPos, lastPos); last Pos last Pos - 1; - Given all of this, answer the following questions. Explain what the algorithm does in plain English. Why does the while loop in the algorithm's pseudocode iterate over all ele- ments but the last, rather than for all elements? (c) (d) What is the best-case of this algorithm? What is the (...) bound on the running time of the best-case of this algorithm? What is the worst-case of this algorithm? What is the (...) bound on the running time of the worst-case of this algorithm?
The formula C=numpy.add(A, B) adds the two matrices A and B and stores the result in C.• To subtract matrix B from matrix A, enter C=numpy.subtract(A, B). The result is stored in C.• C=numpy.divide(A, B): Split matrix A into two equal parts and store the result in C.• C stands for numpy.multiply(A, B): Multiply matrices A and B, then store the result in matrices C.• C=numpy.sum(A): Calculate the sum of each element in the matrix A, then store the result in c R.• C=numpy.sum(A, axis = 0): Create a vector C by adding the columns of the matrix A.• C=numpy.sum(A, axis = 1): Summarize matrix A row-by-row and store the result in the vector C. Create Python code that demonstrates the use of these techniques in a sample matrix.
Complete the following logic to insert an item into the linear array, that contains N elements. Following algorithm inserts an element ITEM into the Kth position in LA. 1.Set J = N. 2.Repeat Steps 3 and 4 while J>= K Complete the logic. 5 Exit