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

Related questions

Q: Kim Gigabit purchase items of various quantities; valid quantities are greater than 0 and less than…

A: import java.util.*;public class Main{ public static void sortAsc(int [] arrayToSort) {…

Q: value You are given 4 items as {value, weightpairs in this format {{20, 5}, {60, 20}, {25, 10}, {X,…

Q: F H J M R S V 1 3 4 5 7 8. 9 10 11 12 low, middle, and high indices for each pass when using binary…

A: Pass 1 Low : 0 Mid : 0+13/2 =6 High: 13 ----------------------------------- Pass 2 Low : 7 Mid :…

Q: ratio. The You are given 4 items as {value, weightpairs in this format {{20, 5}, {60, 20}, {25, 10},…

Q: 25- Consider an array A = (50, 40, 90, 60, 80, 20, 30, 70) (i.c. A[0] = 50, A[1] = 40 etc). Show…

A: Answer:

Q: The provided Search algorithm is use to find the specified element in the given array, perform dry…

A: The given code is of binary search algorithm. The complexity of binary search algorithm is O(log2…

Q: GENERAL ENGINEERING Perform the following data structure on Sorting: BASIC PROGRAMMING CREATE an…

A: Hello student Greetings Hope you are doing great Thank You!!!

Q: Binary Search based function to find the latest job (before current job) that doesn't conflict with…

A: Binary Search based function to find the latest job (before current job) that doesn't conflict with…

Q: 4. Sort Matrix By Row Using Selection Sort, write a function sort_matrix_by_row that takes a matrix…

A: Program MAX_SIZE = 10 def sortByRow(mat, n): for i in range (n): # sorting…

Q: Your C++ program is to read the data, one group at a time into a 3X3 matrix and determine if there…

A: C++ program is to read the data, one group at a time into a 3X3 matrix and determine if there is a…

Q: Q1: Suppose an array contains the following elements: -31 -27 . . -9 . 14 17 18 Determine the number…

A: - We need to get the number of comparison for fimding the elements provided in the array.

Q: using selection sort algorithm, the intermediate sorting results of sorting the array…

A: Given array is {12,4,25,20,6,3,100} First Iteration: 100 4 25 20 6 3 12

Q: value weight You are given 4 items as {value, weightpairs in this format {{20, 5}, {60, 20}, {25,…

A: To find the lowest possible value of "b" in the fraction representation for the item no. 4, we need…

Q: Q:During each iteration of Quick Sort algorithm, the first element of array is selected as a pivot.…

A: Quick sort algorithm works on partition like merge sort and follows divide and conquer approach. It…

Q: Suppose that you are attending a one day conference in which several lectures are presented in…

A: Here is the solution which is mentioned below:

Q: Let B = B{3, 4] be the following array of dimension 3 × 4, [3 5 2 1 B = 5 5 8 2 |1 5 2 5 Array B has…

A: The quantifiers are symbols used to express logical conditions as described below:- 1. Existential…

Q: Assume a sorted character array of size n = 26. It contains all the capital letters, i.e, 'A' to…

A: We need to find the last element compared with key for the given array, using binary search…

Q: Kim Gigabit purchase items of various quantities; valid quantities are greater than 0 and less than…

A: The code is given below.

Q: Assume that empName and empID are two parallel arrays of size numEmp that hold employee data. Write…

A: Algorithm: 1. empID[] //containing the employee ID 2. empName[] //containing the names of…

Q: Sort the following numbers using an "in place" version of a selection sort. This means that you…

A: #include <iostream>using namespace std; #define SIZE 10 // Number of donations // Function…

Q: Please implement the linear search algorithm on a randomly generated 23 member array. All numbers…

A: Begin Generate a random number to be searched Generate an array of length 23 filled with random…

Q: Data Structure & Algorithm: Here is an array with exactly 15 elements: 1 2 3 4 5 6 7…

A: The first two elements (1 and 2) can be found by examining two or fewer numbers from the array.

Q: 2. An interpolation search assumes that the data in an array is sorted and uniformly distributed.…

A: ANSWER:-

Concept explainers

Fundamentals of Multithreaded Algorithms

An algorithm that executes a single instruction in a uniprocessor system is called a serial algorithm. In the case of a multiprocessor computer system, a multiprocessor computer can execute multiple instructions in parallel. A multithreaded algorithm is an algorithm that enables multiple instances of the code to be executed concurrently.Multithreading is a concept that allows the CPU to execute threads independently while sharing similar resources. It is an important CPU feature that works on the process. Thread is a sequence of instructions that executes in parallel with other threads. Because of multithreading, multiple tasks can be performed within a single process, making the execution faster.

Question

100%

ILO B: Solve given data sorting problems using appropriate basic sorting algorithms
Candidate 1
Candidate 2
Bo Dalton Capistrano
Cornelius Raymon Agustín
Candidate 3
Deja Jayla Bañaga
Candidate 4
Lalla Brielle Yabut
Candidate 5
Franklin Relano Castro
List of Candidates
Problem: Generate an array A[0...100] of unsorted elements, wherein the values in the array are indicative of
a vote to a candidate. This means that the values in your array must only range from 1 to 5. Using sorting and
searching 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, or
insertion sort. Justify why you chose to use this sorting algorithm.
Deliverables:
Pseudocode of Algorithm
• Screenshot of Algorithm Code
●
Output Testing
Output Console Showing Sorted Array Manual Count
Count Result of Algorithm
Question: Was your developed vote counting algorithm effective? Why or why not?

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

Step 2

Step 3

Step 4

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Fundamentals of Multithreaded Algorithms

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Kim Gigabit purchases items of various quantities; valid quantities are greater than 0 and less than 100Read the quantity for each 10 items from the keyboard and store each into an integer array; if Kim enters a quantity of 0, negative, or greater than 100, it should be rejected, and she should be queried for a valid entry 1. After the valid entries are complete, display the unsorted array content, pass the unsorted array to another method for sorting, and display of the sorted array; you can use the code below for sorting /* * To change this license header, choose License Headers in Project Properties. * To change this template file, choose Tools | Templates * and open the template in the editor. */ package sortascending; public class Sortascending { public static void sortAsc( int[] arrayToSort ) { // Find the integer that should go in each cell j of // the arrayToSort, from cell 0 to the end for ( int j=0; j<arrayToSort.length-1; j++ )…
The check-in and check-out times of each guest for a hotel are given as input. You need to output the maximum number of guests staying at a time at the hotel. [Hint]: Sort the check-in array Sort the check-out array Merge the sorted arrays Keep track of the number of guests at the hotel during each iteration. To do this traverse the merged array. When someone check-ins, guest count increases by one, when someone check-outs, guest count decreases by one. And also keep track of the maximum number at any time Sample Input Check-in times Check out times Sample Output {2.00, 2.10, 3.00, 3.20, 3.50, 5.00} {2.30, 3.40, 3.20, 4.30, 4.00, 5.20} 2 {9.00, 9.40, 9.50, 11.00, 15.00, 18.00} {9.10, 12.00, 11.20, 11.30, 19.00, 20.00} 3 Your answer
weight You are given 4 items as {value, weightpairs in this format {{20,5}, {60, 20}, {25, 10}, {X, 25}}You can assume that the array is sorted based on the value ratio. The capacity of knapsack is 50. The item no. 4 (whose weightis 25 ) is taken fractionally to fill upto the knapsack capacity. That fraction is represented informat. What is the lowest possible value of 6? For the question above, assume the total value stored in the knapsack is 135 after you have filled upto the knapsack capacity. What is the value of X(in other words, the value of the item no. 4) ? Give your answer to at least two decimal places.
Subject - Design and Algorithms Use Radix Sort algorithm to sort the array A = [765, 984, 109, 349, 653, 139, 810, 451, 690, 371].(Note: You must perform the Radix Sort algorithm step-by-step and show your clearly please)
Suppose an array has n elements. This _____ sorts to sort and array works as follows: Find the smallest element and place it in the first position. Then find the smallest of the remaining n-1 elements and place it in the second position. Repeat on n-2 elements, n-3 elements, ..., until the array is sorted.
In the square two dimensional array, the condition to navigate to (reach) the upper triangle elements of the primary diagonal * :is Note: (i) represents row index, (j) represents column index, and SIZE represents the array length i>j O isj O i+jSize-1 O
Assume that the maximum number of employees working in a company is 100 and all employees have personnel numbers (ID) between [1-999999]. Employees' numbers (IDs) will be stored in an array of size 100 . Assume that the ID of a personnel is 15426, then 15426 % 100 = 26 will be calculated and this ID will be assigned to the 26th index of the array. If an ID has already been assigned here, 15426 will be assigned to the 27th index of the array. If 27th index is also full, then an empty space must be searched by increasing the index number and the ID must be assigned when an empty space is found. (If the 99th index is reached when searching empty space, return to the index 0 and continue to search an empty space.) If all elements of the array are full, then the program must print an output indicating that "the array is full". The function that adds records should be given in the form below. This function returns the index number to which the ID is assigned. It must return -2 if the array…
ASAP